./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-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_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/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 72925b65ef321f719f00e79529e35268c3f3eaa3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:17:14,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:17:14,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:17:14,215 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:17:14,215 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:17:14,216 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:17:14,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:17:14,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:17:14,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:17:14,219 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:17:14,220 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:17:14,220 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:17:14,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:17:14,221 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:17:14,222 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:17:14,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:17:14,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:17:14,224 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:17:14,225 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:17:14,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:17:14,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:17:14,227 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:17:14,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:17:14,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:17:14,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:17:14,229 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:17:14,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:17:14,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:17:14,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:17:14,232 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:17:14,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:17:14,233 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:17:14,233 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:17:14,233 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:17:14,234 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:17:14,235 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:17:14,235 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 06:17:14,246 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:17:14,246 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:17:14,247 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:17:14,247 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:17:14,247 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:17:14,247 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:17:14,247 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:17:14,247 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:17:14,247 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:17:14,248 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:17:14,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:17:14,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:17:14,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:17:14,249 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:17:14,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:17:14,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:17:14,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:17:14,250 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:17:14,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:17:14,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:17:14,251 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:17:14,251 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:17:14,251 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_b03e3b33-ffdb-4c82-856c-196cfd9c848c/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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2018-11-10 06:17:14,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:17:14,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:17:14,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:17:14,283 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:17:14,283 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:17:14,283 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-10 06:17:14,319 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/data/b1468ee87/5445c03353174e0e8481f78364fafd38/FLAG94c994a97 [2018-11-10 06:17:14,737 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:17:14,738 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-10 06:17:14,744 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/data/b1468ee87/5445c03353174e0e8481f78364fafd38/FLAG94c994a97 [2018-11-10 06:17:14,752 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/bin-2019/uautomizer/data/b1468ee87/5445c03353174e0e8481f78364fafd38 [2018-11-10 06:17:14,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:17:14,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:17:14,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:17:14,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:17:14,758 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:17:14,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:17:14" (1/1) ... [2018-11-10 06:17:14,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252cd178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:14, skipping insertion in model container [2018-11-10 06:17:14,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:17:14" (1/1) ... [2018-11-10 06:17:14,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:17:14,793 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:17:14,969 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:17:14,978 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:17:15,006 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:17:15,037 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:17:15,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15 WrapperNode [2018-11-10 06:17:15,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:17:15,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:17:15,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:17:15,038 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:17:15,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:17:15,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:17:15,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:17:15,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:17:15,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... [2018-11-10 06:17:15,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:17:15,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:17:15,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:17:15,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:17:15,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/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 06:17:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 06:17:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 06:17:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:17:15,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:17:15,436 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:17:15,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:17:15 BoogieIcfgContainer [2018-11-10 06:17:15,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:17:15,437 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:17:15,437 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:17:15,440 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:17:15,440 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:17:15,440 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:17:14" (1/3) ... [2018-11-10 06:17:15,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1336823a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:17:15, skipping insertion in model container [2018-11-10 06:17:15,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:17:15,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:17:15" (2/3) ... [2018-11-10 06:17:15,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1336823a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:17:15, skipping insertion in model container [2018-11-10 06:17:15,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:17:15,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:17:15" (3/3) ... [2018-11-10 06:17:15,443 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-10 06:17:15,480 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:17:15,481 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:17:15,481 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:17:15,481 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:17:15,481 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:17:15,481 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:17:15,481 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:17:15,481 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:17:15,481 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:17:15,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 06:17:15,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 06:17:15,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:15,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:15,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:17:15,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:15,515 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:17:15,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-10 06:17:15,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 06:17:15,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:15,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:15,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 06:17:15,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:15,523 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 26#L553true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 28#L553-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 25#L554true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 8#L555true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 4#L561-4true [2018-11-10 06:17:15,523 INFO L795 eck$LassoCheckResult]: Loop: 4#L561-4true assume true; 5#L557true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7#L557-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 9#L557-2true test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 10#L557-3true assume test_fun_#t~short10; 35#L557-8true assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 19#L558true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 21#L558-1true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 23#L558-2true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 17#L559true SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 6#L559-2true havoc test_fun_#t~mem13; 4#L561-4true [2018-11-10 06:17:15,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-11-10 06:17:15,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:15,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:15,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:15,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1678118094, now seen corresponding path program 1 times [2018-11-10 06:17:15,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:15,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:15,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:15,672 INFO L82 PathProgramCache]: Analyzing trace with hash 687825974, now seen corresponding path program 1 times [2018-11-10 06:17:15,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:15,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:15,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:15,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:16,168 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 121 [2018-11-10 06:17:16,324 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 06:17:16,333 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:17:16,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:17:16,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:17:16,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:17:16,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:17:16,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:17:16,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:17:16,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:17:16,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-10 06:17:16,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:17:16,335 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:17:16,358 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 06:17:16,363 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 06:17:16,364 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 06:17:16,366 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 06:17:16,367 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 06:17:16,813 WARN L179 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 123 [2018-11-10 06:17:16,906 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 06:17:16,908 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 06:17:16,909 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 06:17:16,911 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 06:17:16,914 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 06:17:16,916 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 06:17:16,917 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 06:17:16,918 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 06:17:16,919 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 06:17:16,920 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 06:17:16,921 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 06:17:16,922 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 06:17:16,923 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 06:17:16,924 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 06:17:16,925 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 06:17:16,926 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 06:17:16,927 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 06:17:17,381 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:17:17,385 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:17:17,386 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 06:17:17,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:17,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,390 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:17,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:17,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,393 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 06:17:17,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:17,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:17,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:17,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,396 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 06:17:17,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:17,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:17,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:17,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,400 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 06:17:17,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:17,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:17,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:17,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,402 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 06:17:17,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,408 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 06:17:17,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,409 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:17:17,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,411 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:17:17,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,421 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 06:17:17,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,428 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 06:17:17,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,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 06:17:17,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,450 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 06:17:17,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,496 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 06:17:17,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,499 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,507 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 06:17:17,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,511 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 06:17:17,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,512 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:17:17,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,513 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:17:17,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,518 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 06:17:17,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,519 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:17:17,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,520 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:17:17,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,525 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 06:17:17,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,527 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,527 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,528 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,528 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 06:17:17,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,534 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 06:17:17,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,538 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 06:17:17,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,538 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:17:17,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:17:17,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,545 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 06:17:17,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,550 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 06:17:17,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,554 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,555 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 06:17:17,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:17,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:17,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:17,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:17,557 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 06:17:17,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:17,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:17,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:17,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:17,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:17,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:17,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:17:17,578 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 06:17:17,578 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:17:17,580 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:17:17,581 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:17:17,581 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:17:17,581 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 06:17:17,667 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2018-11-10 06:17:17,672 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:17:17,672 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:17:17,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:17,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:17:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:17,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:17:17,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:17,823 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 06:17:17,829 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 06:17:17,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:17,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:17,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:17,863 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:17,864 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 06:17:17,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:17,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:17:17,895 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 06:17:17,896 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 06:17:17,917 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 06:17:17,927 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-10 06:17:17,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 9 states. [2018-11-10 06:17:18,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 9 states. Result 143 states and 159 transitions. Complement of second has 20 states. [2018-11-10 06:17:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 06:17:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 06:17:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2018-11-10 06:17:18,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 6 letters. Loop has 12 letters. [2018-11-10 06:17:18,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:17:18,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 18 letters. Loop has 12 letters. [2018-11-10 06:17:18,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:17:18,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 69 transitions. Stem has 6 letters. Loop has 24 letters. [2018-11-10 06:17:18,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:17:18,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 159 transitions. [2018-11-10 06:17:18,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 51 [2018-11-10 06:17:18,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 99 states and 112 transitions. [2018-11-10 06:17:18,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 06:17:18,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-10 06:17:18,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 112 transitions. [2018-11-10 06:17:18,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:17:18,109 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 112 transitions. [2018-11-10 06:17:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 112 transitions. [2018-11-10 06:17:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2018-11-10 06:17:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-10 06:17:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-11-10 06:17:18,128 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-11-10 06:17:18,128 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-11-10 06:17:18,128 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:17:18,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 104 transitions. [2018-11-10 06:17:18,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 51 [2018-11-10 06:17:18,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:18,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:18,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,130 INFO L793 eck$LassoCheckResult]: Stem: 474#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 453#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 454#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 473#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 472#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 442#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 443#L561-4 assume true; 433#L557 [2018-11-10 06:17:18,130 INFO L795 eck$LassoCheckResult]: Loop: 433#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 436#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 440#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 444#L557-3 assume !test_fun_#t~short10; 475#L557-5 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-5 476#L557-6 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-6 518#L557-7 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 517#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 516#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 515#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 491#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 455#L561 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L561 456#L561-1 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 459#L561-2 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 432#L561-4 assume true; 433#L557 [2018-11-10 06:17:18,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1802963365, now seen corresponding path program 1 times [2018-11-10 06:17:18,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 659444946, now seen corresponding path program 1 times [2018-11-10 06:17:18,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:18,238 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 06:17:18,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:17:18,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 06:17:18,241 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:17:18,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 06:17:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 06:17:18,245 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. cyclomatic complexity: 17 Second operand 9 states. [2018-11-10 06:17:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:17:18,404 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-11-10 06:17:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:17:18,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 130 transitions. [2018-11-10 06:17:18,406 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-10 06:17:18,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 105 states and 117 transitions. [2018-11-10 06:17:18,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2018-11-10 06:17:18,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2018-11-10 06:17:18,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 117 transitions. [2018-11-10 06:17:18,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:17:18,407 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-11-10 06:17:18,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 117 transitions. [2018-11-10 06:17:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2018-11-10 06:17:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 06:17:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-11-10 06:17:18,410 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-11-10 06:17:18,410 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-11-10 06:17:18,410 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:17:18,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 97 transitions. [2018-11-10 06:17:18,411 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-10 06:17:18,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:18,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:18,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,411 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,412 INFO L793 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 679#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 680#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 698#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 697#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 672#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 673#L561-4 assume true; 717#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 744#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 743#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 742#L557-3 assume test_fun_#t~short10; 729#L557-8 [2018-11-10 06:17:18,412 INFO L795 eck$LassoCheckResult]: Loop: 729#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 727#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 725#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 722#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 723#L561 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L561 739#L561-1 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 737#L561-2 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 735#L561-4 assume true; 733#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 732#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 731#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 730#L557-3 assume test_fun_#t~short10; 729#L557-8 [2018-11-10 06:17:18,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1608865321, now seen corresponding path program 1 times [2018-11-10 06:17:18,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1335926647, now seen corresponding path program 1 times [2018-11-10 06:17:18,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:18,486 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 06:17:18,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:17:18,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 06:17:18,487 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:17:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:17:18,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:17:18,487 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-10 06:17:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:17:18,618 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-11-10 06:17:18,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 06:17:18,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 106 transitions. [2018-11-10 06:17:18,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-10 06:17:18,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 83 states and 91 transitions. [2018-11-10 06:17:18,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-10 06:17:18,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-10 06:17:18,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 91 transitions. [2018-11-10 06:17:18,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:17:18,621 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-10 06:17:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 91 transitions. [2018-11-10 06:17:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2018-11-10 06:17:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 06:17:18,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-11-10 06:17:18,624 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-10 06:17:18,624 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-11-10 06:17:18,624 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:17:18,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 75 transitions. [2018-11-10 06:17:18,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-10 06:17:18,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:18,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:18,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,627 INFO L793 eck$LassoCheckResult]: Stem: 902#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 884#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 885#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 901#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 900#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 880#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 881#L561-4 assume true; 908#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 927#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 926#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 924#L557-3 assume !test_fun_#t~short10; 918#L557-5 [2018-11-10 06:17:18,627 INFO L795 eck$LassoCheckResult]: Loop: 918#L557-5 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-5 921#L557-6 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-6 919#L557-7 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 914#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 915#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 910#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 911#L558-2 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 889#L559 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 864#L559-1 SUMMARY for call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 865#L559-2 havoc test_fun_#t~mem13; 868#L561-4 assume true; 923#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 922#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 920#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 916#L557-3 assume !test_fun_#t~short10; 918#L557-5 [2018-11-10 06:17:18,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1608865323, now seen corresponding path program 1 times [2018-11-10 06:17:18,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1521401083, now seen corresponding path program 1 times [2018-11-10 06:17:18,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,655 INFO L82 PathProgramCache]: Analyzing trace with hash -515664997, now seen corresponding path program 1 times [2018-11-10 06:17:18,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:17:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 06:17:18,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:17:18,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:17:18,841 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-10 06:17:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:17:18,936 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-10 06:17:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:17:18,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 76 transitions. [2018-11-10 06:17:18,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-10 06:17:18,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 76 transitions. [2018-11-10 06:17:18,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-10 06:17:18,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-11-10 06:17:18,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 76 transitions. [2018-11-10 06:17:18,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:17:18,939 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-11-10 06:17:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 76 transitions. [2018-11-10 06:17:18,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2018-11-10 06:17:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 06:17:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-10 06:17:18,942 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-10 06:17:18,943 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-10 06:17:18,943 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:17:18,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 67 transitions. [2018-11-10 06:17:18,943 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 06:17:18,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:18,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:18,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,944 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:18,944 INFO L793 eck$LassoCheckResult]: Stem: 1063#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1045#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 1046#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1062#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 1061#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 1037#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 1038#L561-4 assume true; 1074#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1083#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1039#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1040#L557-3 assume !test_fun_#t~short10; 1043#L557-5 [2018-11-10 06:17:18,944 INFO L795 eck$LassoCheckResult]: Loop: 1043#L557-5 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-5 1064#L557-6 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-6 1066#L557-7 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 1068#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1054#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1055#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1058#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 1060#L561 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L561 1049#L561-1 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1050#L561-2 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 1053#L562 SUMMARY for call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 1065#L562-1 SUMMARY for call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 1067#L562-2 havoc test_fun_#t~mem16; 1033#L561-4 assume true; 1077#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1076#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1075#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1073#L557-3 assume !test_fun_#t~short10; 1043#L557-5 [2018-11-10 06:17:18,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1608865323, now seen corresponding path program 2 times [2018-11-10 06:17:18,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,963 INFO L82 PathProgramCache]: Analyzing trace with hash -479312496, now seen corresponding path program 1 times [2018-11-10 06:17:18,963 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:17:18,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:18,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -287431366, now seen corresponding path program 1 times [2018-11-10 06:17:18,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:18,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:19,143 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2018-11-10 06:17:19,477 WARN L179 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 133 [2018-11-10 06:17:19,630 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-10 06:17:19,633 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:17:19,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:17:19,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:17:19,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:17:19,633 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:17:19,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:17:19,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:17:19,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:17:19,633 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 06:17:19,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:17:19,633 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:17:19,637 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 06:17:19,640 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 06:17:19,642 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 06:17:19,644 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 06:17:19,645 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 06:17:19,647 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 06:17:19,648 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 06:17:19,649 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 06:17:19,650 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 06:17:19,651 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 06:17:19,652 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 06:17:19,654 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 06:17:19,656 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 06:17:20,078 WARN L179 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 132 [2018-11-10 06:17:20,186 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-11-10 06:17:20,186 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 06:17:20,187 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 06:17:20,188 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 06:17:20,189 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 06:17:20,190 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 06:17:20,191 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 06:17:20,192 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 06:17:20,638 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:17:20,638 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:17:20,639 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 06:17:20,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,641 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 06:17:20,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,643 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 06:17:20,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,644 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 06:17:20,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,646 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 06:17:20,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,648 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 06:17:20,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,650 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 06:17:20,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,653 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 06:17:20,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,655 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 06:17:20,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:17:20,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:17:20,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:17:20,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,656 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 06:17:20,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,657 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,657 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 06:17:20,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,659 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 06:17:20,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,662 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 06:17:20,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,664 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 06:17:20,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,665 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:17:20,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,666 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:17:20,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,669 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 06:17:20,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,672 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 06:17:20,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,689 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 06:17:20,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,694 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 06:17:20,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,695 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 06:17:20,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,696 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:17:20,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,698 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 06:17:20,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,701 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 06:17:20,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:17:20,707 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 06:17:20,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:17:20,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:17:20,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:17:20,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:17:20,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:17:20,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 06:17:20,721 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 06:17:20,732 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 06:17:20,732 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 06:17:20,732 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 06:17:20,733 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 06:17:20,733 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 06:17:20,733 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-10 06:17:20,846 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-10 06:17:20,847 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:17:20,847 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:17:20,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:20,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:17:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:20,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:17:20,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:20,987 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 06:17:20,991 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 06:17:20,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,011 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:21,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:21,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:21,015 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 06:17:21,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:17:21,045 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 06:17:21,045 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:50 [2018-11-10 06:17:21,083 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 06:17:21,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-10 06:17:21,083 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 67 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-10 06:17:21,228 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 67 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 156 states and 170 transitions. Complement of second has 19 states. [2018-11-10 06:17:21,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 06:17:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 06:17:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2018-11-10 06:17:21,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60 transitions. Stem has 11 letters. Loop has 18 letters. [2018-11-10 06:17:21,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:17:21,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60 transitions. Stem has 29 letters. Loop has 18 letters. [2018-11-10 06:17:21,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:17:21,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60 transitions. Stem has 11 letters. Loop has 36 letters. [2018-11-10 06:17:21,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 06:17:21,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 170 transitions. [2018-11-10 06:17:21,234 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2018-11-10 06:17:21,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 133 states and 145 transitions. [2018-11-10 06:17:21,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-11-10 06:17:21,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2018-11-10 06:17:21,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 145 transitions. [2018-11-10 06:17:21,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:17:21,236 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-11-10 06:17:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 145 transitions. [2018-11-10 06:17:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2018-11-10 06:17:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-10 06:17:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-11-10 06:17:21,241 INFO L728 BuchiCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-11-10 06:17:21,241 INFO L608 BuchiCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-11-10 06:17:21,241 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:17:21,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 136 transitions. [2018-11-10 06:17:21,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2018-11-10 06:17:21,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:21,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:21,243 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:21,243 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:21,243 INFO L793 eck$LassoCheckResult]: Stem: 1569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 1547#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1568#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 1567#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 1539#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 1540#L561-4 assume true; 1609#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1645#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1644#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1643#L557-3 assume test_fun_#t~short10; 1642#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1641#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1640#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1639#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 1623#L561 [2018-11-10 06:17:21,243 INFO L795 eck$LassoCheckResult]: Loop: 1623#L561 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L561 1638#L561-1 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1637#L561-2 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 1636#L562 SUMMARY for call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 1632#L562-1 SUMMARY for call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 1583#L562-2 havoc test_fun_#t~mem16; 1535#L561-4 assume true; 1635#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1634#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1631#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1630#L557-3 assume test_fun_#t~short10; 1629#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1627#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1625#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1622#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 1623#L561 [2018-11-10 06:17:21,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1550236494, now seen corresponding path program 1 times [2018-11-10 06:17:21,244 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:21,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:21,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:21,288 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 06:17:21,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:17:21,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 06:17:21,288 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:17:21,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1033709517, now seen corresponding path program 1 times [2018-11-10 06:17:21,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:21,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:21,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:21,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:21,350 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 06:17:21,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:17:21,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 06:17:21,351 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:17:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 06:17:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 06:17:21,351 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 06:17:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:17:21,433 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-10 06:17:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 06:17:21,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2018-11-10 06:17:21,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 06:17:21,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 77 states and 81 transitions. [2018-11-10 06:17:21,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-10 06:17:21,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-10 06:17:21,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 81 transitions. [2018-11-10 06:17:21,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 06:17:21,436 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-10 06:17:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 81 transitions. [2018-11-10 06:17:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-10 06:17:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 06:17:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-10 06:17:21,439 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-10 06:17:21,439 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-10 06:17:21,439 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:17:21,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 77 transitions. [2018-11-10 06:17:21,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-10 06:17:21,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:17:21,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:17:21,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:21,441 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:17:21,441 INFO L793 eck$LassoCheckResult]: Stem: 1798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1778#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;#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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.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~malloc5.base, test_fun_#t~malloc5.offset; 1779#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1797#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 1796#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 1772#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 1773#L561-4 assume true; 1825#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1822#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1819#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1816#L557-3 assume !test_fun_#t~short10; 1799#L557-5 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-5 1800#L557-6 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-6 1806#L557-7 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 1810#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1826#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1824#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1821#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 1782#L561 SUMMARY for call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L561 1783#L561-1 SUMMARY for call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L561-1 1785#L561-2 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem15;havoc test_fun_#t~mem14; 1789#L562 SUMMARY for call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562 1803#L562-1 SUMMARY for call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L562-1 1808#L562-2 havoc test_fun_#t~mem16; 1762#L561-4 assume true; 1763#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1766#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1770#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1774#L557-3 assume test_fun_#t~short10; 1776#L557-8 [2018-11-10 06:17:21,441 INFO L795 eck$LassoCheckResult]: Loop: 1776#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 1790#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 1791#L558-1 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L558-1 1794#L558-2 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12; 1786#L559 SUMMARY for call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559 1758#L559-1 SUMMARY for call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L559-1 1759#L559-2 havoc test_fun_#t~mem13; 1768#L561-4 assume true; 1818#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1815#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 1814#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 1813#L557-3 assume test_fun_#t~short10; 1776#L557-8 [2018-11-10 06:17:21,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash -287431368, now seen corresponding path program 1 times [2018-11-10 06:17:21,442 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:21,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:21,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:21,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:17:21,574 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b03e3b33-ffdb-4c82-856c-196cfd9c848c/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 06:17:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:17:21,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:17:21,620 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:21,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 06:17:21,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:21,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 06:17:21,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 06:17:21,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-10 06:17:21,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 34 [2018-11-10 06:17:21,735 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 10 treesize of output 9 [2018-11-10 06:17:21,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:16 [2018-11-10 06:17:21,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-10 06:17:21,795 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 13 treesize of output 9 [2018-11-10 06:17:21,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,799 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 06:17:21,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:17:21,803 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-10 06:17:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:17:21,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 06:17:21,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-10 06:17:21,835 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 06:17:21,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:17:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1498806928, now seen corresponding path program 2 times [2018-11-10 06:17:21,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:17:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:17:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:17:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:17:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:17:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 06:17:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-10 06:17:21,924 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. cyclomatic complexity: 7 Second operand 18 states. [2018-11-10 06:17:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:17:22,160 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-10 06:17:22,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:17:22,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 50 transitions. [2018-11-10 06:17:22,161 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:17:22,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2018-11-10 06:17:22,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 06:17:22,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 06:17:22,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 06:17:22,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:17:22,161 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:17:22,161 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:17:22,161 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:17:22,161 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:17:22,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:17:22,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 06:17:22,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 06:17:22,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:17:22 BoogieIcfgContainer [2018-11-10 06:17:22,167 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:17:22,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:17:22,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:17:22,168 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:17:22,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:17:15" (3/4) ... [2018-11-10 06:17:22,171 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 06:17:22,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:17:22,172 INFO L168 Benchmark]: Toolchain (without parser) took 7417.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 231.7 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -111.4 MB). Peak memory consumption was 120.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:22,173 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:17:22,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.93 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:22,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:22,174 INFO L168 Benchmark]: Boogie Preprocessor took 18.81 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 06:17:22,174 INFO L168 Benchmark]: RCFGBuilder took 306.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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:22,174 INFO L168 Benchmark]: BuchiAutomizer took 6730.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. [2018-11-10 06:17:22,175 INFO L168 Benchmark]: Witness Printer took 3.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:17:22,177 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.93 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 936.6 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 73.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -196.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.81 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 306.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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6730.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 92.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 11 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 10 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.0s. Construction of modules took 0.4s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 64 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 124 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 168 SDtfs, 376 SDslu, 365 SDs, 0 SdLazy, 805 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU1 SILI1 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital390 mio100 ax104 hnf99 lsp92 ukn73 mio100 lsp37 div100 bol100 ite100 ukn100 eq200 hnf87 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...