./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.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_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/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 f5878942b695ddbfe46daa43f5d95028455ef120 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:59:01,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:59:01,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:59:01,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:59:01,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:59:01,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:59:01,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:59:01,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:59:01,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:59:01,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:59:01,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:59:01,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:59:01,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:59:01,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:59:01,184 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:59:01,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:59:01,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:59:01,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:59:01,187 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:59:01,188 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:59:01,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:59:01,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:59:01,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:59:01,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:59:01,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:59:01,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:59:01,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:59:01,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:59:01,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:59:01,198 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:59:01,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:59:01,199 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:59:01,199 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:59:01,199 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:59:01,200 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:59:01,200 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:59:01,200 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:59:01,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:59:01,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:59:01,213 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:59:01,213 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:59:01,213 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:59:01,213 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:59:01,214 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:59:01,214 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:59:01,214 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:59:01,214 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:59:01,214 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:59:01,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:59:01,214 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:59:01,215 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:59:01,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:59:01,216 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:59:01,216 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:59:01,216 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:59:01,216 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:59:01,216 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:59:01,217 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:59:01,217 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_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/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 -> f5878942b695ddbfe46daa43f5d95028455ef120 [2018-11-10 11:59:01,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:59:01,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:59:01,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:59:01,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:59:01,256 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:59:01,256 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-10 11:59:01,302 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/data/759a39e0c/0ab5a884938d4259a34258e5a84addf0/FLAG38f2022dd [2018-11-10 11:59:01,692 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:59:01,693 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/sv-benchmarks/c/termination-memory-alloca/a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-10 11:59:01,702 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/data/759a39e0c/0ab5a884938d4259a34258e5a84addf0/FLAG38f2022dd [2018-11-10 11:59:01,714 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/data/759a39e0c/0ab5a884938d4259a34258e5a84addf0 [2018-11-10 11:59:01,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:59:01,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:59:01,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:59:01,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:59:01,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:59:01,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:59:01" (1/1) ... [2018-11-10 11:59:01,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10bac56c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:01, skipping insertion in model container [2018-11-10 11:59:01,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:59:01" (1/1) ... [2018-11-10 11:59:01,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:59:01,762 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:59:01,961 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:59:01,968 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:59:01,999 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:59:02,022 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:59:02,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02 WrapperNode [2018-11-10 11:59:02,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:59:02,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:59:02,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:59:02,024 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:59:02,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:59:02,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:59:02,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:59:02,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:59:02,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... [2018-11-10 11:59:02,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:59:02,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:59:02,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:59:02,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:59:02,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/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 11:59:02,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:59:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:59:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:59:02,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:59:02,348 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:59:02,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:02 BoogieIcfgContainer [2018-11-10 11:59:02,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:59:02,348 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:59:02,349 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:59:02,351 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:59:02,352 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:59:02,352 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:59:01" (1/3) ... [2018-11-10 11:59:02,353 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ad27b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:59:02, skipping insertion in model container [2018-11-10 11:59:02,353 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:59:02,353 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:59:02" (2/3) ... [2018-11-10 11:59:02,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ad27b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:59:02, skipping insertion in model container [2018-11-10 11:59:02,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:59:02,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:02" (3/3) ... [2018-11-10 11:59:02,355 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.01-alloca_true-termination_true-no-overflow.c.i [2018-11-10 11:59:02,395 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:59:02,396 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:59:02,396 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:59:02,396 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:59:02,396 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:59:02,396 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:59:02,397 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:59:02,397 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:59:02,397 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:59:02,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 11:59:02,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 11:59:02,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:02,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:02,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:59:02,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:02,425 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:59:02,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 11:59:02,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 11:59:02,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:02,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:02,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:59:02,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:02,434 INFO L793 eck$LassoCheckResult]: Stem: 20#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 9#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 10#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 18#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 21#L555-3true [2018-11-10 11:59:02,434 INFO L795 eck$LassoCheckResult]: Loop: 21#L555-3true assume true; 5#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7#L555-1true assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 15#L556true SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 19#L557-4true assume !true; 22#L557-5true SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 26#L560true SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 27#L560-1true havoc test_fun_#t~mem9; 21#L555-3true [2018-11-10 11:59:02,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:02,439 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 11:59:02,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:02,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:02,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:02,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:02,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:02,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1654609785, now seen corresponding path program 1 times [2018-11-10 11:59:02,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:02,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:02,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:02,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:02,568 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 11:59:02,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:02,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 11:59:02,571 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:59:02,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 11:59:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 11:59:02,582 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-10 11:59:02,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:02,587 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 11:59:02,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 11:59:02,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-10 11:59:02,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 11:59:02,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 19 states and 20 transitions. [2018-11-10 11:59:02,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 11:59:02,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 11:59:02,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-11-10 11:59:02,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:59:02,595 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 11:59:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-11-10 11:59:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-10 11:59:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-10 11:59:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-10 11:59:02,614 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 11:59:02,614 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-10 11:59:02,614 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:59:02,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-10 11:59:02,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 11:59:02,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:02,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:02,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:59:02,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:02,616 INFO L793 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 69#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 70#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 74#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 71#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 72#L555-3 [2018-11-10 11:59:02,616 INFO L795 eck$LassoCheckResult]: Loop: 72#L555-3 assume true; 66#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 67#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 63#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 64#L557-4 assume true; 60#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 61#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 65#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 68#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 75#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 76#L560-1 havoc test_fun_#t~mem9; 72#L555-3 [2018-11-10 11:59:02,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 11:59:02,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:02,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:02,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:02,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:02,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1822428636, now seen corresponding path program 1 times [2018-11-10 11:59:02,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:02,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:02,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:02,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -278082372, now seen corresponding path program 1 times [2018-11-10 11:59:02,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:02,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:02,806 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 11:59:02,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:02,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 11:59:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:59:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:59:02,886 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-10 11:59:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:02,976 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-10 11:59:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 11:59:02,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-10 11:59:02,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 11:59:02,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-11-10 11:59:02,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 11:59:02,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 11:59:02,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-10 11:59:02,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:59:02,979 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-10 11:59:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-10 11:59:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-10 11:59:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 11:59:02,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 11:59:02,982 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 11:59:02,982 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 11:59:02,982 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:59:02,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-10 11:59:02,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:59:02,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:02,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:02,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 11:59:02,984 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:02,984 INFO L793 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 132#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 136#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 133#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 134#L555-3 [2018-11-10 11:59:02,984 INFO L795 eck$LassoCheckResult]: Loop: 134#L555-3 assume true; 128#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 129#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 124#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 125#L557-4 assume true; 141#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 140#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 130#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 119#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 120#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 123#L558-2 havoc test_fun_#t~mem8; 127#L557-4 assume true; 121#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 122#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 126#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 137#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 138#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 139#L560-1 havoc test_fun_#t~mem9; 134#L555-3 [2018-11-10 11:59:02,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 3 times [2018-11-10 11:59:02,985 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:02,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:02,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:03,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash -623226196, now seen corresponding path program 1 times [2018-11-10 11:59:03,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:03,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:03,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:03,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:03,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:03,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash -555542580, now seen corresponding path program 1 times [2018-11-10 11:59:03,032 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:03,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:03,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:03,171 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-11-10 11:59:03,410 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-10 11:59:03,513 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:59:03,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:59:03,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:59:03,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:59:03,514 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:59:03,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:59:03,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:59:03,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:59:03,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-10 11:59:03,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:59:03,515 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:59:03,534 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 11:59:03,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 11:59:03,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 11:59:03,543 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 11:59:03,544 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 11:59:03,546 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 11:59:03,548 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 11:59:03,550 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 11:59:03,552 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 11:59:03,553 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 11:59:03,555 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 11:59:03,557 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 11:59:03,819 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2018-11-10 11:59:03,884 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 11:59:03,886 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 11:59:03,887 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 11:59:03,889 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 11:59:03,890 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 11:59:04,263 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:59:04,268 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:59:04,270 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 11:59:04,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:04,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:04,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:04,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,276 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 11:59:04,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:04,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:04,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:04,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,279 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 11:59:04,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,285 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 11:59:04,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:04,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:04,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:04,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,289 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 11:59:04,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,293 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 11:59:04,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,298 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,298 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 11:59:04,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:04,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:04,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:04,300 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,301 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 11:59:04,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,305 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 11:59:04,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:04,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:04,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:04,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,307 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 11:59:04,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,311 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 11:59:04,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:04,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:04,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:04,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,313 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 11:59:04,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,317 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 11:59:04,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,329 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 11:59:04,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,334 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 11:59:04,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,334 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:04,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,336 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:04,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,341 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 11:59:04,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,342 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:04,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,343 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:04,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,348 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 11:59:04,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,353 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 11:59:04,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,353 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:04,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,355 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:04,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:04,360 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 11:59:04,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:04,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:04,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:04,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:04,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:04,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:04,370 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:59:04,376 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:59:04,377 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 11:59:04,379 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:59:04,380 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:59:04,380 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:59:04,380 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-10 11:59:04,434 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 11:59:04,438 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:59:04,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:04,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:04,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:04,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 11:59:04,533 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 27 treesize of output 26 [2018-11-10 11:59:04,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,547 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:04,553 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 2 case distinctions, treesize of input 22 treesize of output 32 [2018-11-10 11:59:04,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 11:59:04,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:04,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:04,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:40 [2018-11-10 11:59:04,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-10 11:59:04,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 21 treesize of output 13 [2018-11-10 11:59:04,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 48 [2018-11-10 11:59:04,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:04,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:04,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-11-10 11:59:04,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 39 treesize of output 31 [2018-11-10 11:59:04,687 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:04,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 11:59:04,723 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:80, output treesize:73 [2018-11-10 11:59:04,868 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:04,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-11-10 11:59:04,872 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 11:59:04,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:04,881 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 11:59:04,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:11 [2018-11-10 11:59:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:04,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-11-10 11:59:04,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 13 states. [2018-11-10 11:59:05,392 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 24 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 64 states and 67 transitions. Complement of second has 27 states. [2018-11-10 11:59:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 11:59:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 26 transitions. [2018-11-10 11:59:05,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 26 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-10 11:59:05,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:05,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 26 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-10 11:59:05,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:05,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 26 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-10 11:59:05,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:05,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 67 transitions. [2018-11-10 11:59:05,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:59:05,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 60 states and 63 transitions. [2018-11-10 11:59:05,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 11:59:05,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 11:59:05,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 63 transitions. [2018-11-10 11:59:05,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:59:05,402 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-10 11:59:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 63 transitions. [2018-11-10 11:59:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-11-10 11:59:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 11:59:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-11-10 11:59:05,405 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 11:59:05,405 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-11-10 11:59:05,405 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:59:05,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 56 transitions. [2018-11-10 11:59:05,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 11:59:05,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:05,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:05,407 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:05,407 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:05,407 INFO L793 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 448#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 449#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 458#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 450#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 451#L555-3 assume true; 443#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 444#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 447#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 474#L557-4 assume true; 473#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 472#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 471#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 470#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 428#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 429#L558-2 havoc test_fun_#t~mem8; 435#L557-4 [2018-11-10 11:59:05,407 INFO L795 eck$LassoCheckResult]: Loop: 435#L557-4 assume true; 431#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 432#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 437#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 424#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 425#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 469#L558-2 havoc test_fun_#t~mem8; 468#L557-4 assume true; 467#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 466#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 465#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 453#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 454#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 459#L560-1 havoc test_fun_#t~mem9; 461#L555-3 assume true; 476#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 475#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 439#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 435#L557-4 [2018-11-10 11:59:05,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash -278028748, now seen corresponding path program 1 times [2018-11-10 11:59:05,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:05,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:05,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:05,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:05,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2036193300, now seen corresponding path program 2 times [2018-11-10 11:59:05,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:05,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:05,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:05,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1981136735, now seen corresponding path program 2 times [2018-11-10 11:59:05,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:05,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:05,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:05,976 WARN L179 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 123 [2018-11-10 11:59:06,073 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:59:06,073 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:59:06,073 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:59:06,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:59:06,073 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:59:06,073 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:59:06,073 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:59:06,073 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:59:06,073 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 11:59:06,073 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:59:06,074 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:59:06,077 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 11:59:06,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 11:59:06,081 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 11:59:06,306 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-11-10 11:59:06,375 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 11:59:06,376 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 11:59:06,377 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 11:59:06,379 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 11:59:06,380 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 11:59:06,382 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 11:59:06,384 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 11:59:06,385 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 11:59:06,386 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 11:59:06,387 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 11:59:06,388 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 11:59:06,389 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 11:59:06,390 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 11:59:06,391 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 11:59:06,733 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:59:06,733 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:59:06,733 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 11:59:06,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:06,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:06,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:06,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:06,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,736 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 11:59:06,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:06,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:06,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,739 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 11:59:06,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:06,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:06,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,743 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 11:59:06,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:06,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,744 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:06,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,749 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 11:59:06,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:06,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:06,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,752 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 11:59:06,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,752 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:06,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,753 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:06,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,757 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 11:59:06,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:06,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:06,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:06,761 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 11:59:06,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:06,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:06,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:06,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:06,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:06,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:06,777 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:59:06,781 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 11:59:06,781 INFO L444 ModelExtractionUtils]: 12 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 11:59:06,782 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:59:06,783 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:59:06,783 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:59:06,783 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-10 11:59:06,851 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 11:59:06,852 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:59:06,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:06,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:06,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:06,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-11-10 11:59:06,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-10 11:59:06,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,007 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 44 [2018-11-10 11:59:07,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:07,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:07,053 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-11-10 11:59:07,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,221 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 54 treesize of output 51 [2018-11-10 11:59:07,224 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 47 treesize of output 36 [2018-11-10 11:59:07,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,255 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 57 treesize of output 50 [2018-11-10 11:59:07,259 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 11:59:07,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 47 [2018-11-10 11:59:07,260 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:07,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-11-10 11:59:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:07,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-10 11:59:07,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-10 11:59:07,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 119 states and 124 transitions. Complement of second has 27 states. [2018-11-10 11:59:07,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 11:59:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2018-11-10 11:59:07,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 36 transitions. Stem has 16 letters. Loop has 18 letters. [2018-11-10 11:59:07,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:07,639 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:59:07,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:07,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:07,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:07,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 47 [2018-11-10 11:59:07,723 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,724 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 44 [2018-11-10 11:59:07,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-11-10 11:59:07,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:07,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:07,808 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:50 [2018-11-10 11:59:07,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,923 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 57 treesize of output 50 [2018-11-10 11:59:07,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 11:59:07,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 43 treesize of output 47 [2018-11-10 11:59:07,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:07,984 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 54 treesize of output 51 [2018-11-10 11:59:07,987 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 47 treesize of output 36 [2018-11-10 11:59:07,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:07,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:08,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:08,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:50 [2018-11-10 11:59:08,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:08,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-10 11:59:08,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5 Second operand 15 states. [2018-11-10 11:59:08,319 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 56 transitions. cyclomatic complexity: 5. Second operand 15 states. Result 120 states and 126 transitions. Complement of second has 29 states. [2018-11-10 11:59:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 11:59:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2018-11-10 11:59:08,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 16 letters. Loop has 18 letters. [2018-11-10 11:59:08,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:08,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 34 letters. Loop has 18 letters. [2018-11-10 11:59:08,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:08,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 16 letters. Loop has 36 letters. [2018-11-10 11:59:08,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:08,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 126 transitions. [2018-11-10 11:59:08,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 11:59:08,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 108 states and 114 transitions. [2018-11-10 11:59:08,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 11:59:08,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-10 11:59:08,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 114 transitions. [2018-11-10 11:59:08,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:59:08,322 INFO L705 BuchiCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-11-10 11:59:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 114 transitions. [2018-11-10 11:59:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-11-10 11:59:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-10 11:59:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-11-10 11:59:08,326 INFO L728 BuchiCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-10 11:59:08,326 INFO L608 BuchiCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-11-10 11:59:08,326 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:59:08,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 95 transitions. [2018-11-10 11:59:08,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 11:59:08,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:08,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:08,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:08,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:08,327 INFO L793 eck$LassoCheckResult]: Stem: 1163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1160#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1170#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1161#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1162#L555-3 assume true; 1153#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1154#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1149#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1150#L557-4 assume true; 1219#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1218#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1217#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1134#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1135#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1214#L558-2 havoc test_fun_#t~mem8; 1212#L557-4 assume true; 1141#L557 [2018-11-10 11:59:08,328 INFO L795 eck$LassoCheckResult]: Loop: 1141#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1142#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1147#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1157#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1138#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1139#L558-2 havoc test_fun_#t~mem8; 1145#L557-4 assume true; 1141#L557 [2018-11-10 11:59:08,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -28956575, now seen corresponding path program 2 times [2018-11-10 11:59:08,328 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:08,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:08,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:08,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:08,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1395364785, now seen corresponding path program 1 times [2018-11-10 11:59:08,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:08,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:08,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:08,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:08,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:08,355 INFO L82 PathProgramCache]: Analyzing trace with hash -40288431, now seen corresponding path program 3 times [2018-11-10 11:59:08,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:08,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:08,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:08,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:08,746 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 123 [2018-11-10 11:59:08,854 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 11:59:08,856 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:59:08,856 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:59:08,856 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:59:08,856 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:59:08,857 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:59:08,857 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:59:08,857 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:59:08,857 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:59:08,857 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 11:59:08,857 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:59:08,857 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:59:08,859 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 11:59:08,861 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 11:59:08,864 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 11:59:08,866 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 11:59:08,867 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 11:59:08,868 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 11:59:08,869 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 11:59:08,870 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 11:59:08,871 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 11:59:08,872 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 11:59:09,087 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2018-11-10 11:59:09,156 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 11:59:09,161 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 11:59:09,162 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 11:59:09,163 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 11:59:09,164 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 11:59:09,165 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 11:59:09,462 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:59:09,462 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:59:09,462 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 11:59:09,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:09,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:09,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:09,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,464 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 11:59:09,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,467 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 11:59:09,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,470 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 11:59:09,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:09,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:09,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:09,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,471 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 11:59:09,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:09,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:09,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:09,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,472 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 11:59:09,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,476 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 11:59:09,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:09,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:09,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:09,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,477 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 11:59:09,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,480 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 11:59:09,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:09,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:09,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:09,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,481 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 11:59:09,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,484 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 11:59:09,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,487 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 11:59:09,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,488 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,490 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 11:59:09,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,506 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 11:59:09,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,515 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 11:59:09,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,521 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 11:59:09,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,521 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:09,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:09,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,530 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 11:59:09,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,533 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 11:59:09,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,546 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 11:59:09,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,546 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:59:09,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,547 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:59:09,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:09,551 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 11:59:09,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:09,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:09,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:09,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:09,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:09,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:09,560 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:59:09,565 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 11:59:09,565 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 11:59:09,566 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:59:09,566 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:59:09,566 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:59:09,566 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2018-11-10 11:59:09,639 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-10 11:59:09,641 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:59:09,641 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:59:09,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:09,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:09,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:09,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:09,732 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 11:59:09,736 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 50 treesize of output 41 [2018-11-10 11:59:09,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:09,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:09,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:09,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:09,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 11:59:09,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:09,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:09,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:09,788 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 11:59:09,808 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 11:59:09,808 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 11:59:09,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 95 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-11-10 11:59:09,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 95 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 156 states and 165 transitions. Complement of second has 13 states. [2018-11-10 11:59:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:59:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-10 11:59:09,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-10 11:59:09,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:09,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 11:59:09,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:09,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 17 letters. Loop has 14 letters. [2018-11-10 11:59:09,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:09,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 165 transitions. [2018-11-10 11:59:09,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 11:59:09,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 121 states and 127 transitions. [2018-11-10 11:59:09,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-10 11:59:09,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-10 11:59:09,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 127 transitions. [2018-11-10 11:59:09,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:59:09,843 INFO L705 BuchiCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-11-10 11:59:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 127 transitions. [2018-11-10 11:59:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2018-11-10 11:59:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 11:59:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-11-10 11:59:09,848 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-10 11:59:09,848 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-11-10 11:59:09,848 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:59:09,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 105 transitions. [2018-11-10 11:59:09,849 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 11:59:09,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:09,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:09,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:09,850 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:09,850 INFO L793 eck$LassoCheckResult]: Stem: 1608#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1604#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1605#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1614#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1606#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1607#L555-3 assume true; 1602#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1603#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1598#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1599#L557-4 assume true; 1586#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1587#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1592#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1582#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1583#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1589#L558-2 havoc test_fun_#t~mem8; 1665#L557-4 assume true; 1662#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1659#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1656#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1646#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 1643#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1640#L560-1 havoc test_fun_#t~mem9; 1641#L555-3 assume true; 1645#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1644#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1642#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1639#L557-4 assume true; 1638#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1637#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1636#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1634#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1632#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1630#L558-2 havoc test_fun_#t~mem8; 1629#L557-4 [2018-11-10 11:59:09,850 INFO L795 eck$LassoCheckResult]: Loop: 1629#L557-4 assume true; 1628#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1627#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1626#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1620#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1625#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1624#L558-2 havoc test_fun_#t~mem8; 1623#L557-4 assume true; 1622#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1621#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1619#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1609#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 1610#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1615#L560-1 havoc test_fun_#t~mem9; 1617#L555-3 assume true; 1635#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1633#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1631#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1629#L557-4 [2018-11-10 11:59:09,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash -2120774999, now seen corresponding path program 3 times [2018-11-10 11:59:09,850 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:09,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:09,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:09,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:09,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:09,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:59:09,965 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c66ff4b7-d051-46ce-80a4-e19dd67a27bb/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:59:09,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 11:59:10,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 11:59:10,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:59:10,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:10,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 11:59:10,012 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 11:59:10,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 11:59:10,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-10 11:59:10,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 21 treesize of output 13 [2018-11-10 11:59:10,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,056 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 11:59:10,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-11-10 11:59:10,118 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:10,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 29 [2018-11-10 11:59:10,120 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 11:59:10,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,125 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 11:59:10,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:7 [2018-11-10 11:59:10,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 11:59:10,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 11:59:10,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 11:59:10,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 11:59:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:59:10,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:59:10,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2018-11-10 11:59:10,150 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:59:10,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:10,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2036193300, now seen corresponding path program 3 times [2018-11-10 11:59:10,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:10,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:59:10,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-10 11:59:10,253 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. cyclomatic complexity: 11 Second operand 17 states. [2018-11-10 11:59:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:10,407 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-11-10 11:59:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 11:59:10,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 111 transitions. [2018-11-10 11:59:10,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:59:10,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 79 states and 82 transitions. [2018-11-10 11:59:10,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 11:59:10,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 11:59:10,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 82 transitions. [2018-11-10 11:59:10,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:59:10,410 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-10 11:59:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 82 transitions. [2018-11-10 11:59:10,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2018-11-10 11:59:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 11:59:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-11-10 11:59:10,416 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-10 11:59:10,416 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-11-10 11:59:10,416 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:59:10,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 62 transitions. [2018-11-10 11:59:10,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 11:59:10,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:59:10,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:59:10,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:10,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:59:10,420 INFO L793 eck$LassoCheckResult]: Stem: 1953#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~ret13;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet11, main_#t~nondet12;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem8, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem10, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#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];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#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];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#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];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1950#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1954#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1951#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1952#L555-3 assume true; 1945#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1946#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1936#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1937#L557-4 assume true; 1932#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1933#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1970#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1971#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1930#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1931#L558-2 havoc test_fun_#t~mem8; 1944#L557-4 assume true; 1934#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1935#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1942#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1927#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1928#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1965#L558-2 havoc test_fun_#t~mem8; 1974#L557-4 assume true; 1980#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1979#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1959#L557-2 assume !(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1956#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-5 1957#L560 SUMMARY for call write~int(test_fun_#t~mem9 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1958#L560-1 havoc test_fun_#t~mem9; 1955#L555-3 assume true; 1947#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1948#L555-1 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 1938#L556 SUMMARY for call write~int(0, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1939#L557-4 assume true; 1966#L557 [2018-11-10 11:59:10,420 INFO L795 eck$LassoCheckResult]: Loop: 1966#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557 1940#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-1 1941#L557-2 assume !!(test_fun_#t~mem6 < test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1925#L558 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1926#L558-1 SUMMARY for call write~int(test_fun_#t~mem8 + 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1929#L558-2 havoc test_fun_#t~mem8; 1943#L557-4 assume true; 1966#L557 [2018-11-10 11:59:10,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:10,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1285696662, now seen corresponding path program 4 times [2018-11-10 11:59:10,420 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:10,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1395364785, now seen corresponding path program 2 times [2018-11-10 11:59:10,443 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 370083196, now seen corresponding path program 5 times [2018-11-10 11:59:10,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:59:10,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:59:10,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:59:10,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:59:11,568 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 180 DAG size of output: 159 [2018-11-10 11:59:11,747 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-10 11:59:11,749 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:59:11,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:59:11,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:59:11,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:59:11,750 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:59:11,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:59:11,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:59:11,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:59:11,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.01-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-10 11:59:11,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:59:11,750 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:59:11,753 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 11:59:11,756 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 11:59:11,758 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 11:59:11,760 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 11:59:11,761 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 11:59:11,762 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 11:59:11,763 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 11:59:11,763 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 11:59:12,007 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-11-10 11:59:12,062 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 11:59:12,063 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 11:59:12,064 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 11:59:12,065 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 11:59:12,067 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 11:59:12,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 11:59:12,069 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 11:59:12,426 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:59:12,426 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:59:12,427 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 11:59:12,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:12,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:12,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:12,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,429 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 11:59:12,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:12,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:12,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,430 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 11:59:12,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:12,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:12,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,432 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 11:59:12,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:12,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:12,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:12,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,433 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 11:59:12,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:12,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:12,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:12,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,435 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 11:59:12,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:12,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:12,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:12,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,437 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 11:59:12,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:59:12,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:59:12,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:59:12,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,438 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 11:59:12,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:12,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:12,442 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,442 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 11:59:12,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:12,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:12,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:59:12,445 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 11:59:12,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:59:12,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:59:12,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:59:12,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:59:12,446 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:59:12,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:59:12,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:59:12,460 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-10 11:59:12,460 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 11:59:12,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:59:12,461 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:59:12,461 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:59:12,461 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_4 Supporting invariants [] [2018-11-10 11:59:12,532 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 11:59:12,533 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:59:12,533 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 11:59:12,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:12,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:12,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,631 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 11:59:12,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-11-10 11:59:12,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:12,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,674 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 42 treesize of output 41 [2018-11-10 11:59:12,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:12,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:12,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:12,711 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 11:59:12,732 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 11:59:12,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 11:59:12,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 11:59:12,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 77 states and 81 transitions. Complement of second has 13 states. [2018-11-10 11:59:12,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:59:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-10 11:59:12,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 11:59:12,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:12,762 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:59:12,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:12,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:12,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:12,840 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,849 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 11:59:12,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-11-10 11:59:12,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:12,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:12,882 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 42 treesize of output 41 [2018-11-10 11:59:12,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:12,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:12,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:12,911 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 11:59:12,931 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 11:59:12,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 11:59:12,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 11:59:12,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 77 states and 81 transitions. Complement of second has 15 states. [2018-11-10 11:59:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:59:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2018-11-10 11:59:12,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 11:59:12,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:12,996 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 11:59:13,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:13,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:13,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:13,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:13,077 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-11-10 11:59:13,080 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 50 treesize of output 41 [2018-11-10 11:59:13,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:13,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:13,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:13,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 11:59:13,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-11-10 11:59:13,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 11:59:13,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:13,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 11:59:13,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 11:59:13,140 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 11:59:13,140 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 11:59:13,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-10 11:59:13,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 62 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 98 states and 104 transitions. Complement of second has 14 states. [2018-11-10 11:59:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 11:59:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 11:59:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-10 11:59:13,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 11:59:13,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:13,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-10 11:59:13,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:13,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 35 letters. Loop has 14 letters. [2018-11-10 11:59:13,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:59:13,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 104 transitions. [2018-11-10 11:59:13,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:59:13,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 0 states and 0 transitions. [2018-11-10 11:59:13,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:59:13,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:59:13,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:59:13,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:59:13,166 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:59:13,166 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:59:13,166 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:59:13,166 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:59:13,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:59:13,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:59:13,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:59:13,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:59:13 BoogieIcfgContainer [2018-11-10 11:59:13,172 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:59:13,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:59:13,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:59:13,173 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:59:13,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:59:02" (3/4) ... [2018-11-10 11:59:13,175 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:59:13,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:59:13,176 INFO L168 Benchmark]: Toolchain (without parser) took 11457.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 957.6 MB in the beginning and 1.2 GB in the end (delta: -244.4 MB). Peak memory consumption was 147.8 MB. Max. memory is 11.5 GB. [2018-11-10 11:59:13,177 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:59:13,177 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.77 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:59:13,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:59:13,178 INFO L168 Benchmark]: Boogie Preprocessor took 16.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:59:13,178 INFO L168 Benchmark]: RCFGBuilder took 232.11 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: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 11:59:13,178 INFO L168 Benchmark]: BuchiAutomizer took 10823.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.5 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:59:13,178 INFO L168 Benchmark]: Witness Printer took 3.31 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:59:13,180 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.77 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 232.11 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: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10823.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.5 MB). Peak memory consumption was 161.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.31 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 14 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.7s and 8 iterations. TraceHistogramMax:4. Analysis of lassos took 7.1s. Construction of modules took 0.4s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 70 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 99 states and ocurred in iteration 5. Nontrivial modules had stage [2, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/8 HoareTripleCheckerStatistics: 156 SDtfs, 197 SDslu, 236 SDs, 0 SdLazy, 657 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital635 mio100 ax103 hnf100 lsp94 ukn44 mio100 lsp34 div100 bol100 ite100 ukn100 eq202 hnf87 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 3 VariablesLoop: 0 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...