./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7ed84bee4308b8cf5be51a33ec471886cd45cc40 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:43:20,496 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:43:20,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:43:20,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:43:20,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:43:20,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:43:20,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:43:20,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:43:20,507 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:43:20,508 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:43:20,508 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:43:20,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:43:20,509 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:43:20,510 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:43:20,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:43:20,511 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:43:20,512 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:43:20,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:43:20,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:43:20,515 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:43:20,516 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:43:20,517 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:43:20,519 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:43:20,519 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:43:20,519 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:43:20,520 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:43:20,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:43:20,521 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:43:20,522 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:43:20,522 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:43:20,523 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:43:20,523 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:43:20,523 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:43:20,523 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:43:20,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:43:20,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:43:20,525 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 07:43:20,536 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:43:20,536 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:43:20,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:43:20,538 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:43:20,538 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:43:20,538 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 07:43:20,538 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 07:43:20,538 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 07:43:20,539 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 07:43:20,539 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 07:43:20,539 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 07:43:20,539 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:43:20,539 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 07:43:20,539 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:43:20,539 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:43:20,540 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 07:43:20,540 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 07:43:20,540 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 07:43:20,540 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:43:20,540 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 07:43:20,540 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 07:43:20,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:43:20,541 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:43:20,541 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 07:43:20,541 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:43:20,541 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:43:20,541 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 07:43:20,542 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 07:43:20,542 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ed84bee4308b8cf5be51a33ec471886cd45cc40 [2018-11-10 07:43:20,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:43:20,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:43:20,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:43:20,579 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:43:20,579 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:43:20,580 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-11-10 07:43:20,626 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/data/c340c5984/fb8c94ceefab471f919a39a8b37d4b60/FLAG0ce9474fa [2018-11-10 07:43:20,994 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:43:20,995 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/sv-benchmarks/c/termination-memory-alloca/Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-11-10 07:43:21,005 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/data/c340c5984/fb8c94ceefab471f919a39a8b37d4b60/FLAG0ce9474fa [2018-11-10 07:43:21,015 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/data/c340c5984/fb8c94ceefab471f919a39a8b37d4b60 [2018-11-10 07:43:21,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:43:21,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:43:21,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:43:21,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:43:21,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:43:21,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a654587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21, skipping insertion in model container [2018-11-10 07:43:21,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:43:21,059 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:43:21,253 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:43:21,260 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:43:21,291 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:43:21,315 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:43:21,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21 WrapperNode [2018-11-10 07:43:21,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:43:21,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:43:21,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:43:21,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:43:21,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:43:21,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:43:21,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:43:21,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:43:21,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... [2018-11-10 07:43:21,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:43:21,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:43:21,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:43:21,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:43:21,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e72cab0d-24cd-48da-8e32-6a3c2490c420/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:43:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:43:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:43:21,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:43:21,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:43:21,841 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:43:21,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:43:21 BoogieIcfgContainer [2018-11-10 07:43:21,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:43:21,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 07:43:21,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 07:43:21,844 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 07:43:21,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:43:21,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 07:43:21" (1/3) ... [2018-11-10 07:43:21,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e01d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:43:21, skipping insertion in model container [2018-11-10 07:43:21,845 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:43:21,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:43:21" (2/3) ... [2018-11-10 07:43:21,845 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e01d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 07:43:21, skipping insertion in model container [2018-11-10 07:43:21,845 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 07:43:21,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:43:21" (3/3) ... [2018-11-10 07:43:21,847 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i [2018-11-10 07:43:21,877 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:43:21,878 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 07:43:21,878 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 07:43:21,878 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 07:43:21,878 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:43:21,878 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:43:21,878 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 07:43:21,878 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:43:21,878 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 07:43:21,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states. [2018-11-10 07:43:21,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:21,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:21,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:21,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:21,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:21,909 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 07:43:21,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states. [2018-11-10 07:43:21,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:21,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:21,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:21,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:21,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:21,921 INFO L793 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 74#L553true assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 43#L554true SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 68#L556-1true SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 94#L558true assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 86#L561true SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 88#L561-1true main_#t~post12 := main_#t~mem11; 91#L561-2true SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 82#L561-3true havoc main_#t~post12;havoc main_#t~mem11; 99#L558-2true SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 13#L563true assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 5#L566true SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 7#L566-1true main_#t~post17 := main_#t~mem16; 102#L566-2true SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 104#L566-3true havoc main_#t~mem16;havoc main_#t~post17; 18#L563-2true SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 28#L568true assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 24#L571true SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 25#L571-1true main_#t~post22 := main_#t~mem21; 21#L571-2true SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 22#L571-3true havoc main_#t~mem21;havoc main_#t~post22; 32#L568-2true SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 46#L573true assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 41#L576true SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 44#L576-1true main_#t~post27 := main_#t~mem26; 35#L576-2true SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 37#L576-3true havoc main_#t~post27;havoc main_#t~mem26; 49#L573-2true SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 63#L578true assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 59#L581true SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 51#L581-1true main_#t~post32 := main_#t~mem31; 53#L581-2true SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 55#L581-3true havoc main_#t~mem31;havoc main_#t~post32; 70#L578-2true SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 85#L583true assume main_#t~mem33 > 0;havoc main_#t~mem33; 45#L584true SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 47#L584-1true main_#t~post35 := main_#t~mem34; 48#L584-2true SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 50#L584-3true havoc main_#t~mem34;havoc main_#t~post35; 90#L583-2true SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 4#L588true assume main_#t~mem38 > 0;havoc main_#t~mem38; 62#L589true SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 66#L589-1true main_#t~post40 := main_#t~mem39; 69#L589-2true SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 72#L589-3true havoc main_#t~mem39;havoc main_#t~post40; 9#L588-2true SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 23#L593true assume main_#t~mem43 > 0;havoc main_#t~mem43; 84#L594true SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 87#L594-1true main_#t~post45 := main_#t~mem44; 89#L594-2true SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 92#L594-3true havoc main_#t~mem44;havoc main_#t~post45; 26#L598-8true [2018-11-10 07:43:21,921 INFO L795 eck$LassoCheckResult]: Loop: 26#L598-8true assume true; 40#L598true SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 42#L598-1true main_#t~short50 := main_#t~mem48 < 100; 34#L598-2true assume !main_#t~short50; 39#L598-6true assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 3#L599true SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 6#L599-1true SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 8#L599-2true SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 103#L599-3true havoc main_#t~mem52;havoc main_#t~mem51; 61#L600true SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 64#L600-1true SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 67#L600-2true SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 71#L600-3true havoc main_#t~mem54;havoc main_#t~mem53; 26#L598-8true [2018-11-10 07:43:21,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:21,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1648486038, now seen corresponding path program 1 times [2018-11-10 07:43:21,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:21,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:21,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:21,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:21,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:22,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:22,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:43:22,071 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:22,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:22,071 INFO L82 PathProgramCache]: Analyzing trace with hash -758487761, now seen corresponding path program 1 times [2018-11-10 07:43:22,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:22,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:22,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:22,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:43:22,095 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 07:43:22,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:43:22,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:43:22,107 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 3 states. [2018-11-10 07:43:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:22,131 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-11-10 07:43:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:43:22,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 115 transitions. [2018-11-10 07:43:22,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:22,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 100 states and 109 transitions. [2018-11-10 07:43:22,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-11-10 07:43:22,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2018-11-10 07:43:22,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 109 transitions. [2018-11-10 07:43:22,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:22,139 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-10 07:43:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 109 transitions. [2018-11-10 07:43:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-11-10 07:43:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 07:43:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-11-10 07:43:22,161 INFO L728 BuchiCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-10 07:43:22,161 INFO L608 BuchiCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-11-10 07:43:22,161 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 07:43:22,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 109 transitions. [2018-11-10 07:43:22,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:22,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:22,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:22,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:22,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:22,165 INFO L793 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 233#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 271#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 272#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 295#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 308#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 309#L561-1 main_#t~post12 := main_#t~mem11; 311#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 305#L561-3 havoc main_#t~post12;havoc main_#t~mem11; 285#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 238#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 225#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 226#L566-1 main_#t~post17 := main_#t~mem16; 228#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 319#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 244#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 245#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 252#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 253#L571-1 main_#t~post22 := main_#t~mem21; 248#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 249#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 250#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 260#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 269#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 270#L576-1 main_#t~post27 := main_#t~mem26; 264#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 265#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 247#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 277#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 286#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 279#L581-1 main_#t~post32 := main_#t~mem31; 280#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 283#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 261#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 297#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 273#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 274#L584-1 main_#t~post35 := main_#t~mem34; 275#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 276#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 278#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 222#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 223#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 290#L589-1 main_#t~post40 := main_#t~mem39; 293#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 296#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 230#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 231#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 251#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 307#L594-1 main_#t~post45 := main_#t~mem44; 310#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 312#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 246#L598-8 [2018-11-10 07:43:22,165 INFO L795 eck$LassoCheckResult]: Loop: 246#L598-8 assume true; 254#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 268#L598-1 main_#t~short50 := main_#t~mem48 < 100; 262#L598-2 assume main_#t~short50; 263#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 266#L598-4 main_#t~short50 := main_#t~mem49 < 100; 267#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 220#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 221#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 227#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 229#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 288#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 289#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 291#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 294#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 246#L598-8 [2018-11-10 07:43:22,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1648486038, now seen corresponding path program 2 times [2018-11-10 07:43:22,166 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:22,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:22,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:22,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:22,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:43:22,211 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:22,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:22,211 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 1 times [2018-11-10 07:43:22,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:22,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:22,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:22,445 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:43:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:43:22,490 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-10 07:43:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:22,591 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-11-10 07:43:22,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:43:22,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 114 transitions. [2018-11-10 07:43:22,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:22,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 114 transitions. [2018-11-10 07:43:22,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2018-11-10 07:43:22,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-10 07:43:22,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 114 transitions. [2018-11-10 07:43:22,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:22,596 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 114 transitions. [2018-11-10 07:43:22,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 114 transitions. [2018-11-10 07:43:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-11-10 07:43:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-10 07:43:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2018-11-10 07:43:22,602 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-11-10 07:43:22,602 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 111 transitions. [2018-11-10 07:43:22,602 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 07:43:22,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 111 transitions. [2018-11-10 07:43:22,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:22,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:22,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:22,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:22,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:22,607 INFO L793 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 447#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 485#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 486#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 510#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 501#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 495#L559-1 main_#t~post10 := main_#t~mem9; 496#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 498#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 499#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 452#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 439#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 440#L566-1 main_#t~post17 := main_#t~mem16; 442#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 534#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 458#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 459#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 466#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 467#L571-1 main_#t~post22 := main_#t~mem21; 462#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 463#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 464#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 474#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 483#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 484#L576-1 main_#t~post27 := main_#t~mem26; 478#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 479#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 461#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 491#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 500#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 493#L581-1 main_#t~post32 := main_#t~mem31; 494#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 497#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 475#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 512#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 487#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 488#L584-1 main_#t~post35 := main_#t~mem34; 489#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 490#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 492#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 436#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 437#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 504#L589-1 main_#t~post40 := main_#t~mem39; 508#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 511#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 444#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 445#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 465#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 522#L594-1 main_#t~post45 := main_#t~mem44; 525#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 527#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 460#L598-8 [2018-11-10 07:43:22,607 INFO L795 eck$LassoCheckResult]: Loop: 460#L598-8 assume true; 468#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 482#L598-1 main_#t~short50 := main_#t~mem48 < 100; 476#L598-2 assume main_#t~short50; 477#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 480#L598-4 main_#t~short50 := main_#t~mem49 < 100; 481#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 434#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 435#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 441#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 443#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 502#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 503#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 505#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 509#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 460#L598-8 [2018-11-10 07:43:22,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash -214154652, now seen corresponding path program 1 times [2018-11-10 07:43:22,608 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:22,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 07:43:22,707 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:22,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:22,707 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 2 times [2018-11-10 07:43:22,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:22,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:22,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:22,875 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:22,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 07:43:22,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 07:43:22,913 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-10 07:43:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:23,064 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-11-10 07:43:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:43:23,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 120 transitions. [2018-11-10 07:43:23,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:23,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 120 transitions. [2018-11-10 07:43:23,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-10 07:43:23,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-10 07:43:23,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 120 transitions. [2018-11-10 07:43:23,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:23,067 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-11-10 07:43:23,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 120 transitions. [2018-11-10 07:43:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-11-10 07:43:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 07:43:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-11-10 07:43:23,071 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-10 07:43:23,071 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-11-10 07:43:23,071 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 07:43:23,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 117 transitions. [2018-11-10 07:43:23,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:23,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:23,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:23,074 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:23,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:23,075 INFO L793 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 677#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 678#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 716#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 717#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 741#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 760#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 772#L559-1 main_#t~post10 := main_#t~mem9; 771#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 770#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 766#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 683#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 684#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 744#L564-1 main_#t~post15 := main_#t~mem14; 748#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 750#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 689#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 690#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 697#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 698#L571-1 main_#t~post22 := main_#t~mem21; 693#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 694#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 695#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 705#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 714#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 715#L576-1 main_#t~post27 := main_#t~mem26; 709#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 710#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 692#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 722#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 731#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 724#L581-1 main_#t~post32 := main_#t~mem31; 725#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 728#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 706#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 743#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 718#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 719#L584-1 main_#t~post35 := main_#t~mem34; 720#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 721#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 723#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 667#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 668#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 735#L589-1 main_#t~post40 := main_#t~mem39; 739#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 742#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 675#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 676#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 696#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 753#L594-1 main_#t~post45 := main_#t~mem44; 756#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 758#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 691#L598-8 [2018-11-10 07:43:23,075 INFO L795 eck$LassoCheckResult]: Loop: 691#L598-8 assume true; 699#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 713#L598-1 main_#t~short50 := main_#t~mem48 < 100; 707#L598-2 assume main_#t~short50; 708#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 711#L598-4 main_#t~short50 := main_#t~mem49 < 100; 712#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 665#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 666#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 672#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 674#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 733#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 734#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 736#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 740#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 691#L598-8 [2018-11-10 07:43:23,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 685977310, now seen corresponding path program 1 times [2018-11-10 07:43:23,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:23,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:23,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:23,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 07:43:23,191 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:23,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 3 times [2018-11-10 07:43:23,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:23,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:23,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:43:23,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:43:23,354 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. cyclomatic complexity: 10 Second operand 11 states. [2018-11-10 07:43:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:23,524 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-11-10 07:43:23,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:43:23,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 126 transitions. [2018-11-10 07:43:23,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:23,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 126 transitions. [2018-11-10 07:43:23,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2018-11-10 07:43:23,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2018-11-10 07:43:23,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 126 transitions. [2018-11-10 07:43:23,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:23,528 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-11-10 07:43:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 126 transitions. [2018-11-10 07:43:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-11-10 07:43:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-10 07:43:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-11-10 07:43:23,532 INFO L728 BuchiCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-11-10 07:43:23,532 INFO L608 BuchiCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-11-10 07:43:23,533 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 07:43:23,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 123 transitions. [2018-11-10 07:43:23,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:23,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:23,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:23,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:23,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:23,535 INFO L793 eck$LassoCheckResult]: Stem: 1000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 931#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 969#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 970#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 994#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 985#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 979#L559-1 main_#t~post10 := main_#t~mem9; 980#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 982#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 983#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 936#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 937#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 997#L564-1 main_#t~post15 := main_#t~mem14; 1001#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 1003#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 942#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 943#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 955#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 1013#L569-1 main_#t~post20 := main_#t~mem19; 1016#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 1018#L569-3 havoc main_#t~post20;havoc main_#t~mem19; 948#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 958#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 967#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 968#L576-1 main_#t~post27 := main_#t~mem26; 962#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 963#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 945#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 975#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 984#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 977#L581-1 main_#t~post32 := main_#t~mem31; 978#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 981#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 959#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 996#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 971#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 972#L584-1 main_#t~post35 := main_#t~mem34; 973#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 974#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 976#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 920#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 921#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 988#L589-1 main_#t~post40 := main_#t~mem39; 992#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 995#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 928#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 929#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 949#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 1007#L594-1 main_#t~post45 := main_#t~mem44; 1010#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 1012#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 944#L598-8 [2018-11-10 07:43:23,535 INFO L795 eck$LassoCheckResult]: Loop: 944#L598-8 assume true; 952#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 966#L598-1 main_#t~short50 := main_#t~mem48 < 100; 960#L598-2 assume main_#t~short50; 961#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 964#L598-4 main_#t~short50 := main_#t~mem49 < 100; 965#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 918#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 919#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 925#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 927#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 986#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 987#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 989#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 993#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 944#L598-8 [2018-11-10 07:43:23,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1351909672, now seen corresponding path program 1 times [2018-11-10 07:43:23,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:23,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:23,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:23,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:23,634 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:23,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 4 times [2018-11-10 07:43:23,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:23,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:23,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:23,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:23,773 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:23,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:23,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:23,819 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-10 07:43:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:23,937 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-11-10 07:43:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:23,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 128 transitions. [2018-11-10 07:43:23,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:23,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 119 states and 128 transitions. [2018-11-10 07:43:23,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2018-11-10 07:43:23,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2018-11-10 07:43:23,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 128 transitions. [2018-11-10 07:43:23,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:23,940 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 128 transitions. [2018-11-10 07:43:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 128 transitions. [2018-11-10 07:43:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-11-10 07:43:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-10 07:43:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-11-10 07:43:23,944 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-11-10 07:43:23,944 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-11-10 07:43:23,944 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 07:43:23,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 125 transitions. [2018-11-10 07:43:23,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:23,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:23,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:23,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:23,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:23,946 INFO L793 eck$LassoCheckResult]: Stem: 1253#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1182#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1183#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 1222#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1223#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 1247#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 1238#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 1232#L559-1 main_#t~post10 := main_#t~mem9; 1233#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 1235#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 1236#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 1188#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 1189#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 1250#L564-1 main_#t~post15 := main_#t~mem14; 1254#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 1256#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 1194#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 1195#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 1207#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 1266#L569-1 main_#t~post20 := main_#t~mem19; 1269#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 1271#L569-3 havoc main_#t~post20;havoc main_#t~mem19; 1210#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 1211#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 1186#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 1187#L574-1 main_#t~post25 := main_#t~mem24; 1191#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 1193#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 1197#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 1228#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 1237#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 1230#L581-1 main_#t~post32 := main_#t~mem31; 1231#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 1234#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 1212#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 1249#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 1224#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 1225#L584-1 main_#t~post35 := main_#t~mem34; 1226#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 1227#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 1229#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 1172#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 1173#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 1241#L589-1 main_#t~post40 := main_#t~mem39; 1245#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 1248#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 1180#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 1181#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 1201#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 1260#L594-1 main_#t~post45 := main_#t~mem44; 1263#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 1265#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 1196#L598-8 [2018-11-10 07:43:23,946 INFO L795 eck$LassoCheckResult]: Loop: 1196#L598-8 assume true; 1204#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 1219#L598-1 main_#t~short50 := main_#t~mem48 < 100; 1213#L598-2 assume main_#t~short50; 1214#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 1217#L598-4 main_#t~short50 := main_#t~mem49 < 100; 1218#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 1170#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 1171#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 1177#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 1179#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 1239#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 1240#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 1242#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 1246#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 1196#L598-8 [2018-11-10 07:43:23,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:23,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1769614766, now seen corresponding path program 1 times [2018-11-10 07:43:23,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:23,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:23,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:24,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:24,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:24,030 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:24,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 5 times [2018-11-10 07:43:24,030 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:24,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,181 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:24,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:24,207 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-10 07:43:24,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:24,317 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-11-10 07:43:24,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:24,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 130 transitions. [2018-11-10 07:43:24,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:24,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 130 transitions. [2018-11-10 07:43:24,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-11-10 07:43:24,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2018-11-10 07:43:24,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 130 transitions. [2018-11-10 07:43:24,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:24,320 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-11-10 07:43:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 130 transitions. [2018-11-10 07:43:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-11-10 07:43:24,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 07:43:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-11-10 07:43:24,324 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-10 07:43:24,324 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-11-10 07:43:24,324 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 07:43:24,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 127 transitions. [2018-11-10 07:43:24,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:24,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:24,325 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:24,326 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:24,326 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:24,326 INFO L793 eck$LassoCheckResult]: Stem: 1510#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1438#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1439#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 1479#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 1480#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 1504#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 1495#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 1489#L559-1 main_#t~post10 := main_#t~mem9; 1490#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 1492#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 1493#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 1444#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 1445#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 1507#L564-1 main_#t~post15 := main_#t~mem14; 1511#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 1513#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 1450#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 1451#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 1463#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 1523#L569-1 main_#t~post20 := main_#t~mem19; 1526#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 1528#L569-3 havoc main_#t~post20;havoc main_#t~mem19; 1466#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 1467#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 1442#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 1443#L574-1 main_#t~post25 := main_#t~mem24; 1447#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 1449#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 1453#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 1485#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 1461#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 1462#L579-1 main_#t~post30 := main_#t~mem29; 1464#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 1465#L579-3 havoc main_#t~mem29;havoc main_#t~post30; 1468#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 1506#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 1481#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 1482#L584-1 main_#t~post35 := main_#t~mem34; 1483#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 1484#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 1486#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 1428#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 1429#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 1498#L589-1 main_#t~post40 := main_#t~mem39; 1502#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 1505#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 1436#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 1437#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 1457#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 1517#L594-1 main_#t~post45 := main_#t~mem44; 1520#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 1522#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 1452#L598-8 [2018-11-10 07:43:24,326 INFO L795 eck$LassoCheckResult]: Loop: 1452#L598-8 assume true; 1460#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 1476#L598-1 main_#t~short50 := main_#t~mem48 < 100; 1469#L598-2 assume main_#t~short50; 1470#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 1473#L598-4 main_#t~short50 := main_#t~mem49 < 100; 1475#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 1426#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 1427#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 1433#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 1435#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 1496#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 1497#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 1499#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 1503#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 1452#L598-8 [2018-11-10 07:43:24,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash 651872588, now seen corresponding path program 1 times [2018-11-10 07:43:24,327 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:24,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 6 times [2018-11-10 07:43:24,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:24,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:24,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1718114009, now seen corresponding path program 1 times [2018-11-10 07:43:24,378 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:24,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:24,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:24,528 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:28,859 WARN L179 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 219 DAG size of output: 205 [2018-11-10 07:43:28,974 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-10 07:43:28,985 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:43:28,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:43:28,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:43:28,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:43:28,986 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:43:28,987 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:43:28,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:43:28,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:43:28,988 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-10 07:43:28,988 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:43:28,988 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:43:29,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,445 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2018-11-10 07:43:29,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:29,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:30,023 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:43:30,028 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:43:30,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,044 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,051 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,053 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,057 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,059 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,061 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,067 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,073 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,078 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,080 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,083 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,131 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,131 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,168 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:30,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:30,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:30,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,187 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,195 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,207 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:43:30,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:43:30,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:30,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:30,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:30,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:30,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:30,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:30,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:30,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:30,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:43:30,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:43:30,255 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:43:30,257 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:43:30,258 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 07:43:30,258 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:43:30,260 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 + 207 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 9 >= 0] [2018-11-10 07:43:30,401 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-10 07:43:30,410 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:43:30,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:30,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:43:30,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 07:43:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 07:43:30,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 07:43:30,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:30,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:30,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:30,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:30,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:30,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:30,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:30,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:30,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:30,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:30,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:30,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:30,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:30,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:31,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:31,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:31,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:31,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:31,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:31,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:31,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:31,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:31,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:31,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:31,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:31,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:31,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:31,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 07:43:31,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 07:43:31,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:31,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:24 [2018-11-10 07:43:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:31,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:43:31,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:31,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 65 [2018-11-10 07:43:31,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 47 [2018-11-10 07:43:31,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:43:31,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:31,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 43 treesize of output 57 [2018-11-10 07:43:31,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 07:43:31,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-11-10 07:43:31,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-11-10 07:43:31,870 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:252 [2018-11-10 07:43:32,062 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 61 [2018-11-10 07:43:32,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 07:43:32,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:32,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:32,117 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-10 07:43:32,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 07:43:32,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:32,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:32,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-11-10 07:43:32,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 07:43:32,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:32,183 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:32,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-10 07:43:32,217 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 15 variables, input treesize:173, output treesize:128 [2018-11-10 07:43:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:32,264 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.28 stem predicates 7 loop predicates [2018-11-10 07:43:32,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 127 transitions. cyclomatic complexity: 10 Second operand 36 states. [2018-11-10 07:43:33,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 127 transitions. cyclomatic complexity: 10. Second operand 36 states. Result 223 states and 238 transitions. Complement of second has 46 states. [2018-11-10 07:43:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 38 states 29 stem states 7 non-accepting loop states 2 accepting loop states [2018-11-10 07:43:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 07:43:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 189 transitions. [2018-11-10 07:43:33,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 189 transitions. Stem has 52 letters. Loop has 15 letters. [2018-11-10 07:43:33,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:33,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 189 transitions. Stem has 67 letters. Loop has 15 letters. [2018-11-10 07:43:33,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:33,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 189 transitions. Stem has 52 letters. Loop has 30 letters. [2018-11-10 07:43:33,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:33,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 238 transitions. [2018-11-10 07:43:33,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-10 07:43:33,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 188 states and 201 transitions. [2018-11-10 07:43:33,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2018-11-10 07:43:33,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 188 [2018-11-10 07:43:33,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 201 transitions. [2018-11-10 07:43:33,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:33,718 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-11-10 07:43:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 201 transitions. [2018-11-10 07:43:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 156. [2018-11-10 07:43:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 07:43:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2018-11-10 07:43:33,722 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-11-10 07:43:33,722 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 169 transitions. [2018-11-10 07:43:33,722 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 07:43:33,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 169 transitions. [2018-11-10 07:43:33,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:33,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:33,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:33,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:33,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:33,724 INFO L793 eck$LassoCheckResult]: Stem: 2360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2291#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 2329#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2330#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 2380#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 2345#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 2339#L559-1 main_#t~post10 := main_#t~mem9; 2340#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 2342#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 2343#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 2422#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 2421#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 2420#L564-1 main_#t~post15 := main_#t~mem14; 2363#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 2364#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 2423#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 2417#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 2416#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 2415#L569-1 main_#t~post20 := main_#t~mem19; 2414#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 2413#L569-3 havoc main_#t~post20;havoc main_#t~mem19; 2412#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 2411#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 2410#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 2409#L574-1 main_#t~post25 := main_#t~mem24; 2408#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 2407#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 2406#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 2405#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 2404#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 2403#L579-1 main_#t~post30 := main_#t~mem29; 2402#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 2401#L579-3 havoc main_#t~mem29;havoc main_#t~post30; 2400#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 2399#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 2398#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 2397#L584-1 main_#t~post35 := main_#t~mem34; 2395#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 2394#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 2393#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 2392#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 2391#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 2390#L589-1 main_#t~post40 := main_#t~mem39; 2389#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 2388#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 2387#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 2307#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43; 2288#L596 SUMMARY for call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L596 2289#L596-1 main_#t~post47 := main_#t~mem46; 2294#L596-2 SUMMARY for call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L596-2 2298#L596-3 havoc main_#t~post47;havoc main_#t~mem46; 2300#L598-8 [2018-11-10 07:43:33,724 INFO L795 eck$LassoCheckResult]: Loop: 2300#L598-8 assume true; 2310#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 2326#L598-1 main_#t~short50 := main_#t~mem48 < 100; 2319#L598-2 assume main_#t~short50; 2320#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 2323#L598-4 main_#t~short50 := main_#t~mem49 < 100; 2325#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 2276#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 2277#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 2281#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 2284#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 2346#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 2347#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 2349#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 2353#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 2300#L598-8 [2018-11-10 07:43:33,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 657598418, now seen corresponding path program 1 times [2018-11-10 07:43:33,724 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:33,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:33,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:33,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:33,801 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:33,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 7 times [2018-11-10 07:43:33,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:33,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:33,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:33,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:33,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:33,931 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:33,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:33,964 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 07:43:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:34,081 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-11-10 07:43:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:34,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 173 transitions. [2018-11-10 07:43:34,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:34,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 155 states and 167 transitions. [2018-11-10 07:43:34,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2018-11-10 07:43:34,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2018-11-10 07:43:34,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 167 transitions. [2018-11-10 07:43:34,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:34,083 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 167 transitions. [2018-11-10 07:43:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 167 transitions. [2018-11-10 07:43:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-11-10 07:43:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-10 07:43:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-11-10 07:43:34,088 INFO L728 BuchiCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-11-10 07:43:34,088 INFO L608 BuchiCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-11-10 07:43:34,088 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 07:43:34,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 164 transitions. [2018-11-10 07:43:34,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:34,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:34,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:34,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:34,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:34,089 INFO L793 eck$LassoCheckResult]: Stem: 2701#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2625#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2626#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 2667#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2668#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 2719#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 2720#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 2733#L559-1 main_#t~post10 := main_#t~mem9; 2732#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 2731#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 2730#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 2630#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 2631#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 2739#L564-1 main_#t~post15 := main_#t~mem14; 2738#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 2737#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 2736#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 2649#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 2650#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 2716#L569-1 main_#t~post20 := main_#t~mem19; 2721#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 2723#L569-3 havoc main_#t~post20;havoc main_#t~mem19; 2654#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 2655#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 2627#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 2628#L574-1 main_#t~post25 := main_#t~mem24; 2752#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 2751#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 2750#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 2688#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 2647#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 2648#L579-1 main_#t~post30 := main_#t~mem29; 2749#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 2748#L579-3 havoc main_#t~mem29;havoc main_#t~post30; 2747#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 2710#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 2669#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 2670#L584-1 main_#t~post35 := main_#t~mem34; 2671#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 2672#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 2674#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 2614#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38; 2615#L591 SUMMARY for call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L591 2717#L591-1 main_#t~post42 := main_#t~mem41; 2718#L591-2 SUMMARY for call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L591-2 2722#L591-3 havoc main_#t~mem41;havoc main_#t~post42; 2724#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 2729#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 2643#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 2709#L594-1 main_#t~post45 := main_#t~mem44; 2711#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 2714#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 2636#L598-8 [2018-11-10 07:43:34,090 INFO L795 eck$LassoCheckResult]: Loop: 2636#L598-8 assume true; 2646#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 2664#L598-1 main_#t~short50 := main_#t~mem48 < 100; 2657#L598-2 assume main_#t~short50; 2658#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 2661#L598-4 main_#t~short50 := main_#t~mem49 < 100; 2663#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 2612#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 2613#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 2616#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 2619#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 2684#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 2685#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 2689#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 2693#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 2636#L598-8 [2018-11-10 07:43:34,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:34,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2076791982, now seen corresponding path program 1 times [2018-11-10 07:43:34,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:34,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:34,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:34,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:34,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:34,137 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:34,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 8 times [2018-11-10 07:43:34,137 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:34,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:34,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:34,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:34,262 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. cyclomatic complexity: 13 Second operand 8 states. [2018-11-10 07:43:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:34,366 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-11-10 07:43:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:34,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 168 transitions. [2018-11-10 07:43:34,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:34,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 151 states and 162 transitions. [2018-11-10 07:43:34,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-11-10 07:43:34,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-10 07:43:34,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 162 transitions. [2018-11-10 07:43:34,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:34,369 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 162 transitions. [2018-11-10 07:43:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 162 transitions. [2018-11-10 07:43:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-11-10 07:43:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 07:43:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-11-10 07:43:34,372 INFO L728 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-11-10 07:43:34,372 INFO L608 BuchiCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-11-10 07:43:34,372 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 07:43:34,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 159 transitions. [2018-11-10 07:43:34,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:34,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:34,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:34,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:34,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:34,373 INFO L793 eck$LassoCheckResult]: Stem: 3028#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 2954#L553 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 2994#L554 SUMMARY for call write~int(1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 2995#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 3063#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 3062#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 3061#L559-1 main_#t~post10 := main_#t~mem9; 3060#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 3059#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 3058#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 2958#L563 assume main_#t~mem13 > 0;havoc main_#t~mem13; 2959#L564 SUMMARY for call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L564 3070#L564-1 main_#t~post15 := main_#t~mem14; 3069#L564-2 SUMMARY for call write~int(main_#t~post15 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L564-2 3067#L564-3 havoc main_#t~mem14;havoc main_#t~post15; 3066#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 2977#L568 assume main_#t~mem18 > 0;havoc main_#t~mem18; 2978#L569 SUMMARY for call main_#t~mem19 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L569 3044#L569-1 main_#t~post20 := main_#t~mem19; 3050#L569-2 SUMMARY for call write~int(main_#t~post20 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L569-2 3051#L569-3 havoc main_#t~post20;havoc main_#t~mem19; 2981#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 2982#L573 assume main_#t~mem23 > 0;havoc main_#t~mem23; 3080#L574 SUMMARY for call main_#t~mem24 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L574 2960#L574-1 main_#t~post25 := main_#t~mem24; 2961#L574-2 SUMMARY for call write~int(main_#t~post25 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L574-2 2963#L574-3 havoc main_#t~mem24;havoc main_#t~post25; 2967#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 3001#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 2975#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 2976#L579-1 main_#t~post30 := main_#t~mem29; 2979#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 2980#L579-3 havoc main_#t~mem29;havoc main_#t~post30; 2983#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 3023#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 3037#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 3026#L586-1 main_#t~post37 := main_#t~mem36; 3027#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 3030#L586-3 havoc main_#t~mem36;havoc main_#t~post37; 3033#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 3068#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 2943#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 3015#L589-1 main_#t~post40 := main_#t~mem39; 3017#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 3021#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 2949#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 2950#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 2971#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 3038#L594-1 main_#t~post45 := main_#t~mem44; 3039#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 3042#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 2966#L598-8 [2018-11-10 07:43:34,374 INFO L795 eck$LassoCheckResult]: Loop: 2966#L598-8 assume true; 2974#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 2991#L598-1 main_#t~short50 := main_#t~mem48 < 100; 2984#L598-2 assume main_#t~short50; 2985#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 2988#L598-4 main_#t~short50 := main_#t~mem49 < 100; 2990#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 2940#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 2941#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 2944#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 2947#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 3013#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 3014#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 3016#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 3020#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 2966#L598-8 [2018-11-10 07:43:34,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1370132178, now seen corresponding path program 1 times [2018-11-10 07:43:34,374 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:34,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:34,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:34,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:34,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-11-10 07:43:34,576 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:34,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 9 times [2018-11-10 07:43:34,576 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:34,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:34,726 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:34,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 07:43:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-10 07:43:34,755 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. cyclomatic complexity: 12 Second operand 22 states. [2018-11-10 07:43:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:35,117 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-11-10 07:43:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 07:43:35,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 176 transitions. [2018-11-10 07:43:35,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:35,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 133 states and 143 transitions. [2018-11-10 07:43:35,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-11-10 07:43:35,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-10 07:43:35,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 143 transitions. [2018-11-10 07:43:35,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:35,119 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-11-10 07:43:35,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 143 transitions. [2018-11-10 07:43:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 07:43:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 07:43:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-11-10 07:43:35,122 INFO L728 BuchiCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-11-10 07:43:35,122 INFO L608 BuchiCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-11-10 07:43:35,122 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 07:43:35,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 143 transitions. [2018-11-10 07:43:35,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:35,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:35,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:35,123 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:35,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:35,123 INFO L793 eck$LassoCheckResult]: Stem: 3394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3323#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 3384#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 3385#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 3388#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 3404#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 3405#L561-1 main_#t~post12 := main_#t~mem11; 3407#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 3400#L561-3 havoc main_#t~post12;havoc main_#t~mem11; 3401#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 3328#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 3315#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 3316#L566-1 main_#t~post17 := main_#t~mem16; 3318#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 3417#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 3418#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 3439#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 3342#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 3343#L571-1 main_#t~post22 := main_#t~mem21; 3338#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 3339#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 3340#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 3422#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 3361#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 3362#L576-1 main_#t~post27 := main_#t~mem26; 3355#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 3356#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 3358#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 3436#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 3377#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 3369#L581-1 main_#t~post32 := main_#t~mem31; 3370#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 3373#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 3375#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 3423#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 3363#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 3364#L584-1 main_#t~post35 := main_#t~mem34; 3365#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 3366#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 3368#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 3313#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 3314#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 3381#L589-1 main_#t~post40 := main_#t~mem39; 3386#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 3389#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 3320#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 3321#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 3341#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 3403#L594-1 main_#t~post45 := main_#t~mem44; 3406#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 3408#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 3336#L598-8 [2018-11-10 07:43:35,124 INFO L795 eck$LassoCheckResult]: Loop: 3336#L598-8 assume true; 3344#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 3360#L598-1 main_#t~short50 := main_#t~mem48 < 100; 3353#L598-2 assume main_#t~short50; 3354#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 3357#L598-4 main_#t~short50 := main_#t~mem49 < 100; 3359#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 3311#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 3312#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 3317#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 3319#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 3379#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 3380#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 3383#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 3387#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 3336#L598-8 [2018-11-10 07:43:35,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1901582794, now seen corresponding path program 1 times [2018-11-10 07:43:35,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:35,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:35,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:35,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:35,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:35,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-11-10 07:43:35,337 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:35,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 10 times [2018-11-10 07:43:35,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:35,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:35,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 07:43:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-11-10 07:43:35,467 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. cyclomatic complexity: 11 Second operand 22 states. [2018-11-10 07:43:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:35,827 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2018-11-10 07:43:35,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 07:43:35,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 169 transitions. [2018-11-10 07:43:35,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:35,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 169 transitions. [2018-11-10 07:43:35,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2018-11-10 07:43:35,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2018-11-10 07:43:35,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 169 transitions. [2018-11-10 07:43:35,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:35,830 INFO L705 BuchiCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-11-10 07:43:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 169 transitions. [2018-11-10 07:43:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2018-11-10 07:43:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 07:43:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-11-10 07:43:35,832 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 07:43:35,832 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-11-10 07:43:35,832 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 07:43:35,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 161 transitions. [2018-11-10 07:43:35,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:35,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:35,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:35,833 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:35,833 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:35,833 INFO L793 eck$LassoCheckResult]: Stem: 3745#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3674#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 3734#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 3735#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 3738#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 3755#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 3756#L561-1 main_#t~post12 := main_#t~mem11; 3758#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 3750#L561-3 havoc main_#t~post12;havoc main_#t~mem11; 3751#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 3678#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 3679#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 3802#L566-1 main_#t~post17 := main_#t~mem16; 3800#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 3797#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 3796#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 3697#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 3692#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 3693#L571-1 main_#t~post22 := main_#t~mem21; 3687#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 3688#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 3689#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 3810#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 3712#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 3713#L576-1 main_#t~post27 := main_#t~mem26; 3706#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 3707#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 3709#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 3794#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 3727#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 3720#L581-1 main_#t~post32 := main_#t~mem31; 3721#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 3724#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 3703#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 3739#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 3752#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 3743#L586-1 main_#t~post37 := main_#t~mem36; 3744#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 3747#L586-3 havoc main_#t~mem36;havoc main_#t~post37; 3749#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 3795#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 3663#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 3731#L589-1 main_#t~post40 := main_#t~mem39; 3733#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 3737#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 3740#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 3690#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 3691#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 3753#L594-1 main_#t~post45 := main_#t~mem44; 3754#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 3757#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 3683#L598-8 [2018-11-10 07:43:35,833 INFO L795 eck$LassoCheckResult]: Loop: 3683#L598-8 assume true; 3694#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 3711#L598-1 main_#t~short50 := main_#t~mem48 < 100; 3704#L598-2 assume main_#t~short50; 3705#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 3708#L598-4 main_#t~short50 := main_#t~mem49 < 100; 3710#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 3660#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 3661#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 3664#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 3667#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 3729#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 3730#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 3732#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 3736#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 3683#L598-8 [2018-11-10 07:43:35,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1675124912, now seen corresponding path program 1 times [2018-11-10 07:43:35,834 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:35,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:35,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:35,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:35,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:35,877 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:35,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 11 times [2018-11-10 07:43:35,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:36,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:36,003 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-10 07:43:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:36,086 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-10 07:43:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:36,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 160 transitions. [2018-11-10 07:43:36,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:36,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 160 transitions. [2018-11-10 07:43:36,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-11-10 07:43:36,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-10 07:43:36,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 160 transitions. [2018-11-10 07:43:36,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:36,089 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-11-10 07:43:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 160 transitions. [2018-11-10 07:43:36,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-11-10 07:43:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 07:43:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2018-11-10 07:43:36,091 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-11-10 07:43:36,091 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 160 transitions. [2018-11-10 07:43:36,091 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 07:43:36,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 160 transitions. [2018-11-10 07:43:36,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:36,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:36,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:36,092 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:36,092 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:36,093 INFO L793 eck$LassoCheckResult]: Stem: 4067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 3995#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 4055#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 4056#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 4059#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 4077#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 4078#L561-1 main_#t~post12 := main_#t~mem11; 4080#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 4072#L561-3 havoc main_#t~post12;havoc main_#t~mem11; 4073#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 3999#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 4000#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 4129#L566-1 main_#t~post17 := main_#t~mem16; 4127#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 4125#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 4123#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 4018#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 4013#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 4014#L571-1 main_#t~post22 := main_#t~mem21; 4008#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 4009#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 4010#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 4131#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 4032#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 4033#L576-1 main_#t~post27 := main_#t~mem26; 4026#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 4027#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 4029#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 4119#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 4047#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 4040#L581-1 main_#t~post32 := main_#t~mem31; 4041#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 4044#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 4023#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 4060#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 4074#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 4064#L586-1 main_#t~post37 := main_#t~mem36; 4065#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 4068#L586-3 havoc main_#t~mem36;havoc main_#t~post37; 4070#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 4130#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38; 4089#L591 SUMMARY for call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L591 4083#L591-1 main_#t~post42 := main_#t~mem41; 4084#L591-2 SUMMARY for call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L591-2 4086#L591-3 havoc main_#t~mem41;havoc main_#t~post42; 3990#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 3991#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 4012#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 4075#L594-1 main_#t~post45 := main_#t~mem44; 4076#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 4079#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 4006#L598-8 [2018-11-10 07:43:36,093 INFO L795 eck$LassoCheckResult]: Loop: 4006#L598-8 assume true; 4015#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 4031#L598-1 main_#t~short50 := main_#t~mem48 < 100; 4024#L598-2 assume main_#t~short50; 4025#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 4028#L598-4 main_#t~short50 := main_#t~mem49 < 100; 4030#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 3981#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 3982#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 3987#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 3989#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 4049#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 4050#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 4053#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 4057#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 4006#L598-8 [2018-11-10 07:43:36,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:36,093 INFO L82 PathProgramCache]: Analyzing trace with hash -108822186, now seen corresponding path program 1 times [2018-11-10 07:43:36,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:36,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:36,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:36,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:36,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:36,154 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:36,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 12 times [2018-11-10 07:43:36,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:36,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,285 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:36,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:36,312 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. cyclomatic complexity: 10 Second operand 8 states. [2018-11-10 07:43:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:36,403 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-11-10 07:43:36,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:36,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 159 transitions. [2018-11-10 07:43:36,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:36,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 159 transitions. [2018-11-10 07:43:36,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2018-11-10 07:43:36,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2018-11-10 07:43:36,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 159 transitions. [2018-11-10 07:43:36,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:36,406 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-11-10 07:43:36,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 159 transitions. [2018-11-10 07:43:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-11-10 07:43:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 07:43:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2018-11-10 07:43:36,408 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-11-10 07:43:36,409 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 159 transitions. [2018-11-10 07:43:36,409 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 07:43:36,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 159 transitions. [2018-11-10 07:43:36,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:36,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:36,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:36,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:36,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:36,410 INFO L793 eck$LassoCheckResult]: Stem: 4385#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4314#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 4374#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 4375#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 4378#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 4395#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 4396#L561-1 main_#t~post12 := main_#t~mem11; 4398#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 4391#L561-3 havoc main_#t~post12;havoc main_#t~mem11; 4392#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 4319#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 4320#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 4450#L566-1 main_#t~post17 := main_#t~mem16; 4449#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 4448#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 4446#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 4338#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 4333#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 4334#L571-1 main_#t~post22 := main_#t~mem21; 4329#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 4330#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 4331#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 4452#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 4352#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 4353#L576-1 main_#t~post27 := main_#t~mem26; 4346#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 4347#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 4349#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 4442#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 4367#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 4360#L581-1 main_#t~post32 := main_#t~mem31; 4361#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 4364#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 4343#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 4380#L583 assume !(main_#t~mem33 > 0);havoc main_#t~mem33; 4393#L586 SUMMARY for call main_#t~mem36 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L586 4383#L586-1 main_#t~post37 := main_#t~mem36; 4384#L586-2 SUMMARY for call write~int(main_#t~post37 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L586-2 4387#L586-3 havoc main_#t~mem36;havoc main_#t~post37; 4389#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 4451#L588 assume !(main_#t~mem38 > 0);havoc main_#t~mem38; 4410#L591 SUMMARY for call main_#t~mem41 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L591 4402#L591-1 main_#t~post42 := main_#t~mem41; 4403#L591-2 SUMMARY for call write~int(main_#t~post42 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L591-2 4405#L591-3 havoc main_#t~mem41;havoc main_#t~post42; 4408#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 4411#L593 assume !(main_#t~mem43 > 0);havoc main_#t~mem43; 4315#L596 SUMMARY for call main_#t~mem46 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L596 4316#L596-1 main_#t~post47 := main_#t~mem46; 4321#L596-2 SUMMARY for call write~int(main_#t~post47 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L596-2 4323#L596-3 havoc main_#t~post47;havoc main_#t~mem46; 4327#L598-8 [2018-11-10 07:43:36,410 INFO L795 eck$LassoCheckResult]: Loop: 4327#L598-8 assume true; 4335#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 4351#L598-1 main_#t~short50 := main_#t~mem48 < 100; 4344#L598-2 assume main_#t~short50; 4345#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 4348#L598-4 main_#t~short50 := main_#t~mem49 < 100; 4350#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 4302#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 4303#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 4308#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 4310#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 4369#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 4370#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 4373#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 4377#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 4327#L598-8 [2018-11-10 07:43:36,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:36,410 INFO L82 PathProgramCache]: Analyzing trace with hash -103096356, now seen corresponding path program 1 times [2018-11-10 07:43:36,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:36,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:36,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 13 times [2018-11-10 07:43:36,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:36,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:36,441 INFO L82 PathProgramCache]: Analyzing trace with hash -776626025, now seen corresponding path program 1 times [2018-11-10 07:43:36,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:36,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:36,574 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:41,002 WARN L179 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 227 DAG size of output: 205 [2018-11-10 07:43:41,076 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 07:43:41,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 07:43:41,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 07:43:41,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 07:43:41,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 07:43:41,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 07:43:41,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 07:43:41,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 07:43:41,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-MultiBranchesToLoop-alloca_true-termination.c.i_Iteration14_Lasso [2018-11-10 07:43:41,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 07:43:41,076 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 07:43:41,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,393 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 114 [2018-11-10 07:43:41,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 07:43:41,945 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 07:43:41,945 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 07:43:41,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:41,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:41,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:41,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:41,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:41,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:41,955 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 07:43:41,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 07:43:41,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 07:43:41,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:41,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:41,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,960 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:43:41,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,961 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:43:41,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:41,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:41,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:41,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:41,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:41,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 07:43:41,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 07:43:41,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:41,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 07:43:41,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 07:43:41,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 07:43:41,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 07:43:41,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 07:43:41,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 07:43:41,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 07:43:41,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 07:43:41,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 07:43:41,981 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 07:43:41,982 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 07:43:41,982 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 07:43:41,982 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 07:43:41,983 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 07:43:41,983 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 + 207 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 9 >= 0] [2018-11-10 07:43:42,149 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-10 07:43:42,154 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 07:43:42,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:42,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:43:42,201 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 07:43:42,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,213 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 07:43:42,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-11-10 07:43:42,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 07:43:42,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 07:43:42,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-10 07:43:42,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-10 07:43:42,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:42,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:42,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:42,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:42,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:42,533 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:42,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:42,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:42,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:42,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:42,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:42,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:42,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:42,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:42,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:42,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:43,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:43,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 07:43:43,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-10 07:43:43,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:43,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:43,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:43:43,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 07:43:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:43,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:43:43,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:43,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 79 [2018-11-10 07:43:43,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-11-10 07:43:43,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:43:43,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:43,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 49 treesize of output 67 [2018-11-10 07:43:43,579 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-10 07:43:43,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:43:43,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:43:43,669 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:128 [2018-11-10 07:43:43,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:43,793 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2018-11-10 07:43:43,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:43:43,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-10 07:43:43,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:43:43,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:43:43,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:43:43,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-10 07:43:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:43,861 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.27 stem predicates 9 loop predicates [2018-11-10 07:43:43,861 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 151 states and 159 transitions. cyclomatic complexity: 9 Second operand 37 states. [2018-11-10 07:43:45,154 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 151 states and 159 transitions. cyclomatic complexity: 9. Second operand 37 states. Result 220 states and 229 transitions. Complement of second has 46 states. [2018-11-10 07:43:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 37 states 27 stem states 8 non-accepting loop states 2 accepting loop states [2018-11-10 07:43:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 07:43:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 169 transitions. [2018-11-10 07:43:45,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 169 transitions. Stem has 52 letters. Loop has 15 letters. [2018-11-10 07:43:45,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:45,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 169 transitions. Stem has 67 letters. Loop has 15 letters. [2018-11-10 07:43:45,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:45,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 169 transitions. Stem has 52 letters. Loop has 30 letters. [2018-11-10 07:43:45,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 07:43:45,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 220 states and 229 transitions. [2018-11-10 07:43:45,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-10 07:43:45,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 220 states to 167 states and 174 transitions. [2018-11-10 07:43:45,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 166 [2018-11-10 07:43:45,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-10 07:43:45,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 174 transitions. [2018-11-10 07:43:45,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:45,159 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 174 transitions. [2018-11-10 07:43:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 174 transitions. [2018-11-10 07:43:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2018-11-10 07:43:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 07:43:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2018-11-10 07:43:45,161 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-11-10 07:43:45,161 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 152 transitions. [2018-11-10 07:43:45,161 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 07:43:45,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 152 transitions. [2018-11-10 07:43:45,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:45,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:45,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:45,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:45,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:45,162 INFO L793 eck$LassoCheckResult]: Stem: 5264#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 5192#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 5252#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 5253#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 5256#L558 assume !(main_#t~mem8 > 0);havoc main_#t~mem8; 5275#L561 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L561 5276#L561-1 main_#t~post12 := main_#t~mem11; 5278#L561-2 SUMMARY for call write~int(main_#t~post12 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L561-2 5270#L561-3 havoc main_#t~post12;havoc main_#t~mem11; 5271#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 5197#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 5198#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 5323#L566-1 main_#t~post17 := main_#t~mem16; 5322#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 5321#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 5320#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 5319#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 5212#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 5213#L571-1 main_#t~post22 := main_#t~mem21; 5207#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 5208#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 5209#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 5324#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 5231#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 5232#L576-1 main_#t~post27 := main_#t~mem26; 5226#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 5227#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 5206#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 5237#L578 assume main_#t~mem28 > 0;havoc main_#t~mem28; 5215#L579 SUMMARY for call main_#t~mem29 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L579 5216#L579-1 main_#t~post30 := main_#t~mem29; 5219#L579-2 SUMMARY for call write~int(main_#t~post30 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L579-2 5220#L579-3 havoc main_#t~mem29;havoc main_#t~post30; 5223#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 5258#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 5233#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 5234#L584-1 main_#t~post35 := main_#t~mem34; 5235#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 5236#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 5238#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 5182#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 5183#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 5250#L589-1 main_#t~post40 := main_#t~mem39; 5254#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 5257#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 5259#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 5210#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 5211#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 5273#L594-1 main_#t~post45 := main_#t~mem44; 5277#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 5279#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 5205#L598-8 [2018-11-10 07:43:45,162 INFO L795 eck$LassoCheckResult]: Loop: 5205#L598-8 assume true; 5214#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 5230#L598-1 main_#t~short50 := main_#t~mem48 < 100; 5224#L598-2 assume main_#t~short50; 5225#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 5228#L598-4 main_#t~short50 := main_#t~mem49 < 100; 5229#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 5180#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 5181#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 5184#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 5187#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 5248#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 5249#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 5251#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 5255#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 5205#L598-8 [2018-11-10 07:43:45,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 28102852, now seen corresponding path program 1 times [2018-11-10 07:43:45,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:45,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:45,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:45,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:43:45,234 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:45,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:45,234 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 14 times [2018-11-10 07:43:45,234 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:45,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:45,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:43:45,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:43:45,356 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 07:43:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:45,496 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-11-10 07:43:45,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 07:43:45,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 152 transitions. [2018-11-10 07:43:45,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:45,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 123 states and 128 transitions. [2018-11-10 07:43:45,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2018-11-10 07:43:45,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2018-11-10 07:43:45,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 128 transitions. [2018-11-10 07:43:45,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:45,499 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-11-10 07:43:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 128 transitions. [2018-11-10 07:43:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-10 07:43:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 07:43:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2018-11-10 07:43:45,501 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-11-10 07:43:45,501 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 128 transitions. [2018-11-10 07:43:45,501 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 07:43:45,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 128 transitions. [2018-11-10 07:43:45,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-10 07:43:45,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 07:43:45,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 07:43:45,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:45,502 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:43:45,505 INFO L793 eck$LassoCheckResult]: Stem: 5548#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem8, main_#t~mem9, main_#t~post10, main_#t~mem11, main_#t~post12, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~mem16, main_#t~post17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~post22, main_#t~mem23, main_#t~mem24, main_#t~post25, main_#t~mem26, main_#t~post27, main_#t~mem28, main_#t~mem29, main_#t~post30, main_#t~mem31, main_#t~post32, main_#t~mem33, main_#t~mem34, main_#t~post35, main_#t~mem36, main_#t~post37, main_#t~mem38, main_#t~mem39, main_#t~post40, main_#t~mem41, main_#t~post42, main_#t~mem43, main_#t~mem44, main_#t~post45, main_#t~mem46, main_#t~post47, main_#t~mem51, main_#t~mem52, main_#t~mem53, main_#t~mem54, main_#t~mem48, main_#t~mem49, main_#t~short50, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 5513#L553 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 5537#L556 SUMMARY for call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L556 5538#L556-1 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L556-1 5541#L558 assume main_#t~mem8 > 0;havoc main_#t~mem8; 5527#L559 SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 5493#L559-1 main_#t~post10 := main_#t~mem9; 5494#L559-2 SUMMARY for call write~int(main_#t~post10 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559-2 5496#L559-3 havoc main_#t~mem9;havoc main_#t~post10; 5502#L558-2 SUMMARY for call main_#t~mem13 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L558-2 5517#L563 assume !(main_#t~mem13 > 0);havoc main_#t~mem13; 5504#L566 SUMMARY for call main_#t~mem16 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L566 5505#L566-1 main_#t~post17 := main_#t~mem16; 5507#L566-2 SUMMARY for call write~int(main_#t~post17 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L566-2 5585#L566-3 havoc main_#t~mem16;havoc main_#t~post17; 5586#L563-2 SUMMARY for call main_#t~mem18 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L563-2 5612#L568 assume !(main_#t~mem18 > 0);havoc main_#t~mem18; 5553#L571 SUMMARY for call main_#t~mem21 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L571 5554#L571-1 main_#t~post22 := main_#t~mem21; 5528#L571-2 SUMMARY for call write~int(main_#t~post22 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L571-2 5529#L571-3 havoc main_#t~mem21;havoc main_#t~post22; 5530#L568-2 SUMMARY for call main_#t~mem23 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L568-2 5598#L573 assume !(main_#t~mem23 > 0);havoc main_#t~mem23; 5583#L576 SUMMARY for call main_#t~mem26 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L576 5584#L576-1 main_#t~post27 := main_#t~mem26; 5566#L576-2 SUMMARY for call write~int(main_#t~post27 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L576-2 5567#L576-3 havoc main_#t~post27;havoc main_#t~mem26; 5569#L573-2 SUMMARY for call main_#t~mem28 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L573-2 5534#L578 assume !(main_#t~mem28 > 0);havoc main_#t~mem28; 5526#L581 SUMMARY for call main_#t~mem31 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L581 5491#L581-1 main_#t~post32 := main_#t~mem31; 5492#L581-2 SUMMARY for call write~int(main_#t~post32 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L581-2 5495#L581-3 havoc main_#t~mem31;havoc main_#t~post32; 5497#L578-2 SUMMARY for call main_#t~mem33 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L578-2 5593#L583 assume main_#t~mem33 > 0;havoc main_#t~mem33; 5587#L584 SUMMARY for call main_#t~mem34 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L584 5588#L584-1 main_#t~post35 := main_#t~mem34; 5589#L584-2 SUMMARY for call write~int(main_#t~post35 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L584-2 5590#L584-3 havoc main_#t~mem34;havoc main_#t~post35; 5575#L583-2 SUMMARY for call main_#t~mem38 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L583-2 5500#L588 assume main_#t~mem38 > 0;havoc main_#t~mem38; 5501#L589 SUMMARY for call main_#t~mem39 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L589 5533#L589-1 main_#t~post40 := main_#t~mem39; 5536#L589-2 SUMMARY for call write~int(main_#t~post40 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L589-2 5540#L589-3 havoc main_#t~mem39;havoc main_#t~post40; 5544#L588-2 SUMMARY for call main_#t~mem43 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L588-2 5606#L593 assume main_#t~mem43 > 0;havoc main_#t~mem43; 5570#L594 SUMMARY for call main_#t~mem44 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L594 5571#L594-1 main_#t~post45 := main_#t~mem44; 5573#L594-2 SUMMARY for call write~int(main_#t~post45 + 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L594-2 5574#L594-3 havoc main_#t~mem44;havoc main_#t~post45; 5522#L598-8 [2018-11-10 07:43:45,505 INFO L795 eck$LassoCheckResult]: Loop: 5522#L598-8 assume true; 5555#L598 SUMMARY for call main_#t~mem48 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L598 5582#L598-1 main_#t~short50 := main_#t~mem48 < 100; 5564#L598-2 assume main_#t~short50; 5565#L598-3 SUMMARY for call main_#t~mem49 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L598-3 5568#L598-4 main_#t~short50 := main_#t~mem49 < 100; 5572#L598-6 assume !!main_#t~short50;havoc main_#t~mem48;havoc main_#t~short50;havoc main_#t~mem49; 5498#L599 SUMMARY for call main_#t~mem51 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L599 5499#L599-1 SUMMARY for call main_#t~mem52 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L599-1 5503#L599-2 SUMMARY for call write~int(main_#t~mem51 + main_#t~mem52, main_~y~0.base, main_~y~0.offset, 4); srcloc: L599-2 5506#L599-3 havoc main_#t~mem52;havoc main_#t~mem51; 5531#L600 SUMMARY for call main_#t~mem53 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L600 5532#L600-1 SUMMARY for call main_#t~mem54 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L600-1 5535#L600-2 SUMMARY for call write~int(main_#t~mem53 - main_#t~mem54, main_~z~0.base, main_~z~0.offset, 4); srcloc: L600-2 5539#L600-3 havoc main_#t~mem54;havoc main_#t~mem53; 5522#L598-8 [2018-11-10 07:43:45,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash -959053116, now seen corresponding path program 1 times [2018-11-10 07:43:45,505 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:45,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:45,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:43:45,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:43:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:43:45,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:43:45,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:43:45,531 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 07:43:45,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:43:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash -222195246, now seen corresponding path program 15 times [2018-11-10 07:43:45,532 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:43:45,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:43:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:43:45,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:43:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:43:45,652 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-11-10 07:43:45,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:43:45,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:43:45,679 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-10 07:43:45,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:43:45,688 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2018-11-10 07:43:45,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:43:45,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 5 transitions. [2018-11-10 07:43:45,688 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:43:45,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 0 states and 0 transitions. [2018-11-10 07:43:45,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 07:43:45,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 07:43:45,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 07:43:45,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 07:43:45,688 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:45,688 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:45,688 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:43:45,689 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 07:43:45,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:43:45,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 07:43:45,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 07:43:45,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 07:43:45 BoogieIcfgContainer [2018-11-10 07:43:45,694 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 07:43:45,695 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:43:45,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:43:45,695 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:43:45,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:43:21" (3/4) ... [2018-11-10 07:43:45,698 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 07:43:45,698 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:43:45,699 INFO L168 Benchmark]: Toolchain (without parser) took 24681.32 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 487.1 MB). Free memory was 956.5 MB in the beginning and 1.4 GB in the end (delta: -465.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:45,700 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:43:45,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 934.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:45,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 934.8 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:45,700 INFO L168 Benchmark]: Boogie Preprocessor took 28.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:45,701 INFO L168 Benchmark]: RCFGBuilder took 426.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:45,701 INFO L168 Benchmark]: BuchiAutomizer took 23853.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -339.5 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:43:45,701 INFO L168 Benchmark]: Witness Printer took 3.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:43:45,704 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 934.8 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 934.8 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 23853.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -339.5 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (14 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 207 and consists of 38 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 207 and consists of 37 locations. 14 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.8s and 17 iterations. TraceHistogramMax:1. Analysis of lassos took 15.3s. Construction of modules took 1.8s. Büchi inclusion checks took 6.3s. Highest rank in rank-based complementation 3. Minimization of det autom 16. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 83 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 156 states and ocurred in iteration 7. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1368 SDtfs, 715 SDslu, 7266 SDs, 0 SdLazy, 4349 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU13 SILI1 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax105 hnf100 lsp89 ukn79 mio100 lsp36 div100 bol100 ite100 ukn100 eq205 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...