31.11/14.69 YES 31.11/14.69 31.11/14.69 Ultimate: Cannot open display: 31.11/14.69 This is Ultimate 0.1.24-8dc7c08-m 31.11/14.69 [2019-03-28 12:40:29,476 INFO L170 SettingsManager]: Resetting all preferences to default values... 31.11/14.69 [2019-03-28 12:40:29,478 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 31.11/14.69 [2019-03-28 12:40:29,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,490 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 31.11/14.69 [2019-03-28 12:40:29,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 31.11/14.69 [2019-03-28 12:40:29,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 31.11/14.69 [2019-03-28 12:40:29,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 31.11/14.69 [2019-03-28 12:40:29,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 31.11/14.69 [2019-03-28 12:40:29,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 31.11/14.69 [2019-03-28 12:40:29,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 31.11/14.69 [2019-03-28 12:40:29,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 31.11/14.69 [2019-03-28 12:40:29,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 31.11/14.69 [2019-03-28 12:40:29,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 31.11/14.69 [2019-03-28 12:40:29,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 31.11/14.69 [2019-03-28 12:40:29,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 31.11/14.69 [2019-03-28 12:40:29,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 31.11/14.69 [2019-03-28 12:40:29,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 31.11/14.69 [2019-03-28 12:40:29,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 31.11/14.69 [2019-03-28 12:40:29,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 31.11/14.69 [2019-03-28 12:40:29,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 31.11/14.69 [2019-03-28 12:40:29,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 31.11/14.69 [2019-03-28 12:40:29,512 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 31.11/14.69 [2019-03-28 12:40:29,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 31.11/14.69 [2019-03-28 12:40:29,513 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 31.11/14.69 [2019-03-28 12:40:29,514 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 31.11/14.69 [2019-03-28 12:40:29,515 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 31.11/14.69 [2019-03-28 12:40:29,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 31.11/14.69 [2019-03-28 12:40:29,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 31.11/14.69 [2019-03-28 12:40:29,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 31.11/14.69 [2019-03-28 12:40:29,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 31.11/14.69 [2019-03-28 12:40:29,518 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 31.11/14.69 [2019-03-28 12:40:29,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 31.11/14.69 [2019-03-28 12:40:29,519 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 31.11/14.69 [2019-03-28 12:40:29,534 INFO L110 SettingsManager]: Loading preferences was successful 31.11/14.69 [2019-03-28 12:40:29,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 31.11/14.69 [2019-03-28 12:40:29,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 31.11/14.69 [2019-03-28 12:40:29,535 INFO L133 SettingsManager]: * Rewrite not-equals=true 31.11/14.69 [2019-03-28 12:40:29,536 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 31.11/14.69 [2019-03-28 12:40:29,536 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 31.11/14.69 [2019-03-28 12:40:29,536 INFO L133 SettingsManager]: * Use SBE=true 31.11/14.69 [2019-03-28 12:40:29,536 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 31.11/14.69 [2019-03-28 12:40:29,536 INFO L133 SettingsManager]: * Use old map elimination=false 31.11/14.69 [2019-03-28 12:40:29,536 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 31.11/14.69 [2019-03-28 12:40:29,537 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 31.11/14.69 [2019-03-28 12:40:29,537 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 31.11/14.69 [2019-03-28 12:40:29,537 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 31.11/14.69 [2019-03-28 12:40:29,537 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 31.11/14.69 [2019-03-28 12:40:29,537 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 31.11/14.69 [2019-03-28 12:40:29,538 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 31.11/14.69 [2019-03-28 12:40:29,538 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 31.11/14.69 [2019-03-28 12:40:29,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE 31.11/14.69 [2019-03-28 12:40:29,538 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 31.11/14.69 [2019-03-28 12:40:29,538 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 31.11/14.69 [2019-03-28 12:40:29,538 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 31.11/14.69 [2019-03-28 12:40:29,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 31.11/14.69 [2019-03-28 12:40:29,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 31.11/14.69 [2019-03-28 12:40:29,539 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 31.11/14.69 [2019-03-28 12:40:29,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.11/14.69 [2019-03-28 12:40:29,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 31.11/14.69 [2019-03-28 12:40:29,539 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 31.11/14.69 [2019-03-28 12:40:29,540 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 31.11/14.69 [2019-03-28 12:40:29,540 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 31.11/14.69 [2019-03-28 12:40:29,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 31.11/14.69 [2019-03-28 12:40:29,578 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 31.11/14.69 [2019-03-28 12:40:29,582 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 31.11/14.69 [2019-03-28 12:40:29,583 INFO L271 PluginConnector]: Initializing CDTParser... 31.11/14.69 [2019-03-28 12:40:29,583 INFO L276 PluginConnector]: CDTParser initialized 31.11/14.69 [2019-03-28 12:40:29,584 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/14.69 [2019-03-28 12:40:29,651 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/9696045d780043fc8d07a04317c17a66/FLAGb499c975d 31.11/14.69 [2019-03-28 12:40:29,995 INFO L307 CDTParser]: Found 1 translation units. 31.11/14.69 [2019-03-28 12:40:29,996 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/14.69 [2019-03-28 12:40:29,996 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 31.11/14.69 [2019-03-28 12:40:30,003 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/9696045d780043fc8d07a04317c17a66/FLAGb499c975d 31.11/14.69 [2019-03-28 12:40:30,411 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/9696045d780043fc8d07a04317c17a66 31.11/14.69 [2019-03-28 12:40:30,423 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 31.11/14.69 [2019-03-28 12:40:30,424 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 31.11/14.69 [2019-03-28 12:40:30,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 31.11/14.69 [2019-03-28 12:40:30,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 31.11/14.69 [2019-03-28 12:40:30,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 31.11/14.69 [2019-03-28 12:40:30,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f9b38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30, skipping insertion in model container 31.11/14.69 [2019-03-28 12:40:30,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 31.11/14.69 [2019-03-28 12:40:30,458 INFO L176 MainTranslator]: Built tables and reachable declarations 31.11/14.69 [2019-03-28 12:40:30,622 INFO L206 PostProcessor]: Analyzing one entry point: main 31.11/14.69 [2019-03-28 12:40:30,635 INFO L191 MainTranslator]: Completed pre-run 31.11/14.69 [2019-03-28 12:40:30,717 INFO L206 PostProcessor]: Analyzing one entry point: main 31.11/14.69 [2019-03-28 12:40:30,734 INFO L195 MainTranslator]: Completed translation 31.11/14.69 [2019-03-28 12:40:30,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30 WrapperNode 31.11/14.69 [2019-03-28 12:40:30,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 31.11/14.69 [2019-03-28 12:40:30,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 31.11/14.69 [2019-03-28 12:40:30,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 31.11/14.69 [2019-03-28 12:40:30,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 31.11/14.69 [2019-03-28 12:40:30,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 31.11/14.69 [2019-03-28 12:40:30,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 31.11/14.69 [2019-03-28 12:40:30,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 31.11/14.69 [2019-03-28 12:40:30,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized 31.11/14.69 [2019-03-28 12:40:30,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 [2019-03-28 12:40:30,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 31.11/14.69 [2019-03-28 12:40:30,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 31.11/14.69 [2019-03-28 12:40:30,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... 31.11/14.69 [2019-03-28 12:40:30,808 INFO L276 PluginConnector]: RCFGBuilder initialized 31.11/14.69 [2019-03-28 12:40:30,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (1/1) ... 31.11/14.69 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 31.11/14.69 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 31.11/14.69 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 31.11/14.69 [2019-03-28 12:40:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 31.11/14.69 [2019-03-28 12:40:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 31.11/14.69 [2019-03-28 12:40:30,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 31.11/14.69 [2019-03-28 12:40:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 31.11/14.69 [2019-03-28 12:40:30,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 31.11/14.69 [2019-03-28 12:40:30,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 31.11/14.69 [2019-03-28 12:40:31,145 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 31.11/14.69 [2019-03-28 12:40:31,145 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 31.11/14.69 [2019-03-28 12:40:31,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:31 BoogieIcfgContainer 31.11/14.69 [2019-03-28 12:40:31,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 31.11/14.69 [2019-03-28 12:40:31,147 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 31.11/14.69 [2019-03-28 12:40:31,148 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 31.11/14.69 [2019-03-28 12:40:31,150 INFO L276 PluginConnector]: BlockEncodingV2 initialized 31.11/14.69 [2019-03-28 12:40:31,150 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:31" (1/1) ... 31.11/14.69 [2019-03-28 12:40:31,168 INFO L313 BlockEncoder]: Initial Icfg 44 locations, 45 edges 31.11/14.69 [2019-03-28 12:40:31,169 INFO L258 BlockEncoder]: Using Remove infeasible edges 31.11/14.69 [2019-03-28 12:40:31,170 INFO L263 BlockEncoder]: Using Maximize final states 31.11/14.69 [2019-03-28 12:40:31,170 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 31.11/14.69 [2019-03-28 12:40:31,171 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 31.11/14.69 [2019-03-28 12:40:31,172 INFO L296 BlockEncoder]: Using Remove sink states 31.11/14.69 [2019-03-28 12:40:31,173 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 31.11/14.69 [2019-03-28 12:40:31,174 INFO L179 BlockEncoder]: Using Rewrite not-equals 31.11/14.69 [2019-03-28 12:40:31,200 INFO L185 BlockEncoder]: Using Use SBE 31.11/14.69 [2019-03-28 12:40:31,240 INFO L200 BlockEncoder]: SBE split 23 edges 31.11/14.69 [2019-03-28 12:40:31,245 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 31.11/14.69 [2019-03-28 12:40:31,247 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.11/14.69 [2019-03-28 12:40:31,284 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding 31.11/14.69 [2019-03-28 12:40:31,287 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 31.11/14.69 [2019-03-28 12:40:31,289 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 31.11/14.69 [2019-03-28 12:40:31,289 INFO L71 MaximizeFinalStates]: 0 new accepting states 31.11/14.69 [2019-03-28 12:40:31,290 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 31.11/14.69 [2019-03-28 12:40:31,290 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 31.11/14.69 [2019-03-28 12:40:31,291 INFO L313 BlockEncoder]: Encoded RCFG 36 locations, 65 edges 31.11/14.69 [2019-03-28 12:40:31,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:31 BasicIcfg 31.11/14.69 [2019-03-28 12:40:31,291 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 31.11/14.69 [2019-03-28 12:40:31,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 31.11/14.69 [2019-03-28 12:40:31,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... 31.11/14.69 [2019-03-28 12:40:31,296 INFO L276 PluginConnector]: TraceAbstraction initialized 31.11/14.69 [2019-03-28 12:40:31,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:40:30" (1/4) ... 31.11/14.69 [2019-03-28 12:40:31,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72362071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:31, skipping insertion in model container 31.11/14.69 [2019-03-28 12:40:31,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (2/4) ... 31.11/14.69 [2019-03-28 12:40:31,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72362071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:40:31, skipping insertion in model container 31.11/14.69 [2019-03-28 12:40:31,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:31" (3/4) ... 31.11/14.69 [2019-03-28 12:40:31,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72362071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:31, skipping insertion in model container 31.11/14.69 [2019-03-28 12:40:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:31" (4/4) ... 31.11/14.69 [2019-03-28 12:40:31,300 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.11/14.69 [2019-03-28 12:40:31,311 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 31.11/14.69 [2019-03-28 12:40:31,319 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. 31.11/14.69 [2019-03-28 12:40:31,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 22 error locations. 31.11/14.69 [2019-03-28 12:40:31,366 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.11/14.69 [2019-03-28 12:40:31,367 INFO L382 AbstractCegarLoop]: Interprodecural is true 31.11/14.69 [2019-03-28 12:40:31,367 INFO L383 AbstractCegarLoop]: Hoare is true 31.11/14.69 [2019-03-28 12:40:31,368 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 31.11/14.69 [2019-03-28 12:40:31,368 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 31.11/14.69 [2019-03-28 12:40:31,368 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.11/14.69 [2019-03-28 12:40:31,368 INFO L387 AbstractCegarLoop]: Difference is false 31.11/14.69 [2019-03-28 12:40:31,368 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 31.11/14.69 [2019-03-28 12:40:31,368 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 31.11/14.69 [2019-03-28 12:40:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. 31.11/14.69 [2019-03-28 12:40:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.11/14.69 [2019-03-28 12:40:31,390 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:31,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.11/14.69 [2019-03-28 12:40:31,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash 111734, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:31,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:31,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:31,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:31,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:31,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:31,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:31,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:31,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:31,607 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:31,774 INFO L93 Difference]: Finished difference Result 36 states and 65 transitions. 31.11/14.69 [2019-03-28 12:40:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:31,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.11/14.69 [2019-03-28 12:40:31,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:31,790 INFO L225 Difference]: With dead ends: 36 31.11/14.69 [2019-03-28 12:40:31,791 INFO L226 Difference]: Without dead ends: 34 31.11/14.69 [2019-03-28 12:40:31,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 31.11/14.69 [2019-03-28 12:40:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 31.11/14.69 [2019-03-28 12:40:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 31.11/14.69 [2019-03-28 12:40:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. 31.11/14.69 [2019-03-28 12:40:31,836 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 3 31.11/14.69 [2019-03-28 12:40:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:31,837 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. 31.11/14.69 [2019-03-28 12:40:31,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. 31.11/14.69 [2019-03-28 12:40:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.11/14.69 [2019-03-28 12:40:31,838 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:31,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.11/14.69 [2019-03-28 12:40:31,838 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash 111736, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:31,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:31,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:31,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:31,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:31,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:31,869 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:31,969 INFO L93 Difference]: Finished difference Result 36 states and 61 transitions. 31.11/14.69 [2019-03-28 12:40:31,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:31,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.11/14.69 [2019-03-28 12:40:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:31,971 INFO L225 Difference]: With dead ends: 36 31.11/14.69 [2019-03-28 12:40:31,972 INFO L226 Difference]: Without dead ends: 34 31.11/14.69 [2019-03-28 12:40:31,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 31.11/14.69 [2019-03-28 12:40:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 31.11/14.69 [2019-03-28 12:40:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 31.11/14.69 [2019-03-28 12:40:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 59 transitions. 31.11/14.69 [2019-03-28 12:40:31,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 59 transitions. Word has length 3 31.11/14.69 [2019-03-28 12:40:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:31,978 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 59 transitions. 31.11/14.69 [2019-03-28 12:40:31,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 59 transitions. 31.11/14.69 [2019-03-28 12:40:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 31.11/14.69 [2019-03-28 12:40:31,979 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:31,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 31.11/14.69 [2019-03-28 12:40:31,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash 111737, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:31,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,023 INFO L87 Difference]: Start difference. First operand 34 states and 59 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,132 INFO L93 Difference]: Finished difference Result 34 states and 59 transitions. 31.11/14.69 [2019-03-28 12:40:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 31.11/14.69 [2019-03-28 12:40:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,134 INFO L225 Difference]: With dead ends: 34 31.11/14.69 [2019-03-28 12:40:32,134 INFO L226 Difference]: Without dead ends: 32 31.11/14.69 [2019-03-28 12:40:32,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 31.11/14.69 [2019-03-28 12:40:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 31.11/14.69 [2019-03-28 12:40:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 31.11/14.69 [2019-03-28 12:40:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 57 transitions. 31.11/14.69 [2019-03-28 12:40:32,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 57 transitions. Word has length 3 31.11/14.69 [2019-03-28 12:40:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,140 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 57 transitions. 31.11/14.69 [2019-03-28 12:40:32,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 57 transitions. 31.11/14.69 [2019-03-28 12:40:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 31.11/14.69 [2019-03-28 12:40:32,140 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:32,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 31.11/14.69 [2019-03-28 12:40:32,141 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:32,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash 3461536, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:32,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:32,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,178 INFO L87 Difference]: Start difference. First operand 32 states and 57 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,274 INFO L93 Difference]: Finished difference Result 32 states and 57 transitions. 31.11/14.69 [2019-03-28 12:40:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 31.11/14.69 [2019-03-28 12:40:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,302 INFO L225 Difference]: With dead ends: 32 31.11/14.69 [2019-03-28 12:40:32,302 INFO L226 Difference]: Without dead ends: 28 31.11/14.69 [2019-03-28 12:40:32,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 31.11/14.69 [2019-03-28 12:40:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 31.11/14.69 [2019-03-28 12:40:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 31.11/14.69 [2019-03-28 12:40:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. 31.11/14.69 [2019-03-28 12:40:32,307 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 4 31.11/14.69 [2019-03-28 12:40:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,307 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. 31.11/14.69 [2019-03-28 12:40:32,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,307 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. 31.11/14.69 [2019-03-28 12:40:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 31.11/14.69 [2019-03-28 12:40:32,308 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:32,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 31.11/14.69 [2019-03-28 12:40:32,308 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash 3461538, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:32,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:32,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:32,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,341 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,427 INFO L93 Difference]: Finished difference Result 32 states and 49 transitions. 31.11/14.69 [2019-03-28 12:40:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 31.11/14.69 [2019-03-28 12:40:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,429 INFO L225 Difference]: With dead ends: 32 31.11/14.69 [2019-03-28 12:40:32,429 INFO L226 Difference]: Without dead ends: 28 31.11/14.69 [2019-03-28 12:40:32,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 31.11/14.69 [2019-03-28 12:40:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 31.11/14.69 [2019-03-28 12:40:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 31.11/14.69 [2019-03-28 12:40:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. 31.11/14.69 [2019-03-28 12:40:32,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 4 31.11/14.69 [2019-03-28 12:40:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,434 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. 31.11/14.69 [2019-03-28 12:40:32,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. 31.11/14.69 [2019-03-28 12:40:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 31.11/14.69 [2019-03-28 12:40:32,435 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:32,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 31.11/14.69 [2019-03-28 12:40:32,435 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash 3461539, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:32,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:32,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,471 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,542 INFO L93 Difference]: Finished difference Result 28 states and 45 transitions. 31.11/14.69 [2019-03-28 12:40:32,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 31.11/14.69 [2019-03-28 12:40:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,544 INFO L225 Difference]: With dead ends: 28 31.11/14.69 [2019-03-28 12:40:32,544 INFO L226 Difference]: Without dead ends: 23 31.11/14.69 [2019-03-28 12:40:32,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 31.11/14.69 [2019-03-28 12:40:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 31.11/14.69 [2019-03-28 12:40:32,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 31.11/14.69 [2019-03-28 12:40:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. 31.11/14.69 [2019-03-28 12:40:32,548 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 4 31.11/14.69 [2019-03-28 12:40:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,548 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. 31.11/14.69 [2019-03-28 12:40:32,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. 31.11/14.69 [2019-03-28 12:40:32,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 31.11/14.69 [2019-03-28 12:40:32,549 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:32,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 31.11/14.69 [2019-03-28 12:40:32,549 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 107305869, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:32,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:32,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,581 INFO L87 Difference]: Start difference. First operand 23 states and 40 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,643 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. 31.11/14.69 [2019-03-28 12:40:32,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 31.11/14.69 [2019-03-28 12:40:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,644 INFO L225 Difference]: With dead ends: 28 31.11/14.69 [2019-03-28 12:40:32,644 INFO L226 Difference]: Without dead ends: 23 31.11/14.69 [2019-03-28 12:40:32,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. 31.11/14.69 [2019-03-28 12:40:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 31.11/14.69 [2019-03-28 12:40:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 31.11/14.69 [2019-03-28 12:40:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. 31.11/14.69 [2019-03-28 12:40:32,648 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 35 transitions. Word has length 5 31.11/14.69 [2019-03-28 12:40:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,648 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 35 transitions. 31.11/14.69 [2019-03-28 12:40:32,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. 31.11/14.69 [2019-03-28 12:40:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 31.11/14.69 [2019-03-28 12:40:32,649 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:32,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 31.11/14.69 [2019-03-28 12:40:32,649 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash 107305870, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:32,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,691 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,743 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. 31.11/14.69 [2019-03-28 12:40:32,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 31.11/14.69 [2019-03-28 12:40:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,744 INFO L225 Difference]: With dead ends: 23 31.11/14.69 [2019-03-28 12:40:32,744 INFO L226 Difference]: Without dead ends: 18 31.11/14.69 [2019-03-28 12:40:32,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. 31.11/14.69 [2019-03-28 12:40:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. 31.11/14.69 [2019-03-28 12:40:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. 31.11/14.69 [2019-03-28 12:40:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. 31.11/14.69 [2019-03-28 12:40:32,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 5 31.11/14.69 [2019-03-28 12:40:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,747 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. 31.11/14.69 [2019-03-28 12:40:32,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. 31.11/14.69 [2019-03-28 12:40:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 31.11/14.69 [2019-03-28 12:40:32,749 INFO L394 BasicCegarLoop]: Found error trace 31.11/14.69 [2019-03-28 12:40:32,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 31.11/14.69 [2019-03-28 12:40:32,749 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 31.11/14.69 [2019-03-28 12:40:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.69 [2019-03-28 12:40:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash 107305867, now seen corresponding path program 1 times 31.11/14.69 [2019-03-28 12:40:32,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.69 [2019-03-28 12:40:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.69 [2019-03-28 12:40:32,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.69 [2019-03-28 12:40:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.69 [2019-03-28 12:40:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.69 [2019-03-28 12:40:32,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 31.11/14.69 [2019-03-28 12:40:32,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 31.11/14.69 [2019-03-28 12:40:32,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 31.11/14.69 [2019-03-28 12:40:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 31.11/14.69 [2019-03-28 12:40:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,777 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 3 states. 31.11/14.69 [2019-03-28 12:40:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 31.11/14.69 [2019-03-28 12:40:32,824 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. 31.11/14.69 [2019-03-28 12:40:32,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 31.11/14.69 [2019-03-28 12:40:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 31.11/14.69 [2019-03-28 12:40:32,825 INFO L225 Difference]: With dead ends: 18 31.11/14.69 [2019-03-28 12:40:32,825 INFO L226 Difference]: Without dead ends: 0 31.11/14.69 [2019-03-28 12:40:32,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 31.11/14.69 [2019-03-28 12:40:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 31.11/14.69 [2019-03-28 12:40:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 31.11/14.69 [2019-03-28 12:40:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 31.11/14.69 [2019-03-28 12:40:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 31.11/14.69 [2019-03-28 12:40:32,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 31.11/14.69 [2019-03-28 12:40:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. 31.11/14.69 [2019-03-28 12:40:32,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/14.69 [2019-03-28 12:40:32,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 31.11/14.69 [2019-03-28 12:40:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 31.11/14.69 [2019-03-28 12:40:32,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 31.11/14.69 [2019-03-28 12:40:32,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 31.11/14.69 [2019-03-28 12:40:32,863 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,863 INFO L448 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,863 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,865 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,866 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point L12-4(lines 12 14) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,867 INFO L448 ceAbstractionStarter]: For program point L12-6(line 12) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,868 INFO L444 ceAbstractionStarter]: At program point L12-8(lines 12 14) the Hoare annotation is: (and (= 0 ULTIMATE.start_iterate_~i~0.offset) (= (select |#valid| ULTIMATE.start_iterate_~i~0.base) 1) (= ULTIMATE.start_iterate_~bound_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_iterate_~bound_ref~0.base)) (= ULTIMATE.start_iterate_~sum~0.offset 0) (= (select |#length| ULTIMATE.start_iterate_~i~0.base) 4) (= 4 (select |#length| ULTIMATE.start_iterate_~sum~0.base)) (= (select |#valid| ULTIMATE.start_iterate_~sum~0.base) 1) (= (select |#valid| ULTIMATE.start_iterate_~bound_ref~0.base) 1)) 31.11/14.69 [2019-03-28 12:40:32,868 INFO L448 ceAbstractionStarter]: For program point L12-9(lines 12 14) no Hoare annotation was computed. 31.11/14.69 [2019-03-28 12:40:32,868 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 31.11/14.69 [2019-03-28 12:40:32,878 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.69 [2019-03-28 12:40:32,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.69 [2019-03-28 12:40:32,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.69 [2019-03-28 12:40:32,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.69 [2019-03-28 12:40:32,885 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.69 [2019-03-28 12:40:32,886 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.69 [2019-03-28 12:40:32,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:32 BasicIcfg 31.11/14.69 [2019-03-28 12:40:32,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 31.11/14.69 [2019-03-28 12:40:32,889 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 31.11/14.69 [2019-03-28 12:40:32,889 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 31.11/14.69 [2019-03-28 12:40:32,892 INFO L276 PluginConnector]: BuchiAutomizer initialized 31.11/14.69 [2019-03-28 12:40:32,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/14.69 [2019-03-28 12:40:32,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:40:30" (1/5) ... 31.11/14.69 [2019-03-28 12:40:32,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b693abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:32, skipping insertion in model container 31.11/14.69 [2019-03-28 12:40:32,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/14.69 [2019-03-28 12:40:32,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:40:30" (2/5) ... 31.11/14.69 [2019-03-28 12:40:32,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b693abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:40:32, skipping insertion in model container 31.11/14.70 [2019-03-28 12:40:32,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/14.70 [2019-03-28 12:40:32,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:40:31" (3/5) ... 31.11/14.70 [2019-03-28 12:40:32,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b693abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:32, skipping insertion in model container 31.11/14.70 [2019-03-28 12:40:32,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/14.70 [2019-03-28 12:40:32,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:40:31" (4/5) ... 31.11/14.70 [2019-03-28 12:40:32,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b693abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:32, skipping insertion in model container 31.11/14.70 [2019-03-28 12:40:32,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 31.11/14.70 [2019-03-28 12:40:32,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:40:32" (5/5) ... 31.11/14.70 [2019-03-28 12:40:32,897 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 31.11/14.70 [2019-03-28 12:40:32,918 INFO L133 ementStrategyFactory]: Using default assertion order modulation 31.11/14.70 [2019-03-28 12:40:32,918 INFO L374 BuchiCegarLoop]: Interprodecural is true 31.11/14.70 [2019-03-28 12:40:32,919 INFO L375 BuchiCegarLoop]: Hoare is true 31.11/14.70 [2019-03-28 12:40:32,919 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 31.11/14.70 [2019-03-28 12:40:32,919 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 31.11/14.70 [2019-03-28 12:40:32,919 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 31.11/14.70 [2019-03-28 12:40:32,919 INFO L379 BuchiCegarLoop]: Difference is false 31.11/14.70 [2019-03-28 12:40:32,919 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 31.11/14.70 [2019-03-28 12:40:32,919 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 31.11/14.70 [2019-03-28 12:40:32,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. 31.11/14.70 [2019-03-28 12:40:32,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 31.11/14.70 [2019-03-28 12:40:32,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.11/14.70 [2019-03-28 12:40:32,929 INFO L119 BuchiIsEmpty]: Starting construction of run 31.11/14.70 [2019-03-28 12:40:32,933 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 31.11/14.70 [2019-03-28 12:40:32,933 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 31.11/14.70 [2019-03-28 12:40:32,933 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 31.11/14.70 [2019-03-28 12:40:32,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states. 31.11/14.70 [2019-03-28 12:40:32,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 31.11/14.70 [2019-03-28 12:40:32,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.11/14.70 [2019-03-28 12:40:32,936 INFO L119 BuchiIsEmpty]: Starting construction of run 31.11/14.70 [2019-03-28 12:40:32,936 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 31.11/14.70 [2019-03-28 12:40:32,936 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 31.11/14.70 [2019-03-28 12:40:32,942 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [81] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 8#L-1true [127] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_iterate_~bound_1 |v_ULTIMATE.start_iterate_#in~bound_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (< |v_ULTIMATE.start_iterate_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_iterate_~sum~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= |v_ULTIMATE.start_iterate_#in~bound_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_ULTIMATE.start_iterate_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_iterate_~i~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) 0) (< |v_ULTIMATE.start_iterate_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 4) |v_#length_1|) (> |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 0) (= v_ULTIMATE.start_iterate_~sum~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= v_ULTIMATE.start_iterate_~i~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_iterate_#t~malloc0.offset=|v_ULTIMATE.start_iterate_#t~malloc0.offset_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_1, ULTIMATE.start_iterate_#t~malloc0.base=|v_ULTIMATE.start_iterate_#t~malloc0.base_1|, ULTIMATE.start_iterate_#t~malloc1.base=|v_ULTIMATE.start_iterate_#t~malloc1.base_1|, ULTIMATE.start_iterate_#t~malloc2.base=|v_ULTIMATE.start_iterate_#t~malloc2.base_1|, ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_1, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_1, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_1, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_1|, ULTIMATE.start_iterate_#t~malloc2.offset=|v_ULTIMATE.start_iterate_#t~malloc2.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_iterate_#t~malloc1.offset=|v_ULTIMATE.start_iterate_#t~malloc1.offset_1|, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_1|, ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_1|, ULTIMATE.start_iterate_#in~bound=|v_ULTIMATE.start_iterate_#in~bound_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_iterate_#t~mem9=|v_ULTIMATE.start_iterate_#t~mem9_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_1|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_1|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_1|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_1, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_1, ULTIMATE.start_iterate_#res=|v_ULTIMATE.start_iterate_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_iterate_#t~malloc0.offset, ULTIMATE.start_iterate_~bound_ref~0.offset, ULTIMATE.start_iterate_#t~malloc0.base, ULTIMATE.start_iterate_#t~malloc1.base, ULTIMATE.start_iterate_#t~malloc2.base, ULTIMATE.start_iterate_~i~0.offset, ULTIMATE.start_iterate_~sum~0.offset, ULTIMATE.start_iterate_~bound_ref~0.base, #length, ULTIMATE.start_iterate_~i~0.base, ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~malloc2.offset, ULTIMATE.start_iterate_#t~malloc1.offset, ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#in~bound, ULTIMATE.start_main_#res, ULTIMATE.start_iterate_#t~mem9, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_iterate_#t~mem8, ULTIMATE.start_iterate_#t~mem3, ULTIMATE.start_iterate_#t~mem5, ULTIMATE.start_iterate_~bound, ULTIMATE.start_iterate_~sum~0.base, ULTIMATE.start_iterate_#res] 10#L10true [58] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3) v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 v_ULTIMATE.start_iterate_~bound_3)) |v_#memory_int_1|)) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} AuxVars[] AssignedVars[#memory_int] 25#L10-1true [77] L10-1-->L11: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_iterate_~sum~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3) v_ULTIMATE.start_iterate_~sum~0.offset_3 0)) |v_#memory_int_3|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_iterate_~sum~0.base_3))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} AuxVars[] AssignedVars[#memory_int] 29#L11true [82] L11-->L12-8: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3) v_ULTIMATE.start_iterate_~i~0.offset_3 0)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_iterate_~i~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_iterate_~i~0.base_3))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 38#L12-8true 31.11/14.70 [2019-03-28 12:40:32,943 INFO L796 eck$LassoCheckResult]: Loop: 38#L12-8true [98] L12-8-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_iterate_~i~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_iterate_~i~0.base_6) v_ULTIMATE.start_iterate_~i~0.offset_5) |v_ULTIMATE.start_iterate_#t~mem5_2|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_iterate_~i~0.base_6))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_2|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem5] 13#L12-1true [63] L12-1-->L12-2: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_5) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_iterate_~bound_ref~0.base_6) v_ULTIMATE.start_iterate_~bound_ref~0.offset_5))) InVars {ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_2|, #valid=|v_#valid_15|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6] 11#L12-2true [62] L12-2-->L13: Formula: (< |v_ULTIMATE.start_iterate_#t~mem5_6| |v_ULTIMATE.start_iterate_#t~mem6_6|) InVars {ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_6|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_6|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_5|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#t~mem5] 34#L13true [91] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_iterate_~sum~0.base_6)) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_iterate_~sum~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_iterate_~sum~0.base_6) v_ULTIMATE.start_iterate_~sum~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_17|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7] 32#L13-1true [88] L13-1-->L13-2: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_iterate_~i~0.base_9)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_iterate_~i~0.base_9)) (= |v_ULTIMATE.start_iterate_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_iterate_~i~0.base_9) v_ULTIMATE.start_iterate_~i~0.offset_7))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem8] 30#L13-2true [180] L13-2-->L12-4: Formula: (and (= (store |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17) v_ULTIMATE.start_iterate_~sum~0.offset_13 (+ |v_ULTIMATE.start_iterate_#t~mem7_6| |v_ULTIMATE.start_iterate_#t~mem8_6|))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_iterate_~sum~0.base_17)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_13) (= (select |v_#valid_37| v_ULTIMATE.start_iterate_~sum~0.base_17) 1)) InVars {ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_6|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_5|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem8, #memory_int] 23#L12-4true [183] L12-4-->L12-6: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_13) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_iterate_~i~0.base_18)) (= |v_ULTIMATE.start_iterate_#t~mem3_5| (select (select |v_#memory_int_23| v_ULTIMATE.start_iterate_~i~0.base_18) v_ULTIMATE.start_iterate_~i~0.offset_13)) (= (select |v_#valid_42| v_ULTIMATE.start_iterate_~i~0.base_18) 1) (= |v_ULTIMATE.start_iterate_#t~mem3_5| |v_ULTIMATE.start_iterate_#t~post4_5|)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_5|, #valid=|v_#valid_42|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_5|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3] 21#L12-6true [184] L12-6-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_iterate_~i~0.base_19)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_iterate_~i~0.base_19)) (= (store |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19 (store (select |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19) v_ULTIMATE.start_iterate_~i~0.offset_14 (+ |v_ULTIMATE.start_iterate_#t~post4_7| 1))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_14)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_7|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_6|, #valid=|v_#valid_43|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_6|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3, #memory_int] 38#L12-8true 31.11/14.70 [2019-03-28 12:40:32,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash 107276016, now seen corresponding path program 1 times 31.11/14.70 [2019-03-28 12:40:32,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.70 [2019-03-28 12:40:32,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.70 [2019-03-28 12:40:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:32,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash -870728200, now seen corresponding path program 1 times 31.11/14.70 [2019-03-28 12:40:32,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.70 [2019-03-28 12:40:32,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.70 [2019-03-28 12:40:32,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:32,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:32,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:33,014 INFO L82 PathProgramCache]: Analyzing trace with hash 370951655, now seen corresponding path program 1 times 31.11/14.70 [2019-03-28 12:40:33,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.70 [2019-03-28 12:40:33,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.70 [2019-03-28 12:40:33,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:33,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:33,531 WARN L188 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 31.11/14.70 [2019-03-28 12:40:33,649 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 31.11/14.70 [2019-03-28 12:40:33,663 INFO L216 LassoAnalysis]: Preferences: 31.11/14.70 [2019-03-28 12:40:33,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.11/14.70 [2019-03-28 12:40:33,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.11/14.70 [2019-03-28 12:40:33,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.11/14.70 [2019-03-28 12:40:33,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.11/14.70 [2019-03-28 12:40:33,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.11/14.70 [2019-03-28 12:40:33,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.11/14.70 [2019-03-28 12:40:33,665 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.11/14.70 [2019-03-28 12:40:33,666 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso 31.11/14.70 [2019-03-28 12:40:33,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.11/14.70 [2019-03-28 12:40:33,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.11/14.70 [2019-03-28 12:40:33,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:33,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:34,050 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 31.11/14.70 [2019-03-28 12:40:34,168 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 31.11/14.70 [2019-03-28 12:40:34,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:34,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:34,580 INFO L300 LassoAnalysis]: Preprocessing complete. 31.11/14.70 [2019-03-28 12:40:34,586 INFO L497 LassoAnalysis]: Using template 'affine'. 31.11/14.70 [2019-03-28 12:40:34,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,598 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:34,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:34,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:34,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:34,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:34,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:34,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:34,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:34,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:34,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.11/14.70 [2019-03-28 12:40:34,689 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 31.11/14.70 [2019-03-28 12:40:34,690 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 31.11/14.70 [2019-03-28 12:40:34,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.11/14.70 [2019-03-28 12:40:34,694 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 31.11/14.70 [2019-03-28 12:40:34,694 INFO L518 LassoAnalysis]: Proved termination. 31.11/14.70 [2019-03-28 12:40:34,695 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.11/14.70 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1 31.11/14.70 Supporting invariants [] 31.11/14.70 [2019-03-28 12:40:34,781 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed 31.11/14.70 [2019-03-28 12:40:34,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.11/14.70 [2019-03-28 12:40:34,790 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.11/14.70 [2019-03-28 12:40:34,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:34,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:34,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:34,869 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:34,884 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 31.11/14.70 [2019-03-28 12:40:34,885 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:34,895 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:34,896 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:34,896 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:18 31.11/14.70 [2019-03-28 12:40:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:34,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:34,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:35,027 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:35,040 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:35,041 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 31.11/14.70 [2019-03-28 12:40:35,042 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,069 INFO L497 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size 31.11/14.70 [2019-03-28 12:40:35,070 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,070 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:41 31.11/14.70 [2019-03-28 12:40:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.70 [2019-03-28 12:40:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:35,280 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/14.70 [2019-03-28 12:40:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:35,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:35,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:35,301 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:35,309 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:35,309 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 31.11/14.70 [2019-03-28 12:40:35,310 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,338 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size 31.11/14.70 [2019-03-28 12:40:35,339 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,340 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 31.11/14.70 [2019-03-28 12:40:35,409 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:35,410 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 31.11/14.70 [2019-03-28 12:40:35,418 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,491 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size 31.11/14.70 [2019-03-28 12:40:35,492 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,493 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 31.11/14.70 [2019-03-28 12:40:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:35,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:35,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:35,790 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:35,799 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:35,799 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 31.11/14.70 [2019-03-28 12:40:35,800 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,827 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size 31.11/14.70 [2019-03-28 12:40:35,827 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,828 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 31.11/14.70 [2019-03-28 12:40:35,864 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:35,865 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 31.11/14.70 [2019-03-28 12:40:35,870 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,926 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size 31.11/14.70 [2019-03-28 12:40:35,927 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:35,928 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 31.11/14.70 [2019-03-28 12:40:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:35,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:35,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:36,005 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:36,005 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 31.11/14.70 [2019-03-28 12:40:36,012 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:36,064 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.4 percent of original size 31.11/14.70 [2019-03-28 12:40:36,065 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:36,065 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 31.11/14.70 [2019-03-28 12:40:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:36,115 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/14.70 [2019-03-28 12:40:36,115 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 13 predicates after loop cannibalization 31.11/14.70 [2019-03-28 12:40:36,120 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 13 loop predicates 31.11/14.70 [2019-03-28 12:40:36,121 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 36 states. Second operand 7 states. 31.11/14.70 [2019-03-28 12:40:37,763 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 36 states.. Second operand 7 states. Result 349 states and 592 transitions. Complement of second has 73 states. 31.11/14.70 [2019-03-28 12:40:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 5 stem states 14 non-accepting loop states 2 accepting loop states 31.11/14.70 [2019-03-28 12:40:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 31.11/14.70 [2019-03-28 12:40:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 350 transitions. 31.11/14.70 [2019-03-28 12:40:37,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 350 transitions. Stem has 5 letters. Loop has 8 letters. 31.11/14.70 [2019-03-28 12:40:37,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/14.70 [2019-03-28 12:40:37,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 350 transitions. Stem has 13 letters. Loop has 8 letters. 31.11/14.70 [2019-03-28 12:40:37,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/14.70 [2019-03-28 12:40:37,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 350 transitions. Stem has 5 letters. Loop has 16 letters. 31.11/14.70 [2019-03-28 12:40:37,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/14.70 [2019-03-28 12:40:37,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 592 transitions. 31.11/14.70 [2019-03-28 12:40:37,821 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 31.11/14.70 [2019-03-28 12:40:37,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 53 states and 58 transitions. 31.11/14.70 [2019-03-28 12:40:37,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 31.11/14.70 [2019-03-28 12:40:37,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 31.11/14.70 [2019-03-28 12:40:37,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 58 transitions. 31.11/14.70 [2019-03-28 12:40:37,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.11/14.70 [2019-03-28 12:40:37,825 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. 31.11/14.70 [2019-03-28 12:40:37,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 58 transitions. 31.11/14.70 [2019-03-28 12:40:37,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 13. 31.11/14.70 [2019-03-28 12:40:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. 31.11/14.70 [2019-03-28 12:40:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. 31.11/14.70 [2019-03-28 12:40:37,829 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 31.11/14.70 [2019-03-28 12:40:37,829 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. 31.11/14.70 [2019-03-28 12:40:37,829 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 31.11/14.70 [2019-03-28 12:40:37,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. 31.11/14.70 [2019-03-28 12:40:37,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 31.11/14.70 [2019-03-28 12:40:37,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 31.11/14.70 [2019-03-28 12:40:37,830 INFO L119 BuchiIsEmpty]: Starting construction of run 31.11/14.70 [2019-03-28 12:40:37,830 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] 31.11/14.70 [2019-03-28 12:40:37,830 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 31.11/14.70 [2019-03-28 12:40:37,831 INFO L794 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY [81] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 743#L-1 [133] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 1))) (and (= v_ULTIMATE.start_iterate_~bound_1 |v_ULTIMATE.start_iterate_#in~bound_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) (< |v_ULTIMATE.start_iterate_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= (store .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 1) |v_#valid_3|) (> |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 0) (= v_ULTIMATE.start_iterate_~sum~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) (= |v_ULTIMATE.start_iterate_#in~bound_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_ULTIMATE.start_iterate_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_iterate_~i~0.base_1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|) (= v_ULTIMATE.start_iterate_~bound_ref~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= (select |v_#valid_6| |v_ULTIMATE.start_iterate_#t~malloc0.base_1|) 0) (< |v_ULTIMATE.start_iterate_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= (select .cse0 |v_ULTIMATE.start_iterate_#t~malloc2.base_1|) 0) (= 0 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (= (store (store (store |v_#length_4| |v_ULTIMATE.start_iterate_#t~malloc0.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc1.base_1| 4) |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 4) |v_#length_1|) (> |v_ULTIMATE.start_iterate_#t~malloc2.base_1| 0) (= v_ULTIMATE.start_iterate_~sum~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_iterate_#t~malloc0.offset_1|) (= 0 (select .cse1 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)) (= 0 |v_ULTIMATE.start_iterate_#t~malloc2.offset_1|) (= v_ULTIMATE.start_iterate_~i~0.offset_1 |v_ULTIMATE.start_iterate_#t~malloc1.offset_1|) (< 0 |v_ULTIMATE.start_iterate_#t~malloc1.base_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_iterate_#t~malloc0.offset=|v_ULTIMATE.start_iterate_#t~malloc0.offset_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_1, ULTIMATE.start_iterate_#t~malloc0.base=|v_ULTIMATE.start_iterate_#t~malloc0.base_1|, ULTIMATE.start_iterate_#t~malloc1.base=|v_ULTIMATE.start_iterate_#t~malloc1.base_1|, ULTIMATE.start_iterate_#t~malloc2.base=|v_ULTIMATE.start_iterate_#t~malloc2.base_1|, ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_1, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_1, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_1, #length=|v_#length_1|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_1, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_1|, ULTIMATE.start_iterate_#t~malloc2.offset=|v_ULTIMATE.start_iterate_#t~malloc2.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_iterate_#t~malloc1.offset=|v_ULTIMATE.start_iterate_#t~malloc1.offset_1|, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_1|, ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_1|, ULTIMATE.start_iterate_#in~bound=|v_ULTIMATE.start_iterate_#in~bound_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, ULTIMATE.start_iterate_#t~mem9=|v_ULTIMATE.start_iterate_#t~mem9_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_1|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_1|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_1|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_1, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_1, ULTIMATE.start_iterate_#res=|v_ULTIMATE.start_iterate_#res_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_iterate_#t~malloc0.offset, ULTIMATE.start_iterate_~bound_ref~0.offset, ULTIMATE.start_iterate_#t~malloc0.base, ULTIMATE.start_iterate_#t~malloc1.base, ULTIMATE.start_iterate_#t~malloc2.base, ULTIMATE.start_iterate_~i~0.offset, ULTIMATE.start_iterate_~sum~0.offset, ULTIMATE.start_iterate_~bound_ref~0.base, #length, ULTIMATE.start_iterate_~i~0.base, ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~malloc2.offset, ULTIMATE.start_iterate_#t~malloc1.offset, ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#in~bound, ULTIMATE.start_main_#res, ULTIMATE.start_iterate_#t~mem9, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_iterate_#t~mem8, ULTIMATE.start_iterate_#t~mem3, ULTIMATE.start_iterate_#t~mem5, ULTIMATE.start_iterate_~bound, ULTIMATE.start_iterate_~sum~0.base, ULTIMATE.start_iterate_#res] 744#L10 [58] L10-->L10-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_3) (= 1 (select |v_#valid_7| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_iterate_~bound_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_iterate_~bound_ref~0.base_3) v_ULTIMATE.start_iterate_~bound_ref~0.offset_3 v_ULTIMATE.start_iterate_~bound_3)) |v_#memory_int_1|)) InVars {#valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_3, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_3, #length=|v_#length_5|, ULTIMATE.start_iterate_~bound=v_ULTIMATE.start_iterate_~bound_3} AuxVars[] AssignedVars[#memory_int] 741#L10-1 [77] L10-1-->L11: Formula: (and (= 1 (select |v_#valid_9| v_ULTIMATE.start_iterate_~sum~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_iterate_~sum~0.base_3) v_ULTIMATE.start_iterate_~sum~0.offset_3 0)) |v_#memory_int_3|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_iterate_~sum~0.base_3))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_3, #length=|v_#length_7|, #valid=|v_#valid_9|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_3} AuxVars[] AssignedVars[#memory_int] 742#L11 [82] L11-->L12-8: Formula: (and (= (store |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_iterate_~i~0.base_3) v_ULTIMATE.start_iterate_~i~0.offset_3 0)) |v_#memory_int_5|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_iterate_~i~0.base_3)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_3) (= 1 (select |v_#valid_11| v_ULTIMATE.start_iterate_~i~0.base_3))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_3, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 739#L12-8 31.11/14.70 [2019-03-28 12:40:37,832 INFO L796 eck$LassoCheckResult]: Loop: 739#L12-8 [98] L12-8-->L12-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_iterate_~i~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_iterate_~i~0.base_6) v_ULTIMATE.start_iterate_~i~0.offset_5) |v_ULTIMATE.start_iterate_#t~mem5_2|) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_iterate_~i~0.base_6))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_5, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_2|, #length=|v_#length_11|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem5] 749#L12-1 [63] L12-1-->L12-2: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (<= 0 v_ULTIMATE.start_iterate_~bound_ref~0.offset_5) (<= (+ v_ULTIMATE.start_iterate_~bound_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_iterate_~bound_ref~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem6_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_iterate_~bound_ref~0.base_6) v_ULTIMATE.start_iterate_~bound_ref~0.offset_5))) InVars {ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_2|, #valid=|v_#valid_15|, ULTIMATE.start_iterate_~bound_ref~0.offset=v_ULTIMATE.start_iterate_~bound_ref~0.offset_5, #memory_int=|v_#memory_int_8|, ULTIMATE.start_iterate_~bound_ref~0.base=v_ULTIMATE.start_iterate_~bound_ref~0.base_6, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6] 745#L12-2 [62] L12-2-->L13: Formula: (< |v_ULTIMATE.start_iterate_#t~mem5_6| |v_ULTIMATE.start_iterate_#t~mem6_6|) InVars {ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_6|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_6|} OutVars{ULTIMATE.start_iterate_#t~mem6=|v_ULTIMATE.start_iterate_#t~mem6_5|, ULTIMATE.start_iterate_#t~mem5=|v_ULTIMATE.start_iterate_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem6, ULTIMATE.start_iterate_#t~mem5] 746#L13 [91] L13-->L13-1: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_5) (= 1 (select |v_#valid_17| v_ULTIMATE.start_iterate_~sum~0.base_6)) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_5 4) (select |v_#length_15| v_ULTIMATE.start_iterate_~sum~0.base_6)) (= |v_ULTIMATE.start_iterate_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_iterate_~sum~0.base_6) v_ULTIMATE.start_iterate_~sum~0.offset_5))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, #length=|v_#length_15|, #valid=|v_#valid_17|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_5, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7] 750#L13-1 [88] L13-1-->L13-2: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_iterate_~i~0.base_9)) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_7) (= 1 (select |v_#valid_19| v_ULTIMATE.start_iterate_~i~0.base_9)) (= |v_ULTIMATE.start_iterate_#t~mem8_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_iterate_~i~0.base_9) v_ULTIMATE.start_iterate_~i~0.offset_7))) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_7, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_17|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem8] 748#L13-2 [180] L13-2-->L12-4: Formula: (and (= (store |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17 (store (select |v_#memory_int_20| v_ULTIMATE.start_iterate_~sum~0.base_17) v_ULTIMATE.start_iterate_~sum~0.offset_13 (+ |v_ULTIMATE.start_iterate_#t~mem7_6| |v_ULTIMATE.start_iterate_#t~mem8_6|))) |v_#memory_int_19|) (<= (+ v_ULTIMATE.start_iterate_~sum~0.offset_13 4) (select |v_#length_29| v_ULTIMATE.start_iterate_~sum~0.base_17)) (<= 0 v_ULTIMATE.start_iterate_~sum~0.offset_13) (= (select |v_#valid_37| v_ULTIMATE.start_iterate_~sum~0.base_17) 1)) InVars {ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_6|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} OutVars{ULTIMATE.start_iterate_~sum~0.offset=v_ULTIMATE.start_iterate_~sum~0.offset_13, ULTIMATE.start_iterate_#t~mem7=|v_ULTIMATE.start_iterate_#t~mem7_5|, ULTIMATE.start_iterate_#t~mem8=|v_ULTIMATE.start_iterate_#t~mem8_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_iterate_~sum~0.base=v_ULTIMATE.start_iterate_~sum~0.base_17} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~mem7, ULTIMATE.start_iterate_#t~mem8, #memory_int] 740#L12-4 [183] L12-4-->L12-6: Formula: (and (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_13) (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_13 4) (select |v_#length_32| v_ULTIMATE.start_iterate_~i~0.base_18)) (= |v_ULTIMATE.start_iterate_#t~mem3_5| (select (select |v_#memory_int_23| v_ULTIMATE.start_iterate_~i~0.base_18) v_ULTIMATE.start_iterate_~i~0.offset_13)) (= (select |v_#valid_42| v_ULTIMATE.start_iterate_~i~0.base_18) 1) (= |v_ULTIMATE.start_iterate_#t~mem3_5| |v_ULTIMATE.start_iterate_#t~post4_5|)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_13, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_5|, #valid=|v_#valid_42|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_5|, #memory_int=|v_#memory_int_23|, #length=|v_#length_32|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3] 738#L12-6 [184] L12-6-->L12-8: Formula: (and (<= (+ v_ULTIMATE.start_iterate_~i~0.offset_14 4) (select |v_#length_33| v_ULTIMATE.start_iterate_~i~0.base_19)) (= 1 (select |v_#valid_43| v_ULTIMATE.start_iterate_~i~0.base_19)) (= (store |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19 (store (select |v_#memory_int_25| v_ULTIMATE.start_iterate_~i~0.base_19) v_ULTIMATE.start_iterate_~i~0.offset_14 (+ |v_ULTIMATE.start_iterate_#t~post4_7| 1))) |v_#memory_int_24|) (<= 0 v_ULTIMATE.start_iterate_~i~0.offset_14)) InVars {ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_7|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_25|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} OutVars{ULTIMATE.start_iterate_~i~0.offset=v_ULTIMATE.start_iterate_~i~0.offset_14, ULTIMATE.start_iterate_#t~post4=|v_ULTIMATE.start_iterate_#t~post4_6|, #valid=|v_#valid_43|, ULTIMATE.start_iterate_#t~mem3=|v_ULTIMATE.start_iterate_#t~mem3_6|, #memory_int=|v_#memory_int_24|, #length=|v_#length_33|, ULTIMATE.start_iterate_~i~0.base=v_ULTIMATE.start_iterate_~i~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_iterate_#t~post4, ULTIMATE.start_iterate_#t~mem3, #memory_int] 739#L12-8 31.11/14.70 [2019-03-28 12:40:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:37,832 INFO L82 PathProgramCache]: Analyzing trace with hash 107454762, now seen corresponding path program 1 times 31.11/14.70 [2019-03-28 12:40:37,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.70 [2019-03-28 12:40:37,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.70 [2019-03-28 12:40:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:37,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash -870728200, now seen corresponding path program 2 times 31.11/14.70 [2019-03-28 12:40:37,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.70 [2019-03-28 12:40:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.70 [2019-03-28 12:40:37,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:37,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1145447969, now seen corresponding path program 1 times 31.11/14.70 [2019-03-28 12:40:37,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 31.11/14.70 [2019-03-28 12:40:37,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 31.11/14.70 [2019-03-28 12:40:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 31.11/14.70 [2019-03-28 12:40:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:38,290 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 31.11/14.70 [2019-03-28 12:40:38,402 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 75 31.11/14.70 [2019-03-28 12:40:38,405 INFO L216 LassoAnalysis]: Preferences: 31.11/14.70 [2019-03-28 12:40:38,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 31.11/14.70 [2019-03-28 12:40:38,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 31.11/14.70 [2019-03-28 12:40:38,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 31.11/14.70 [2019-03-28 12:40:38,406 INFO L127 ssoRankerPreferences]: Use exernal solver: false 31.11/14.70 [2019-03-28 12:40:38,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 31.11/14.70 [2019-03-28 12:40:38,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 31.11/14.70 [2019-03-28 12:40:38,406 INFO L130 ssoRankerPreferences]: Path of dumped script: 31.11/14.70 [2019-03-28 12:40:38,406 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 31.11/14.70 [2019-03-28 12:40:38,406 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 31.11/14.70 [2019-03-28 12:40:38,406 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 31.11/14.70 [2019-03-28 12:40:38,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 31.11/14.70 [2019-03-28 12:40:38,698 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 31.11/14.70 [2019-03-28 12:40:39,154 INFO L300 LassoAnalysis]: Preprocessing complete. 31.11/14.70 [2019-03-28 12:40:39,155 INFO L497 LassoAnalysis]: Using template 'affine'. 31.11/14.70 [2019-03-28 12:40:39,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 31.11/14.70 [2019-03-28 12:40:39,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 31.11/14.70 [2019-03-28 12:40:39,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 31.11/14.70 Termination analysis: LINEAR_WITH_GUESSES 31.11/14.70 Number of strict supporting invariants: 0 31.11/14.70 Number of non-strict supporting invariants: 1 31.11/14.70 Consider only non-deceasing supporting invariants: true 31.11/14.70 Simplify termination arguments: true 31.11/14.70 Simplify supporting invariants: trueOverapproximate stem: false 31.11/14.70 [2019-03-28 12:40:39,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. 31.11/14.70 [2019-03-28 12:40:39,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 31.11/14.70 [2019-03-28 12:40:39,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 31.11/14.70 [2019-03-28 12:40:39,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 31.11/14.70 [2019-03-28 12:40:39,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 31.11/14.70 [2019-03-28 12:40:39,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 31.11/14.70 [2019-03-28 12:40:39,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 31.11/14.70 [2019-03-28 12:40:39,258 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 31.11/14.70 [2019-03-28 12:40:39,258 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. 31.11/14.70 [2019-03-28 12:40:39,258 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 31.11/14.70 [2019-03-28 12:40:39,259 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 31.11/14.70 [2019-03-28 12:40:39,279 INFO L518 LassoAnalysis]: Proved termination. 31.11/14.70 [2019-03-28 12:40:39,279 INFO L520 LassoAnalysis]: Termination argument consisting of: 31.11/14.70 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_2 31.11/14.70 Supporting invariants [] 31.11/14.70 [2019-03-28 12:40:39,369 INFO L297 tatePredicateManager]: 20 out of 24 supporting invariants were superfluous and have been removed 31.11/14.70 [2019-03-28 12:40:39,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.11/14.70 [2019-03-28 12:40:39,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 31.11/14.70 [2019-03-28 12:40:39,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 31.11/14.70 [2019-03-28 12:40:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:39,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:39,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:39,442 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:39,442 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 31.11/14.70 [2019-03-28 12:40:39,443 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:39,461 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:39,461 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:39,462 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 31.11/14.70 [2019-03-28 12:40:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:39,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:39,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:39,598 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:39,607 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:39,608 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 31.11/14.70 [2019-03-28 12:40:39,609 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:39,641 INFO L497 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size 31.11/14.70 [2019-03-28 12:40:39,642 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:39,642 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:41 31.11/14.70 [2019-03-28 12:40:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 31.11/14.70 [2019-03-28 12:40:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:39,861 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/14.70 [2019-03-28 12:40:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:39,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:39,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:39,886 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:39,896 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:39,897 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 31.11/14.70 [2019-03-28 12:40:39,898 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:39,926 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size 31.11/14.70 [2019-03-28 12:40:39,927 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:39,928 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 31.11/14.70 [2019-03-28 12:40:39,998 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:39,998 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 31.11/14.70 [2019-03-28 12:40:40,004 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,062 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.4 percent of original size 31.11/14.70 [2019-03-28 12:40:40,063 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,063 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 31.11/14.70 [2019-03-28 12:40:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:40,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:40,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:40,382 INFO L189 IndexEqualityManager]: detected not equals via solver 31.11/14.70 [2019-03-28 12:40:40,389 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:40,389 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 31.11/14.70 [2019-03-28 12:40:40,390 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,412 INFO L497 ElimStorePlain]: treesize reduction 20, result has 64.9 percent of original size 31.11/14.70 [2019-03-28 12:40:40,412 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,412 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:28 31.11/14.70 [2019-03-28 12:40:40,443 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:40,444 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 31.11/14.70 [2019-03-28 12:40:40,448 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,513 INFO L497 ElimStorePlain]: treesize reduction 43, result has 51.1 percent of original size 31.11/14.70 [2019-03-28 12:40:40,514 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,514 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 31.11/14.70 [2019-03-28 12:40:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 31.11/14.70 [2019-03-28 12:40:40,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjunts are in the unsatisfiable core 31.11/14.70 [2019-03-28 12:40:40,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... 31.11/14.70 [2019-03-28 12:40:40,566 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 31.11/14.70 [2019-03-28 12:40:40,566 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 63 31.11/14.70 [2019-03-28 12:40:40,572 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,621 INFO L497 ElimStorePlain]: treesize reduction 47, result has 48.4 percent of original size 31.11/14.70 [2019-03-28 12:40:40,622 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 31.11/14.70 [2019-03-28 12:40:40,622 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 31.11/14.70 [2019-03-28 12:40:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 31.11/14.70 [2019-03-28 12:40:40,636 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 31.11/14.70 [2019-03-28 12:40:40,637 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 13 predicates after loop cannibalization 31.11/14.70 [2019-03-28 12:40:40,637 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 13 loop predicates 31.11/14.70 [2019-03-28 12:40:40,637 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6 Second operand 7 states. 31.11/14.70 [2019-03-28 12:40:40,801 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 18 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 21 states and 27 transitions. Complement of second has 11 states. 31.11/14.70 [2019-03-28 12:40:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states 31.11/14.70 [2019-03-28 12:40:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 31.11/14.70 [2019-03-28 12:40:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. 31.11/14.70 [2019-03-28 12:40:40,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 5 letters. Loop has 8 letters. 31.11/14.70 [2019-03-28 12:40:40,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/14.70 [2019-03-28 12:40:40,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 13 letters. Loop has 8 letters. 31.11/14.70 [2019-03-28 12:40:40,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/14.70 [2019-03-28 12:40:40,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 5 letters. Loop has 16 letters. 31.11/14.70 [2019-03-28 12:40:40,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. 31.11/14.70 [2019-03-28 12:40:40,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. 31.11/14.70 [2019-03-28 12:40:40,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.11/14.70 [2019-03-28 12:40:40,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. 31.11/14.70 [2019-03-28 12:40:40,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 31.11/14.70 [2019-03-28 12:40:40,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 31.11/14.70 [2019-03-28 12:40:40,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 31.11/14.70 [2019-03-28 12:40:40,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 31.11/14.70 [2019-03-28 12:40:40,810 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/14.70 [2019-03-28 12:40:40,810 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/14.70 [2019-03-28 12:40:40,810 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 31.11/14.70 [2019-03-28 12:40:40,810 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 31.11/14.70 [2019-03-28 12:40:40,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 31.11/14.70 [2019-03-28 12:40:40,811 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 31.11/14.70 [2019-03-28 12:40:40,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 31.11/14.70 [2019-03-28 12:40:40,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:40:40 BasicIcfg 31.11/14.70 [2019-03-28 12:40:40,817 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 31.11/14.70 [2019-03-28 12:40:40,817 INFO L168 Benchmark]: Toolchain (without parser) took 10394.24 ms. Allocated memory was 649.6 MB in the beginning and 843.6 MB in the end (delta: 194.0 MB). Free memory was 563.5 MB in the beginning and 528.7 MB in the end (delta: 34.8 MB). Peak memory consumption was 228.8 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,818 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.59 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 563.5 MB in the beginning and 638.9 MB in the end (delta: -75.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.86 ms. Allocated memory is still 673.2 MB. Free memory was 638.9 MB in the beginning and 635.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,820 INFO L168 Benchmark]: Boogie Preprocessor took 26.97 ms. Allocated memory is still 673.2 MB. Free memory was 635.0 MB in the beginning and 633.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,820 INFO L168 Benchmark]: RCFGBuilder took 339.27 ms. Allocated memory is still 673.2 MB. Free memory was 633.9 MB in the beginning and 610.7 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,821 INFO L168 Benchmark]: BlockEncodingV2 took 144.16 ms. Allocated memory is still 673.2 MB. Free memory was 610.7 MB in the beginning and 600.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,821 INFO L168 Benchmark]: TraceAbstraction took 1595.77 ms. Allocated memory is still 673.2 MB. Free memory was 600.0 MB in the beginning and 427.2 MB in the end (delta: 172.7 MB). Peak memory consumption was 172.7 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,822 INFO L168 Benchmark]: BuchiAutomizer took 7928.37 ms. Allocated memory was 673.2 MB in the beginning and 843.6 MB in the end (delta: 170.4 MB). Free memory was 427.2 MB in the beginning and 528.7 MB in the end (delta: -101.5 MB). Peak memory consumption was 68.9 MB. Max. memory is 50.3 GB. 31.11/14.70 [2019-03-28 12:40:40,825 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 31.11/14.70 --- Results --- 31.11/14.70 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 31.11/14.70 - StatisticsResult: Initial Icfg 31.11/14.70 44 locations, 45 edges 31.11/14.70 - StatisticsResult: Encoded RCFG 31.11/14.70 36 locations, 65 edges 31.11/14.70 * Results from de.uni_freiburg.informatik.ultimate.core: 31.11/14.70 - StatisticsResult: Toolchain Benchmarks 31.11/14.70 Benchmark results are: 31.11/14.70 * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 584.3 MB. There was no memory consumed. Max. memory is 50.3 GB. 31.11/14.70 * CACSL2BoogieTranslator took 309.59 ms. Allocated memory was 649.6 MB in the beginning and 673.2 MB in the end (delta: 23.6 MB). Free memory was 563.5 MB in the beginning and 638.9 MB in the end (delta: -75.4 MB). Peak memory consumption was 30.1 MB. Max. memory is 50.3 GB. 31.11/14.70 * Boogie Procedure Inliner took 44.86 ms. Allocated memory is still 673.2 MB. Free memory was 638.9 MB in the beginning and 635.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 31.11/14.70 * Boogie Preprocessor took 26.97 ms. Allocated memory is still 673.2 MB. Free memory was 635.0 MB in the beginning and 633.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 31.11/14.70 * RCFGBuilder took 339.27 ms. Allocated memory is still 673.2 MB. Free memory was 633.9 MB in the beginning and 610.7 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 50.3 GB. 31.11/14.70 * BlockEncodingV2 took 144.16 ms. Allocated memory is still 673.2 MB. Free memory was 610.7 MB in the beginning and 600.0 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. 31.11/14.70 * TraceAbstraction took 1595.77 ms. Allocated memory is still 673.2 MB. Free memory was 600.0 MB in the beginning and 427.2 MB in the end (delta: 172.7 MB). Peak memory consumption was 172.7 MB. Max. memory is 50.3 GB. 31.11/14.70 * BuchiAutomizer took 7928.37 ms. Allocated memory was 673.2 MB in the beginning and 843.6 MB in the end (delta: 170.4 MB). Free memory was 427.2 MB in the beginning and 528.7 MB in the end (delta: -101.5 MB). Peak memory consumption was 68.9 MB. Max. memory is 50.3 GB. 31.11/14.70 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #length 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #length 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #length 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #length 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #length 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #length 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #memory_int 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #memory_int 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #memory_int 31.11/14.70 - GenericResult: Unfinished Backtranslation 31.11/14.70 unknown boogie variable #memory_int 31.11/14.70 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 31.11/14.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 10]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 15]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 12]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 15]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 11]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 13]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - PositiveResult [Line: 11]: pointer dereference always succeeds 31.11/14.70 For all program executions holds that pointer dereference always succeeds at this location 31.11/14.70 - AllSpecificationsHoldResult: All specifications hold 31.11/14.70 22 specifications checked. All of them hold 31.11/14.70 - InvariantResult [Line: 12]: Loop Invariant 31.11/14.70 [2019-03-28 12:40:40,834 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.70 [2019-03-28 12:40:40,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.70 [2019-03-28 12:40:40,835 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.70 [2019-03-28 12:40:40,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.70 [2019-03-28 12:40:40,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.70 [2019-03-28 12:40:40,836 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 31.11/14.70 Derived loop invariant: (((((((0 == i && \valid[i] == 1) && bound_ref == 0) && 4 == unknown-#length-unknown[bound_ref]) && sum == 0) && unknown-#length-unknown[i] == 4) && 4 == unknown-#length-unknown[sum]) && \valid[sum] == 1) && \valid[bound_ref] == 1 31.11/14.70 - StatisticsResult: Ultimate Automizer benchmark data 31.11/14.70 CFG has 1 procedures, 36 locations, 22 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 38 SDtfs, 307 SDslu, 6 SDs, 0 SdLazy, 362 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 40 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 31.11/14.70 - StatisticsResult: Constructed decomposition of program 31.11/14.70 Your program was decomposed into 2 terminating modules (0 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[bound_ref][bound_ref] and consists of 21 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[i][i] + unknown-#memory_int-unknown[bound_ref][bound_ref] and consists of 7 locations. 31.11/14.70 - StatisticsResult: Timing statistics 31.11/14.70 BüchiAutomizer plugin needed 7.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.8s. Büchi inclusion checks took 3.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 8 SDtfs, 1046 SDslu, 103 SDs, 0 SdLazy, 1271 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital314 mio100 ax100 hnf100 lsp97 ukn57 mio100 lsp39 div100 bol100 ite100 ukn100 eq188 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 31.11/14.70 - TerminationAnalysisResult: Termination proven 31.11/14.70 Buchi Automizer proved that your program is terminating 31.11/14.70 RESULT: Ultimate proved your program to be correct! 31.11/14.70 !SESSION 2019-03-28 12:40:27.172 ----------------------------------------------- 31.11/14.70 eclipse.buildId=unknown 31.11/14.70 java.version=1.8.0_181 31.11/14.70 java.vendor=Oracle Corporation 31.11/14.70 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 31.11/14.70 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/14.70 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 31.11/14.70 31.11/14.70 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:40:41.063 31.11/14.70 !MESSAGE The workspace will exit with unsaved changes in this session. 31.11/14.70 Received shutdown request... 31.11/14.70 Ultimate: 31.11/14.70 GTK+ Version Check 31.11/14.70 EOF