./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/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 3cca4963db77635bc2da65f99e90064d806437e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:37:57,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:37:57,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:37:57,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:37:57,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:37:57,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:37:57,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:37:57,343 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:37:57,344 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:37:57,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:37:57,345 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:37:57,345 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:37:57,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:37:57,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:37:57,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:37:57,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:37:57,348 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:37:57,350 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:37:57,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:37:57,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:37:57,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:37:57,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:37:57,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:37:57,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:37:57,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:37:57,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:37:57,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:37:57,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:37:57,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:37:57,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:37:57,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:37:57,361 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:37:57,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:37:57,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:37:57,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:37:57,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:37:57,362 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:37:57,375 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:37:57,375 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:37:57,376 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:37:57,376 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:37:57,376 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:37:57,376 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:37:57,376 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:37:57,376 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:37:57,377 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:37:57,377 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:37:57,378 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:37:57,378 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:37:57,378 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:37:57,378 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:37:57,378 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:37:57,378 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:37:57,379 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:37:57,379 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:37:57,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:37:57,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:37:57,379 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:37:57,379 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:37:57,379 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_b45ade52-3105-4ef0-8582-af9887ef01dc/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 -> 3cca4963db77635bc2da65f99e90064d806437e6 [2018-11-10 12:37:57,403 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:37:57,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:37:57,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:37:57,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:37:57,416 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:37:57,417 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-10 12:37:57,460 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/data/f38737a1b/d91c2d4eecd64a599642dedcd200bb0d/FLAG0e5c39a40 [2018-11-10 12:37:57,829 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:37:57,830 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-10 12:37:57,837 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/data/f38737a1b/d91c2d4eecd64a599642dedcd200bb0d/FLAG0e5c39a40 [2018-11-10 12:37:57,847 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/bin-2019/uautomizer/data/f38737a1b/d91c2d4eecd64a599642dedcd200bb0d [2018-11-10 12:37:57,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:37:57,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:37:57,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:37:57,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:37:57,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:37:57,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:37:57" (1/1) ... [2018-11-10 12:37:57,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:57, skipping insertion in model container [2018-11-10 12:37:57,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:37:57" (1/1) ... [2018-11-10 12:37:57,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:37:57,895 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:37:58,091 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:37:58,100 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:37:58,128 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:37:58,160 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:37:58,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58 WrapperNode [2018-11-10 12:37:58,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:37:58,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:37:58,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:37:58,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:37:58,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:37:58,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:37:58,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:37:58,245 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:37:58,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... [2018-11-10 12:37:58,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:37:58,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:37:58,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:37:58,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:37:58,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b45ade52-3105-4ef0-8582-af9887ef01dc/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 12:37:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:37:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:37:58,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:37:58,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:37:58,567 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:37:58,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:37:58 BoogieIcfgContainer [2018-11-10 12:37:58,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:37:58,568 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:37:58,568 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:37:58,571 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:37:58,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:37:58,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:37:57" (1/3) ... [2018-11-10 12:37:58,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ef8b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:37:58, skipping insertion in model container [2018-11-10 12:37:58,572 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:37:58,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:37:58" (2/3) ... [2018-11-10 12:37:58,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ef8b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:37:58, skipping insertion in model container [2018-11-10 12:37:58,573 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:37:58,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:37:58" (3/3) ... [2018-11-10 12:37:58,574 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-10 12:37:58,620 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:37:58,620 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:37:58,620 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:37:58,620 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:37:58,620 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:37:58,621 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:37:58,621 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:37:58,621 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:37:58,621 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:37:58,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:37:58,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:37:58,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:37:58,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:37:58,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:37:58,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:58,665 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:37:58,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 12:37:58,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:37:58,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:37:58,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:37:58,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:37:58,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:58,675 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 9#L554-2true [2018-11-10 12:37:58,675 INFO L795 eck$LassoCheckResult]: Loop: 9#L554-2true assume true; 33#L551-1true SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 34#L551-2true main_#t~short7 := main_#t~mem5 > 0; 16#L551-3true assume !main_#t~short7; 25#L551-7true main_#t~short9 := main_#t~short7; 27#L551-8true assume !main_#t~short9; 13#L551-12true assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 10#L552true assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 28#L553true SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 31#L553-1true SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 32#L553-2true havoc main_#t~mem11; 9#L554-2true [2018-11-10 12:37:58,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:37:58,682 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:58,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:58,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1066255600, now seen corresponding path program 1 times [2018-11-10 12:37:58,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:58,828 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 12:37:58,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:37:58,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:37:58,833 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:37:58,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:37:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:37:58,846 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-10 12:37:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:58,870 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-10 12:37:58,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:37:58,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-11-10 12:37:58,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:37:58,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 28 states and 31 transitions. [2018-11-10 12:37:58,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 12:37:58,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 12:37:58,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2018-11-10 12:37:58,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:37:58,880 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 12:37:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2018-11-10 12:37:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 12:37:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 12:37:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-10 12:37:58,902 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 12:37:58,902 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 12:37:58,902 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:37:58,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2018-11-10 12:37:58,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:37:58,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:37:58,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:37:58,904 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:37:58,904 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:58,904 INFO L793 eck$LassoCheckResult]: Stem: 99#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 75#L554-2 [2018-11-10 12:37:58,905 INFO L795 eck$LassoCheckResult]: Loop: 75#L554-2 assume true; 82#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 101#L551-2 main_#t~short7 := main_#t~mem5 > 0; 88#L551-3 assume !main_#t~short7; 89#L551-7 main_#t~short9 := main_#t~short7; 97#L551-8 assume main_#t~short9; 80#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 81#L551-10 main_#t~short9 := main_#t~mem8 > 0; 86#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 83#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 84#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 98#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 100#L553-2 havoc main_#t~mem11; 75#L554-2 [2018-11-10 12:37:58,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 12:37:58,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:58,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:58,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash -566995533, now seen corresponding path program 1 times [2018-11-10 12:37:58,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:37:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:37:58,950 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 12:37:58,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:37:58,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:37:58,951 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:37:58,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:37:58,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:37:58,952 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 12:37:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:37:58,984 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-10 12:37:58,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:37:58,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2018-11-10 12:37:58,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:37:58,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 30 transitions. [2018-11-10 12:37:58,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 12:37:58,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 12:37:58,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2018-11-10 12:37:58,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:37:58,986 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 12:37:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2018-11-10 12:37:58,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-10 12:37:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 12:37:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-10 12:37:58,988 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 12:37:58,989 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-10 12:37:58,989 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:37:58,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2018-11-10 12:37:58,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:37:58,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:37:58,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:37:58,990 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:37:58,990 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:37:58,990 INFO L793 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 146#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 142#L554-2 [2018-11-10 12:37:58,991 INFO L795 eck$LassoCheckResult]: Loop: 142#L554-2 assume true; 149#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 168#L551-2 main_#t~short7 := main_#t~mem5 > 0; 155#L551-3 assume main_#t~short7; 156#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 159#L551-5 main_#t~short7 := main_#t~mem6 > 0; 161#L551-7 main_#t~short9 := main_#t~short7; 164#L551-8 assume main_#t~short9; 147#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 148#L551-10 main_#t~short9 := main_#t~mem8 > 0; 153#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 150#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 151#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 165#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 167#L553-2 havoc main_#t~mem11; 142#L554-2 [2018-11-10 12:37:58,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:58,991 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 12:37:58,991 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:58,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:58,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:58,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:58,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:59,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:59,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1565181494, now seen corresponding path program 1 times [2018-11-10 12:37:59,009 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:59,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:37:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:59,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:37:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash 57574964, now seen corresponding path program 1 times [2018-11-10 12:37:59,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:37:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:37:59,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:59,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:37:59,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:37:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:37:59,254 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-11-10 12:37:59,431 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:37:59,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:37:59,432 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:37:59,432 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:37:59,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:37:59,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:37:59,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:37:59,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:37:59,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 12:37:59,433 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:37:59,433 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:37:59,451 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 12:37:59,457 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 12:37:59,464 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 12:37:59,466 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 12:37:59,475 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 12:37:59,478 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 12:37:59,777 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2018-11-10 12:37:59,909 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-10 12:37:59,910 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 12:37:59,913 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 12:37:59,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 12:37:59,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 12:37:59,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 12:37:59,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 12:37:59,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 12:37:59,930 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 12:37:59,932 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 12:37:59,933 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 12:37:59,936 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 12:37:59,939 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 12:37:59,941 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 12:38:00,364 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:00,368 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:00,370 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 12:38:00,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:00,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:00,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:00,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,376 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 12:38:00,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:00,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:38:00,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:38:00,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:00,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,382 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 12:38:00,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:00,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:00,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:00,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,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 12:38:00,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:00,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,392 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 12:38:00,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:00,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,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 12:38:00,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:00,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,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 12:38:00,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:00,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,416 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 12:38:00,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,417 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:00,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,421 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:00,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:00,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:00,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,439 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 12:38:00,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,441 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:00,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,442 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:00,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:00,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:00,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 12:38:00,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:00,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:00,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:00,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:00,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:00,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:00,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:00,456 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:00,459 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:00,459 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:00,461 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:00,461 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:38:00,461 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:00,462 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-10 12:38:00,539 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:00,543 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:00,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:00,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:00,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:00,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:00,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 12:38:00,698 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 34 treesize of output 25 [2018-11-10 12:38:00,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:00,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:00,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:00,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 12:38:00,725 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 12:38:00,727 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:38:00,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-10 12:38:00,837 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 30 transitions. cyclomatic complexity: 3. Second operand 8 states. Result 69 states and 74 transitions. Complement of second has 15 states. [2018-11-10 12:38:00,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:38:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2018-11-10 12:38:00,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 2 letters. Loop has 15 letters. [2018-11-10 12:38:00,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:00,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 17 letters. Loop has 15 letters. [2018-11-10 12:38:00,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:00,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 23 transitions. Stem has 2 letters. Loop has 30 letters. [2018-11-10 12:38:00,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:00,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 74 transitions. [2018-11-10 12:38:00,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:38:00,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 62 states and 67 transitions. [2018-11-10 12:38:00,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 12:38:00,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-10 12:38:00,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 67 transitions. [2018-11-10 12:38:00,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:00,844 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-11-10 12:38:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 67 transitions. [2018-11-10 12:38:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-11-10 12:38:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 12:38:00,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-10 12:38:00,848 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 12:38:00,848 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-10 12:38:00,848 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:38:00,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2018-11-10 12:38:00,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 12:38:00,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:00,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:00,850 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:00,850 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 12:38:00,850 INFO L793 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 433#L554-2 assume true; 439#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 470#L551-2 main_#t~short7 := main_#t~mem5 > 0; 449#L551-3 assume main_#t~short7; 450#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 455#L551-5 main_#t~short7 := main_#t~mem6 > 0; 458#L551-7 main_#t~short9 := main_#t~short7; 462#L551-8 assume main_#t~short9; 434#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 435#L551-10 main_#t~short9 := main_#t~mem8 > 0; 446#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 442#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 443#L554 [2018-11-10 12:38:00,851 INFO L795 eck$LassoCheckResult]: Loop: 443#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 453#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 454#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 457#L558-2 havoc main_#t~mem15; 448#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 427#L559-1 havoc main_#t~nondet16; 428#L554-2 assume true; 482#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 481#L551-2 main_#t~short7 := main_#t~mem5 > 0; 480#L551-3 assume main_#t~short7; 479#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 478#L551-5 main_#t~short7 := main_#t~mem6 > 0; 477#L551-7 main_#t~short9 := main_#t~short7; 476#L551-8 assume main_#t~short9; 475#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 474#L551-10 main_#t~short9 := main_#t~mem8 > 0; 473#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 472#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 443#L554 [2018-11-10 12:38:00,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash -521460811, now seen corresponding path program 1 times [2018-11-10 12:38:00,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:00,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:00,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:00,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:00,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:00,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:00,868 INFO L82 PathProgramCache]: Analyzing trace with hash 469538838, now seen corresponding path program 1 times [2018-11-10 12:38:00,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:00,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:00,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:00,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:00,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:00,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1622034742, now seen corresponding path program 1 times [2018-11-10 12:38:00,884 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:00,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:00,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:00,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:01,068 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-11-10 12:38:01,330 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 94 [2018-11-10 12:38:01,391 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:01,391 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:01,391 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:01,391 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:01,391 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:01,391 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:01,391 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:01,391 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:01,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 12:38:01,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:01,391 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:01,394 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 12:38:01,395 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 12:38:01,396 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 12:38:01,398 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 12:38:01,399 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 12:38:01,401 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 12:38:01,402 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 12:38:01,403 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 12:38:01,405 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 12:38:01,406 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 12:38:01,407 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 12:38:01,652 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 94 [2018-11-10 12:38:01,759 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 12:38:01,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:01,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:01,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:01,764 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 12:38:01,765 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 12:38:01,766 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 12:38:01,767 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 12:38:02,224 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:02,224 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:02,224 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 12:38:02,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,227 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 12:38:02,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,230 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 12:38:02,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,234 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 12:38:02,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,238 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 12:38:02,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,246 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 12:38:02,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,249 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 12:38:02,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,255 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 12:38:02,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,258 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 12:38:02,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,260 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 12:38:02,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:02,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:02,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:02,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,262 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 12:38:02,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,264 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,266 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 12:38:02,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:02,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:02,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,319 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:02,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,320 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:02,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,325 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 12:38:02,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,332 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 12:38:02,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,338 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 12:38:02,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:02,345 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 12:38:02,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:02,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:02,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:02,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:02,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:02,347 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:02,354 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:02,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:02,359 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:02,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:02,361 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:02,361 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:02,361 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2018-11-10 12:38:02,443 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:02,445 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:02,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:02,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:02,485 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 12:38:02,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:02,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:02,507 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 12:38:02,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 12:38:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:02,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:02,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:02,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:02,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:02,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:02,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:02,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:02,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:02,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:02,659 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 12:38:02,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 12:38:02,659 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 60 transitions. cyclomatic complexity: 6 Second operand 9 states. [2018-11-10 12:38:02,766 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 60 transitions. cyclomatic complexity: 6. Second operand 9 states. Result 130 states and 143 transitions. Complement of second has 14 states. [2018-11-10 12:38:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:02,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:38:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-10 12:38:02,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 14 letters. Loop has 18 letters. [2018-11-10 12:38:02,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:02,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 32 letters. Loop has 18 letters. [2018-11-10 12:38:02,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:02,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 57 transitions. Stem has 14 letters. Loop has 36 letters. [2018-11-10 12:38:02,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:02,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 143 transitions. [2018-11-10 12:38:02,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 12:38:02,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 111 states and 121 transitions. [2018-11-10 12:38:02,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 12:38:02,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-10 12:38:02,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 121 transitions. [2018-11-10 12:38:02,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:02,774 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-11-10 12:38:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 121 transitions. [2018-11-10 12:38:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-11-10 12:38:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-10 12:38:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-11-10 12:38:02,778 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-11-10 12:38:02,778 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-11-10 12:38:02,778 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:38:02,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 116 transitions. [2018-11-10 12:38:02,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 12:38:02,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:02,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:02,780 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:02,780 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 12:38:02,780 INFO L793 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 857#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 858#L554-2 assume true; 932#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 930#L551-2 main_#t~short7 := main_#t~mem5 > 0; 928#L551-3 assume main_#t~short7; 926#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 924#L551-5 main_#t~short7 := main_#t~mem6 > 0; 922#L551-7 main_#t~short9 := main_#t~short7; 920#L551-8 assume main_#t~short9; 918#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 916#L551-10 main_#t~short9 := main_#t~mem8 > 0; 914#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 912#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 910#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 854#L555 [2018-11-10 12:38:02,780 INFO L795 eck$LassoCheckResult]: Loop: 854#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 855#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 856#L555-2 havoc main_#t~mem13; 891#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 892#L556-1 havoc main_#t~nondet14; 851#L554-2 assume true; 931#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 929#L551-2 main_#t~short7 := main_#t~mem5 > 0; 927#L551-3 assume main_#t~short7; 925#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 923#L551-5 main_#t~short7 := main_#t~mem6 > 0; 921#L551-7 main_#t~short9 := main_#t~short7; 919#L551-8 assume main_#t~short9; 917#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 915#L551-10 main_#t~short9 := main_#t~mem8 > 0; 913#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 911#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 909#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 854#L555 [2018-11-10 12:38:02,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1014584085, now seen corresponding path program 1 times [2018-11-10 12:38:02,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:02,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:02,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:02,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1974303956, now seen corresponding path program 1 times [2018-11-10 12:38:02,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:02,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:02,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:02,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959232, now seen corresponding path program 1 times [2018-11-10 12:38:02,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:02,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:02,975 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-10 12:38:03,268 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 100 [2018-11-10 12:38:03,363 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:03,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:03,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:03,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:03,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:03,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:03,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:03,364 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:03,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 12:38:03,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:03,364 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:03,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 12:38:03,369 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 12:38:03,374 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 12:38:03,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,392 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 12:38:03,394 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 12:38:03,645 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2018-11-10 12:38:03,761 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-11-10 12:38:03,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:03,766 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 12:38:03,767 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 12:38:03,769 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 12:38:03,770 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 12:38:03,772 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 12:38:04,150 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:04,150 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:04,151 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 12:38:04,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,155 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,163 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 12:38:04,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,172 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,177 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 12:38:04,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,178 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,178 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 12:38:04,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,179 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:38:04,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,179 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:38:04,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:04,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:04,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:04,183 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,183 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:04,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,185 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:04,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,189 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:04,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,190 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:04,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,191 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:04,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,194 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 12:38:04,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,213 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 12:38:04,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:04,218 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 12:38:04,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:04,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:04,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:04,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:04,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:04,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:04,226 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:04,231 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:38:04,231 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 12:38:04,231 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:04,232 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:04,232 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:04,232 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_3 Supporting invariants [] [2018-11-10 12:38:04,302 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:04,304 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:04,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:04,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:04,345 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 12:38:04,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:04,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:04,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:38:04,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 12:38:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:04,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:04,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:04,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:04,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:04,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:04,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:04,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:04,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:04,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:04,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 12:38:04,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 12:38:04,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-10 12:38:04,622 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 116 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 155 states and 168 transitions. Complement of second has 16 states. [2018-11-10 12:38:04,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:38:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2018-11-10 12:38:04,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 15 letters. Loop has 18 letters. [2018-11-10 12:38:04,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:04,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 33 letters. Loop has 18 letters. [2018-11-10 12:38:04,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:04,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 50 transitions. Stem has 15 letters. Loop has 36 letters. [2018-11-10 12:38:04,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:04,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 168 transitions. [2018-11-10 12:38:04,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 12:38:04,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 135 states and 147 transitions. [2018-11-10 12:38:04,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 12:38:04,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 12:38:04,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 147 transitions. [2018-11-10 12:38:04,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:04,629 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-11-10 12:38:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 147 transitions. [2018-11-10 12:38:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2018-11-10 12:38:04,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-10 12:38:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2018-11-10 12:38:04,635 INFO L728 BuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2018-11-10 12:38:04,635 INFO L608 BuchiCegarLoop]: Abstraction has 129 states and 141 transitions. [2018-11-10 12:38:04,635 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:38:04,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions. [2018-11-10 12:38:04,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 12:38:04,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:04,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:04,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:04,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:04,637 INFO L793 eck$LassoCheckResult]: Stem: 1412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1367#L554-2 assume true; 1442#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1440#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1439#L551-3 assume main_#t~short7; 1437#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1435#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1433#L551-7 main_#t~short9 := main_#t~short7; 1431#L551-8 assume main_#t~short9; 1429#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 1427#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1425#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 1423#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 1421#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 1393#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 1394#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 1398#L558-2 havoc main_#t~mem15; 1386#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 1358#L559-1 havoc main_#t~nondet16; 1359#L554-2 assume true; 1474#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1473#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1471#L551-3 assume main_#t~short7; 1470#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1469#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1467#L551-7 main_#t~short9 := main_#t~short7; 1465#L551-8 assume main_#t~short9; 1463#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 1461#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1459#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 1451#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 1452#L553 [2018-11-10 12:38:04,637 INFO L795 eck$LassoCheckResult]: Loop: 1452#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 1447#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 1446#L553-2 havoc main_#t~mem11; 1445#L554-2 assume true; 1443#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 1441#L551-2 main_#t~short7 := main_#t~mem5 > 0; 1387#L551-3 assume main_#t~short7; 1388#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 1395#L551-5 main_#t~short7 := main_#t~mem6 > 0; 1399#L551-7 main_#t~short9 := main_#t~short7; 1406#L551-8 assume main_#t~short9; 1368#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 1369#L551-10 main_#t~short9 := main_#t~mem8 > 0; 1455#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 1453#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 1452#L553 [2018-11-10 12:38:04,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:04,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1622034747, now seen corresponding path program 1 times [2018-11-10 12:38:04,638 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:04,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:04,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:04,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:04,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash 280714288, now seen corresponding path program 2 times [2018-11-10 12:38:04,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:04,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:04,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash 750044396, now seen corresponding path program 1 times [2018-11-10 12:38:04,673 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:04,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:04,805 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-10 12:38:05,278 WARN L179 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 127 [2018-11-10 12:38:05,353 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:05,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:05,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:05,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:05,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:05,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:05,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:05,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:05,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 12:38:05,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:05,354 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:05,357 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 12:38:05,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 12:38:05,359 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 12:38:05,361 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 12:38:05,607 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 12:38:05,697 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 12:38:05,699 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 12:38:05,701 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 12:38:05,703 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 12:38:05,704 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 12:38:05,705 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 12:38:05,706 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 12:38:05,707 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 12:38:05,707 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 12:38:05,708 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 12:38:05,710 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 12:38:05,711 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 12:38:05,712 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 12:38:05,713 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 12:38:05,714 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 12:38:06,086 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:06,086 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:06,087 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 12:38:06,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:06,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:06,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:06,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,089 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 12:38:06,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:06,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:06,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:06,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:06,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:06,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:06,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:06,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:06,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:06,103 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,103 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 12:38:06,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:06,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:06,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,106 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 12:38:06,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:06,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:06,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,109 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 12:38:06,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,109 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:06,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,110 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:06,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:06,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:06,114 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 12:38:06,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:06,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:06,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:06,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:06,115 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:06,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:06,120 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:06,122 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:06,123 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:06,123 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:06,124 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:06,124 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:06,124 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-11-10 12:38:06,199 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:06,200 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:06,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:06,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:06,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:06,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:06,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:06,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:06,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:06,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:06,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:06,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 12:38:06,294 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 12:38:06,295 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:38:06,295 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-10 12:38:06,361 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 17. Second operand 7 states. Result 360 states and 389 transitions. Complement of second has 13 states. [2018-11-10 12:38:06,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:38:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-10 12:38:06,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 32 letters. Loop has 15 letters. [2018-11-10 12:38:06,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:06,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 47 letters. Loop has 15 letters. [2018-11-10 12:38:06,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:06,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 32 letters. Loop has 30 letters. [2018-11-10 12:38:06,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:06,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 389 transitions. [2018-11-10 12:38:06,379 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-11-10 12:38:06,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 298 states and 322 transitions. [2018-11-10 12:38:06,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2018-11-10 12:38:06,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2018-11-10 12:38:06,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 322 transitions. [2018-11-10 12:38:06,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:06,382 INFO L705 BuchiCegarLoop]: Abstraction has 298 states and 322 transitions. [2018-11-10 12:38:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 322 transitions. [2018-11-10 12:38:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 274. [2018-11-10 12:38:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 12:38:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 297 transitions. [2018-11-10 12:38:06,395 INFO L728 BuchiCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-11-10 12:38:06,396 INFO L608 BuchiCegarLoop]: Abstraction has 274 states and 297 transitions. [2018-11-10 12:38:06,396 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:38:06,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 297 transitions. [2018-11-10 12:38:06,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2018-11-10 12:38:06,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:06,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:06,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:06,401 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 12:38:06,401 INFO L793 eck$LassoCheckResult]: Stem: 2193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2132#L554-2 assume true; 2270#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 2267#L551-2 main_#t~short7 := main_#t~mem5 > 0; 2265#L551-3 assume main_#t~short7; 2263#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 2261#L551-5 main_#t~short7 := main_#t~mem6 > 0; 2259#L551-7 main_#t~short9 := main_#t~short7; 2257#L551-8 assume main_#t~short9; 2255#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 2253#L551-10 main_#t~short9 := main_#t~mem8 > 0; 2251#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 2249#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 2246#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 2247#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 2127#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 2130#L555-2 havoc main_#t~mem13; 2173#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 2174#L556-1 havoc main_#t~nondet14; 2293#L554-2 assume true; 2291#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 2289#L551-2 main_#t~short7 := main_#t~mem5 > 0; 2287#L551-3 assume main_#t~short7; 2285#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 2283#L551-5 main_#t~short7 := main_#t~mem6 > 0; 2281#L551-7 main_#t~short9 := main_#t~short7; 2279#L551-8 assume main_#t~short9; 2276#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 2242#L551-10 main_#t~short9 := main_#t~mem8 > 0; 2243#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 2225#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 2181#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 2158#L558 [2018-11-10 12:38:06,401 INFO L795 eck$LassoCheckResult]: Loop: 2158#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 2159#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 2164#L558-2 havoc main_#t~mem15; 2150#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 2151#L559-1 havoc main_#t~nondet16; 2292#L554-2 assume true; 2290#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 2288#L551-2 main_#t~short7 := main_#t~mem5 > 0; 2286#L551-3 assume main_#t~short7; 2284#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 2282#L551-5 main_#t~short7 := main_#t~mem6 > 0; 2280#L551-7 main_#t~short9 := main_#t~short7; 2278#L551-8 assume main_#t~short9; 2274#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 2275#L551-10 main_#t~short9 := main_#t~mem8 > 0; 2237#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 2238#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 2299#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 2158#L558 [2018-11-10 12:38:06,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:06,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1233959239, now seen corresponding path program 1 times [2018-11-10 12:38:06,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:06,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:06,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:06,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash -335396788, now seen corresponding path program 2 times [2018-11-10 12:38:06,424 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:06,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:06,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:06,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:06,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash -943098862, now seen corresponding path program 1 times [2018-11-10 12:38:06,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:06,595 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2018-11-10 12:38:06,990 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 132 [2018-11-10 12:38:07,069 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:07,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:07,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:07,069 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:07,070 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:07,070 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:07,070 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:07,070 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:07,070 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-10 12:38:07,070 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:07,070 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:07,072 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 12:38:07,073 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 12:38:07,074 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 12:38:07,076 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 12:38:07,309 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-10 12:38:07,396 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 12:38:07,397 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 12:38:07,399 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 12:38:07,400 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 12:38:07,402 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 12:38:07,403 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 12:38:07,404 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 12:38:07,405 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 12:38:07,406 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 12:38:07,408 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 12:38:07,409 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 12:38:07,410 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 12:38:07,411 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 12:38:07,412 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 12:38:07,414 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 12:38:07,792 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:07,792 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:07,793 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 12:38:07,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:07,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,794 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:07,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:07,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,795 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 12:38:07,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:07,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:07,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:07,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,797 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 12:38:07,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:07,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:07,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:07,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,799 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 12:38:07,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:07,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:07,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:07,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,801 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 12:38:07,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:07,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:07,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,804 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 12:38:07,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:07,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:07,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,808 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 12:38:07,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:07,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:07,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:07,813 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 12:38:07,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:07,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:07,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:07,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:07,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:07,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:07,818 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:07,821 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:07,821 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:07,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:07,822 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:07,822 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:07,822 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_5 Supporting invariants [] [2018-11-10 12:38:07,914 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:07,915 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:07,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:07,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:07,958 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:07,959 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 12:38:07,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:07,975 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:07,975 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 12:38:07,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:07,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:07,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:07,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 12:38:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:07,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:08,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:08,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:08,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:08,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:08,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:08,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:08,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:08,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:08,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:08,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:08,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:08,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:08,121 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 12:38:08,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 12:38:08,121 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 297 transitions. cyclomatic complexity: 34 Second operand 8 states. [2018-11-10 12:38:08,223 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 297 transitions. cyclomatic complexity: 34. Second operand 8 states. Result 645 states and 698 transitions. Complement of second has 14 states. [2018-11-10 12:38:08,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:38:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2018-11-10 12:38:08,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 33 letters. Loop has 18 letters. [2018-11-10 12:38:08,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:08,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 51 letters. Loop has 18 letters. [2018-11-10 12:38:08,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:08,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 33 letters. Loop has 36 letters. [2018-11-10 12:38:08,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:08,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 645 states and 698 transitions. [2018-11-10 12:38:08,231 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 100 [2018-11-10 12:38:08,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 645 states to 490 states and 530 transitions. [2018-11-10 12:38:08,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2018-11-10 12:38:08,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-11-10 12:38:08,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 490 states and 530 transitions. [2018-11-10 12:38:08,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:08,234 INFO L705 BuchiCegarLoop]: Abstraction has 490 states and 530 transitions. [2018-11-10 12:38:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states and 530 transitions. [2018-11-10 12:38:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 478. [2018-11-10 12:38:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-11-10 12:38:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 518 transitions. [2018-11-10 12:38:08,251 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 518 transitions. [2018-11-10 12:38:08,251 INFO L608 BuchiCegarLoop]: Abstraction has 478 states and 518 transitions. [2018-11-10 12:38:08,251 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:38:08,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 478 states and 518 transitions. [2018-11-10 12:38:08,253 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 100 [2018-11-10 12:38:08,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:08,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:08,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:08,258 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 12:38:08,259 INFO L793 eck$LassoCheckResult]: Stem: 3397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3344#L554-2 assume true; 3475#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3474#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3473#L551-3 assume main_#t~short7; 3472#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3471#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3470#L551-7 main_#t~short9 := main_#t~short7; 3469#L551-8 assume main_#t~short9; 3468#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3467#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3465#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 3463#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3461#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 3459#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 3457#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 3455#L555-2 havoc main_#t~mem13; 3453#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 3451#L556-1 havoc main_#t~nondet14; 3449#L554-2 assume true; 3447#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3445#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3443#L551-3 assume main_#t~short7; 3441#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3439#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3437#L551-7 main_#t~short9 := main_#t~short7; 3435#L551-8 assume main_#t~short9; 3432#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3430#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3428#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 3425#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 3426#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 3757#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 3756#L553-2 havoc main_#t~mem11; 3755#L554-2 assume true; 3754#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3753#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3752#L551-3 assume main_#t~short7; 3751#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3750#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3749#L551-7 main_#t~short9 := main_#t~short7; 3748#L551-8 assume main_#t~short9; 3747#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3746#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3745#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 3409#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3410#L554 [2018-11-10 12:38:08,259 INFO L795 eck$LassoCheckResult]: Loop: 3410#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 3796#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 3795#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 3794#L555-2 havoc main_#t~mem13; 3793#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 3792#L556-1 havoc main_#t~nondet14; 3790#L554-2 assume true; 3789#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 3788#L551-2 main_#t~short7 := main_#t~mem5 > 0; 3787#L551-3 assume main_#t~short7; 3371#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 3372#L551-5 main_#t~short7 := main_#t~mem6 > 0; 3803#L551-7 main_#t~short9 := main_#t~short7; 3802#L551-8 assume main_#t~short9; 3801#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 3800#L551-10 main_#t~short9 := main_#t~mem8 > 0; 3799#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 3798#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 3410#L554 [2018-11-10 12:38:08,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1266662511, now seen corresponding path program 1 times [2018-11-10 12:38:08,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:08,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:08,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash 884452726, now seen corresponding path program 2 times [2018-11-10 12:38:08,278 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:08,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:08,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash 279194886, now seen corresponding path program 2 times [2018-11-10 12:38:08,289 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:08,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:08,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:08,446 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-10 12:38:08,994 WARN L179 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 153 [2018-11-10 12:38:09,100 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:09,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:09,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:09,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:09,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:09,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:09,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:09,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:09,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-10 12:38:09,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:09,101 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:09,104 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 12:38:09,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,400 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 98 [2018-11-10 12:38:09,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:09,519 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 12:38:09,727 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2018-11-10 12:38:09,948 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:09,948 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:09,948 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 12:38:09,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:09,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:09,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:09,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,950 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 12:38:09,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:09,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,952 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 12:38:09,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:09,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:09,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:09,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:09,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:09,956 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:09,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:09,961 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,962 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 12:38:09,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:09,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:09,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:09,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:09,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:09,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,970 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:09,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:09,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:38:09,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:09,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:09,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:09,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:09,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:09,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:09,979 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:09,980 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:09,980 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:09,981 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:09,981 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:09,981 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:09,982 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-10 12:38:10,094 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:10,096 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:10,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:10,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:10,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:10,143 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 12:38:10,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:38:10,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 12:38:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:10,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:10,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:10,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:10,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:10,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:10,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:10,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:10,325 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 12:38:10,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 12:38:10,326 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60 Second operand 10 states. [2018-11-10 12:38:10,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60. Second operand 10 states. Result 560 states and 602 transitions. Complement of second has 16 states. [2018-11-10 12:38:10,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 12:38:10,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-10 12:38:10,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 47 letters. Loop has 18 letters. [2018-11-10 12:38:10,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:10,515 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:10,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:10,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:10,562 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 12:38:10,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:38:10,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 12:38:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:10,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:10,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:10,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:10,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:10,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:10,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:10,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:10,737 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 12:38:10,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 12:38:10,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60 Second operand 10 states. [2018-11-10 12:38:10,930 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60. Second operand 10 states. Result 558 states and 600 transitions. Complement of second has 20 states. [2018-11-10 12:38:10,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 12:38:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2018-11-10 12:38:10,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 42 transitions. Stem has 47 letters. Loop has 18 letters. [2018-11-10 12:38:10,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:10,931 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:10,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:10,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:10,964 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 12:38:10,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:10,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:38:10,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:10,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 12:38:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:10,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:11,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:11,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:11,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:11,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:11,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:11,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:11,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:11,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:11,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:11,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:11,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:11,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:11,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:11,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:11,140 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 12:38:11,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60 Second operand 10 states. [2018-11-10 12:38:11,290 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 478 states and 518 transitions. cyclomatic complexity: 60. Second operand 10 states. Result 713 states and 777 transitions. Complement of second has 17 states. [2018-11-10 12:38:11,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 12:38:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-10 12:38:11,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 47 letters. Loop has 18 letters. [2018-11-10 12:38:11,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:11,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 65 letters. Loop has 18 letters. [2018-11-10 12:38:11,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:11,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 47 letters. Loop has 36 letters. [2018-11-10 12:38:11,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:11,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 777 transitions. [2018-11-10 12:38:11,304 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 154 [2018-11-10 12:38:11,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 538 states and 584 transitions. [2018-11-10 12:38:11,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2018-11-10 12:38:11,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 181 [2018-11-10 12:38:11,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 538 states and 584 transitions. [2018-11-10 12:38:11,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:11,308 INFO L705 BuchiCegarLoop]: Abstraction has 538 states and 584 transitions. [2018-11-10 12:38:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states and 584 transitions. [2018-11-10 12:38:11,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 355. [2018-11-10 12:38:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-11-10 12:38:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 387 transitions. [2018-11-10 12:38:11,315 INFO L728 BuchiCegarLoop]: Abstraction has 355 states and 387 transitions. [2018-11-10 12:38:11,315 INFO L608 BuchiCegarLoop]: Abstraction has 355 states and 387 transitions. [2018-11-10 12:38:11,315 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:38:11,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 355 states and 387 transitions. [2018-11-10 12:38:11,317 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 135 [2018-11-10 12:38:11,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:11,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:11,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:11,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:11,318 INFO L793 eck$LassoCheckResult]: Stem: 6512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 6453#L554-2 assume true; 6650#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6701#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6700#L551-3 assume main_#t~short7; 6699#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6698#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6697#L551-7 main_#t~short9 := main_#t~short7; 6696#L551-8 assume main_#t~short9; 6695#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6694#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6693#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 6692#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 6691#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 6690#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 6688#L553-2 havoc main_#t~mem11; 6458#L554-2 assume true; 6459#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6521#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6522#L551-3 assume main_#t~short7; 6485#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6486#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6493#L551-7 main_#t~short9 := main_#t~short7; 6503#L551-8 assume main_#t~short9; 6755#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6746#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6470#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 6462#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 6463#L554 [2018-11-10 12:38:11,319 INFO L795 eck$LassoCheckResult]: Loop: 6463#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 6745#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 6744#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 6743#L555-2 havoc main_#t~mem13; 6742#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 6741#L556-1 havoc main_#t~nondet14; 6740#L554-2 assume true; 6739#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6738#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6737#L551-3 assume main_#t~short7; 6736#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6735#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6734#L551-7 main_#t~short9 := main_#t~short7; 6733#L551-8 assume main_#t~short9; 6722#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6721#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6687#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 6532#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 6533#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 6684#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 6516#L553-2 havoc main_#t~mem11; 6517#L554-2 assume true; 6732#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 6731#L551-2 main_#t~short7 := main_#t~mem5 > 0; 6730#L551-3 assume main_#t~short7; 6729#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 6728#L551-5 main_#t~short7 := main_#t~mem6 > 0; 6727#L551-7 main_#t~short9 := main_#t~short7; 6726#L551-8 assume main_#t~short9; 6724#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 6725#L551-10 main_#t~short9 := main_#t~mem8 > 0; 6768#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 6767#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 6463#L554 [2018-11-10 12:38:11,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash 8160422, now seen corresponding path program 1 times [2018-11-10 12:38:11,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:11,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:11,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:11,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:11,335 INFO L82 PathProgramCache]: Analyzing trace with hash 971317445, now seen corresponding path program 1 times [2018-11-10 12:38:11,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:11,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:11,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:11,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:11,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash -8223552, now seen corresponding path program 3 times [2018-11-10 12:38:11,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:11,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:11,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:11,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:11,588 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 97 [2018-11-10 12:38:11,969 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 118 [2018-11-10 12:38:12,039 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:12,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:12,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:12,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:12,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:12,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:12,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:12,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:12,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-10 12:38:12,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:12,040 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:12,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,047 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 12:38:12,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,051 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 12:38:12,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,055 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 12:38:12,057 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 12:38:12,058 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 12:38:12,059 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 12:38:12,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:12,292 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2018-11-10 12:38:12,416 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 79 [2018-11-10 12:38:12,416 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 12:38:12,418 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 12:38:12,419 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 12:38:12,420 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 12:38:12,801 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:12,801 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:12,801 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 12:38:12,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,803 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 12:38:12,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,803 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,804 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 12:38:12,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,805 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 12:38:12,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,806 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 12:38:12,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,806 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:38:12,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:38:12,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,807 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 12:38:12,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,809 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 12:38:12,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,810 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 12:38:12,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,811 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 12:38:12,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:38:12,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:38:12,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,814 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 12:38:12,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,816 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 12:38:12,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,818 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 12:38:12,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,820 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 12:38:12,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,822 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 12:38:12,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,824 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 12:38:12,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:12,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:12,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:12,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,826 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 12:38:12,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,831 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 12:38:12,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,831 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:12,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,832 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:12,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,835 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 12:38:12,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,835 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:12,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:12,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,839 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 12:38:12,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:12,845 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 12:38:12,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:12,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:12,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:12,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:12,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:12,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:12,849 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:12,852 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:38:12,853 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 12:38:12,853 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:12,853 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:12,854 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:12,854 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2018-11-10 12:38:13,000 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:13,002 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:13,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:13,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:13,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 12:38:13,055 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,057 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:38:13,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 12:38:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:13,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:13,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:13,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:13,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:13,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:13,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:13,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:13,221 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2018-11-10 12:38:13,233 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 44 treesize of output 39 [2018-11-10 12:38:13,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-10 12:38:13,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-10 12:38:13,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:38:13,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:38:13,316 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2018-11-10 12:38:13,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:13,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 12:38:13,342 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45 Second operand 12 states. [2018-11-10 12:38:13,493 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45. Second operand 12 states. Result 461 states and 499 transitions. Complement of second has 16 states. [2018-11-10 12:38:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:38:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-10 12:38:13,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 29 letters. Loop has 33 letters. [2018-11-10 12:38:13,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:13,503 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:13,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:13,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:13,535 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-10 12:38:13,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 12:38:13,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-10 12:38:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:13,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:13,591 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:13,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:13,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:13,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:13,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:13,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:13,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2018-11-10 12:38:13,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-11-10 12:38:13,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 12:38:13,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:13,826 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 36 treesize of output 39 [2018-11-10 12:38:13,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:13,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 12:38:13,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 12:38:13,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:39 [2018-11-10 12:38:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:13,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-10 12:38:13,897 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45 Second operand 12 states. [2018-11-10 12:38:14,299 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 355 states and 387 transitions. cyclomatic complexity: 45. Second operand 12 states. Result 465 states and 505 transitions. Complement of second has 30 states. [2018-11-10 12:38:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 12:38:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 52 transitions. [2018-11-10 12:38:14,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 52 transitions. Stem has 29 letters. Loop has 33 letters. [2018-11-10 12:38:14,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:14,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 52 transitions. Stem has 62 letters. Loop has 33 letters. [2018-11-10 12:38:14,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:14,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 52 transitions. Stem has 29 letters. Loop has 66 letters. [2018-11-10 12:38:14,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:14,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 505 transitions. [2018-11-10 12:38:14,303 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2018-11-10 12:38:14,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 407 states and 443 transitions. [2018-11-10 12:38:14,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-11-10 12:38:14,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-10 12:38:14,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 407 states and 443 transitions. [2018-11-10 12:38:14,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:14,305 INFO L705 BuchiCegarLoop]: Abstraction has 407 states and 443 transitions. [2018-11-10 12:38:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states and 443 transitions. [2018-11-10 12:38:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 380. [2018-11-10 12:38:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-10 12:38:14,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 416 transitions. [2018-11-10 12:38:14,312 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 416 transitions. [2018-11-10 12:38:14,312 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 416 transitions. [2018-11-10 12:38:14,312 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 12:38:14,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 416 transitions. [2018-11-10 12:38:14,313 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2018-11-10 12:38:14,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:14,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:14,314 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:14,314 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:14,314 INFO L793 eck$LassoCheckResult]: Stem: 8377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8316#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 8317#L554-2 assume true; 8412#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 8411#L551-2 main_#t~short7 := main_#t~mem5 > 0; 8410#L551-3 assume main_#t~short7; 8409#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 8408#L551-5 main_#t~short7 := main_#t~mem6 > 0; 8407#L551-7 main_#t~short9 := main_#t~short7; 8406#L551-8 assume main_#t~short9; 8405#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 8404#L551-10 main_#t~short9 := main_#t~mem8 > 0; 8403#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 8402#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 8401#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 8400#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 8398#L553-2 havoc main_#t~mem11; 8397#L554-2 assume true; 8396#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 8395#L551-2 main_#t~short7 := main_#t~mem5 > 0; 8394#L551-3 assume main_#t~short7; 8393#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 8392#L551-5 main_#t~short7 := main_#t~mem6 > 0; 8391#L551-7 main_#t~short9 := main_#t~short7; 8390#L551-8 assume main_#t~short9; 8389#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 8388#L551-10 main_#t~short9 := main_#t~mem8 > 0; 8387#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 8386#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 8385#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 8309#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 8310#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 8313#L555-2 havoc main_#t~mem13; 8359#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 8360#L556-1 havoc main_#t~nondet14; 8322#L554-2 [2018-11-10 12:38:14,314 INFO L795 eck$LassoCheckResult]: Loop: 8322#L554-2 assume true; 8323#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 8382#L551-2 main_#t~short7 := main_#t~mem5 > 0; 8339#L551-3 assume main_#t~short7; 8340#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 8347#L551-5 main_#t~short7 := main_#t~mem6 > 0; 8353#L551-7 main_#t~short9 := main_#t~short7; 8365#L551-8 assume main_#t~short9; 8318#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 8319#L551-10 main_#t~short9 := main_#t~mem8 > 0; 8330#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 8326#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 8327#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 8378#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 8379#L553-2 havoc main_#t~mem11; 8322#L554-2 [2018-11-10 12:38:14,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:14,315 INFO L82 PathProgramCache]: Analyzing trace with hash 24255465, now seen corresponding path program 4 times [2018-11-10 12:38:14,315 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:14,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:14,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:14,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:14,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:14,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1565181494, now seen corresponding path program 3 times [2018-11-10 12:38:14,332 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:14,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:14,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:14,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash -667919026, now seen corresponding path program 5 times [2018-11-10 12:38:14,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:14,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:14,505 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-11-10 12:38:14,925 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 134 [2018-11-10 12:38:15,064 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-10 12:38:15,067 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:15,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:15,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:15,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:15,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:15,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:15,068 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:15,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:15,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-10 12:38:15,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:15,068 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:15,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,075 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 12:38:15,076 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 12:38:15,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,089 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 12:38:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,094 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 12:38:15,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,099 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 12:38:15,397 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-10 12:38:15,478 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 12:38:15,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:15,865 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:15,865 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:15,865 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 12:38:15,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,866 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,866 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 12:38:15,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,867 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 12:38:15,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,868 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 12:38:15,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,871 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 12:38:15,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,873 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 12:38:15,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,874 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 12:38:15,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,876 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 12:38:15,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,877 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 12:38:15,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,879 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 12:38:15,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,881 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 12:38:15,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,882 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,882 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 12:38:15,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:15,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,884 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,884 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 12:38:15,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:15,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,885 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 12:38:15,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 12:38:15,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:15,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,886 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 12:38:15,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,888 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 12:38:15,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,891 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 12:38:15,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,894 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 12:38:15,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,899 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,899 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 12:38:15,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,905 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 12:38:15,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,905 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:15,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,906 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:15,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,908 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 12:38:15,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,923 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 12:38:15,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,925 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 12:38:15,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,929 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 12:38:15,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,933 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 12:38:15,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:15,937 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 12:38:15,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:15,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:15,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:15,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:15,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:15,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:15,941 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:15,943 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:15,943 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:15,943 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:15,944 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:15,944 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:15,944 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_8 Supporting invariants [] [2018-11-10 12:38:16,076 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:16,077 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:16,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:16,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:16,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:16,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:16,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-11-10 12:38:16,165 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 34 treesize of output 25 [2018-11-10 12:38:16,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:16,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:16,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:16,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 12:38:16,186 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 12:38:16,186 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:38:16,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 380 states and 416 transitions. cyclomatic complexity: 50 Second operand 8 states. [2018-11-10 12:38:16,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 380 states and 416 transitions. cyclomatic complexity: 50. Second operand 8 states. Result 850 states and 920 transitions. Complement of second has 15 states. [2018-11-10 12:38:16,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:38:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2018-11-10 12:38:16,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 35 letters. Loop has 15 letters. [2018-11-10 12:38:16,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:16,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 50 letters. Loop has 15 letters. [2018-11-10 12:38:16,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:16,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 51 transitions. Stem has 35 letters. Loop has 30 letters. [2018-11-10 12:38:16,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:16,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 850 states and 920 transitions. [2018-11-10 12:38:16,255 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 128 [2018-11-10 12:38:16,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 850 states to 735 states and 793 transitions. [2018-11-10 12:38:16,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2018-11-10 12:38:16,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2018-11-10 12:38:16,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 793 transitions. [2018-11-10 12:38:16,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:16,257 INFO L705 BuchiCegarLoop]: Abstraction has 735 states and 793 transitions. [2018-11-10 12:38:16,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 793 transitions. [2018-11-10 12:38:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 588. [2018-11-10 12:38:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-10 12:38:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 640 transitions. [2018-11-10 12:38:16,266 INFO L728 BuchiCegarLoop]: Abstraction has 588 states and 640 transitions. [2018-11-10 12:38:16,266 INFO L608 BuchiCegarLoop]: Abstraction has 588 states and 640 transitions. [2018-11-10 12:38:16,266 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 12:38:16,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 588 states and 640 transitions. [2018-11-10 12:38:16,268 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 128 [2018-11-10 12:38:16,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:16,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:16,269 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:16,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:16,269 INFO L793 eck$LassoCheckResult]: Stem: 9887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9834#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 9835#L554-2 assume true; 9936#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10053#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10052#L551-3 assume main_#t~short7; 10051#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10050#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10049#L551-7 main_#t~short9 := main_#t~short7; 10048#L551-8 assume main_#t~short9; 10047#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10046#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10045#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 10044#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 10043#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 10042#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 10040#L553-2 havoc main_#t~mem11; 10039#L554-2 assume true; 10038#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10037#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10036#L551-3 assume main_#t~short7; 10035#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10034#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10033#L551-7 main_#t~short9 := main_#t~short7; 10032#L551-8 assume main_#t~short9; 10031#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10030#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10029#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 10028#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 10024#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 10025#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 9867#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 9868#L558-2 havoc main_#t~mem15; 9873#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 9825#L559-1 havoc main_#t~nondet16; 9826#L554-2 assume true; 10167#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10163#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10159#L551-3 assume main_#t~short7; 10130#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10131#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10125#L551-7 main_#t~short9 := main_#t~short7; 10126#L551-8 assume main_#t~short9; 10119#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10120#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10020#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 10021#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 10136#L553 [2018-11-10 12:38:16,269 INFO L795 eck$LassoCheckResult]: Loop: 10136#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 10174#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 10172#L553-2 havoc main_#t~mem11; 10169#L554-2 assume true; 10165#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 10161#L551-2 main_#t~short7 := main_#t~mem5 > 0; 10156#L551-3 assume main_#t~short7; 10153#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 10150#L551-5 main_#t~short7 := main_#t~mem6 > 0; 10148#L551-7 main_#t~short9 := main_#t~short7; 10146#L551-8 assume main_#t~short9; 10144#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 10142#L551-10 main_#t~short9 := main_#t~mem8 > 0; 10140#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 10135#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 10136#L553 [2018-11-10 12:38:16,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:16,270 INFO L82 PathProgramCache]: Analyzing trace with hash -558817930, now seen corresponding path program 2 times [2018-11-10 12:38:16,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:16,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:16,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:16,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:16,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash 280714288, now seen corresponding path program 4 times [2018-11-10 12:38:16,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:16,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:16,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:16,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:16,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2008483355, now seen corresponding path program 3 times [2018-11-10 12:38:16,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:16,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:16,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:16,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:16,419 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2018-11-10 12:38:16,975 WARN L179 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 156 [2018-11-10 12:38:17,076 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:17,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:17,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:17,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:17,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:17,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:17,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:17,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:17,076 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration11_Lasso [2018-11-10 12:38:17,076 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:17,076 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:17,078 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 12:38:17,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:17,082 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 12:38:17,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:17,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:17,086 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 12:38:17,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:17,089 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 12:38:17,090 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 12:38:17,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:17,093 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 12:38:17,322 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2018-11-10 12:38:17,406 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 12:38:17,407 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 12:38:17,408 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 12:38:17,409 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 12:38:17,410 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 12:38:17,411 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 12:38:17,412 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 12:38:17,414 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 12:38:17,415 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 12:38:17,793 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:17,793 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:17,794 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 12:38:17,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:17,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:17,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:17,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,796 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 12:38:17,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:17,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:17,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:17,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,797 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 12:38:17,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,800 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 12:38:17,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,802 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 12:38:17,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:17,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:17,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:17,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,804 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 12:38:17,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:17,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:17,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:17,805 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,805 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 12:38:17,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,808 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 12:38:17,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:17,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:17,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:17,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,809 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 12:38:17,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:17,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:17,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:17,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,811 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 12:38:17,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,813 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 12:38:17,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,816 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,820 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 12:38:17,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,827 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 12:38:17,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,831 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 12:38:17,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,832 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:17,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,833 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:17,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,836 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 12:38:17,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,837 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:17,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,838 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:17,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,841 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 12:38:17,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,850 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 12:38:17,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,866 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 12:38:17,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,868 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 12:38:17,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,869 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:17,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,870 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:17,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:17,873 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 12:38:17,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:17,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:17,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:17,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:17,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:17,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:17,877 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:17,880 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:17,880 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:17,880 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:17,881 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:17,881 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:17,881 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_9 Supporting invariants [] [2018-11-10 12:38:18,054 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:18,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:18,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:18,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:18,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:18,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:18,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:18,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:18,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 12:38:18,205 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 12:38:18,206 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:38:18,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-11-10 12:38:18,290 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72. Second operand 7 states. Result 919 states and 989 transitions. Complement of second has 13 states. [2018-11-10 12:38:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:38:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2018-11-10 12:38:18,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 47 letters. Loop has 15 letters. [2018-11-10 12:38:18,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:18,292 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:18,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:18,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:18,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:18,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:18,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:18,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:18,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 12:38:18,442 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 12:38:18,442 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:38:18,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-11-10 12:38:18,523 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72. Second operand 7 states. Result 913 states and 976 transitions. Complement of second has 15 states. [2018-11-10 12:38:18,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:38:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2018-11-10 12:38:18,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 47 transitions. Stem has 47 letters. Loop has 15 letters. [2018-11-10 12:38:18,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:18,527 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:18,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:18,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:18,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:18,595 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:18,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:18,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:18,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:18,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 12:38:18,668 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 12:38:18,669 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:38:18,669 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72 Second operand 7 states. [2018-11-10 12:38:18,748 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 588 states and 640 transitions. cyclomatic complexity: 72. Second operand 7 states. Result 984 states and 1064 transitions. Complement of second has 14 states. [2018-11-10 12:38:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:38:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-10 12:38:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 47 letters. Loop has 15 letters. [2018-11-10 12:38:18,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 62 letters. Loop has 15 letters. [2018-11-10 12:38:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 52 transitions. Stem has 47 letters. Loop has 30 letters. [2018-11-10 12:38:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:18,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 984 states and 1064 transitions. [2018-11-10 12:38:18,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2018-11-10 12:38:18,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 984 states to 679 states and 731 transitions. [2018-11-10 12:38:18,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2018-11-10 12:38:18,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2018-11-10 12:38:18,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 679 states and 731 transitions. [2018-11-10 12:38:18,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:18,758 INFO L705 BuchiCegarLoop]: Abstraction has 679 states and 731 transitions. [2018-11-10 12:38:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 731 transitions. [2018-11-10 12:38:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 414. [2018-11-10 12:38:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-11-10 12:38:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 450 transitions. [2018-11-10 12:38:18,765 INFO L728 BuchiCegarLoop]: Abstraction has 414 states and 450 transitions. [2018-11-10 12:38:18,765 INFO L608 BuchiCegarLoop]: Abstraction has 414 states and 450 transitions. [2018-11-10 12:38:18,765 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 12:38:18,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 414 states and 450 transitions. [2018-11-10 12:38:18,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-10 12:38:18,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:18,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:18,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:18,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:18,767 INFO L793 eck$LassoCheckResult]: Stem: 14028#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 13978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 13979#L554-2 assume true; 14107#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14105#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14103#L551-3 assume main_#t~short7; 14101#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14099#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14097#L551-7 main_#t~short9 := main_#t~short7; 14095#L551-8 assume main_#t~short9; 14094#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14092#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14090#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 14088#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14085#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14005#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 14006#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 14012#L558-2 havoc main_#t~mem15; 13997#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 13998#L559-1 havoc main_#t~nondet16; 14055#L554-2 assume true; 14054#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14053#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14052#L551-3 assume main_#t~short7; 14051#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14050#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14049#L551-7 main_#t~short9 := main_#t~short7; 14048#L551-8 assume main_#t~short9; 14047#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14046#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14044#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 14045#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14157#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 14155#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 14153#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 14152#L555-2 havoc main_#t~mem13; 14151#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 14150#L556-1 havoc main_#t~nondet14; 14147#L554-2 assume true; 14148#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14202#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14200#L551-3 assume main_#t~short7; 14197#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14195#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14193#L551-7 main_#t~short9 := main_#t~short7; 14183#L551-8 assume main_#t~short9; 14180#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14181#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14198#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 14161#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14037#L554 [2018-11-10 12:38:18,767 INFO L795 eck$LassoCheckResult]: Loop: 14037#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 14003#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 14004#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 14011#L558-2 havoc main_#t~mem15; 13996#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 13970#L559-1 havoc main_#t~nondet16; 13971#L554-2 assume true; 14140#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14138#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14136#L551-3 assume main_#t~short7; 14134#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14132#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14130#L551-7 main_#t~short9 := main_#t~short7; 14128#L551-8 assume main_#t~short9; 14124#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14121#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14122#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 14041#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14043#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 14154#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 14146#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 14145#L555-2 havoc main_#t~mem13; 14144#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 14143#L556-1 havoc main_#t~nondet14; 14142#L554-2 assume true; 14141#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 14139#L551-2 main_#t~short7 := main_#t~mem5 > 0; 14137#L551-3 assume main_#t~short7; 14135#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 14133#L551-5 main_#t~short7 := main_#t~mem6 > 0; 14131#L551-7 main_#t~short9 := main_#t~short7; 14129#L551-8 assume main_#t~short9; 14125#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 14126#L551-10 main_#t~short9 := main_#t~mem8 > 0; 14117#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 14118#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 14037#L554 [2018-11-10 12:38:18,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:18,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1643207681, now seen corresponding path program 2 times [2018-11-10 12:38:18,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:18,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:18,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash -759674293, now seen corresponding path program 1 times [2018-11-10 12:38:18,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:18,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:18,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:18,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1576355657, now seen corresponding path program 3 times [2018-11-10 12:38:18,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:18,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:18,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:19,227 WARN L179 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 105 [2018-11-10 12:38:20,011 WARN L179 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 161 [2018-11-10 12:38:20,132 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-11-10 12:38:20,135 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:20,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:20,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:20,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:20,135 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:20,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:20,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:20,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:20,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration12_Lasso [2018-11-10 12:38:20,135 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:20,135 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:20,137 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 12:38:20,139 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 12:38:20,140 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 12:38:20,141 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 12:38:20,143 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 12:38:20,144 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 12:38:20,145 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 12:38:20,146 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 12:38:20,147 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 12:38:20,148 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 12:38:20,150 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 12:38:20,151 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 12:38:20,152 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 12:38:20,406 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2018-11-10 12:38:20,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:20,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:20,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:20,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:20,890 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:20,890 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:20,890 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 12:38:20,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,891 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 12:38:20,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,893 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 12:38:20,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,894 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 12:38:20,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,895 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 12:38:20,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,897 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 12:38:20,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,898 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 12:38:20,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,900 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 12:38:20,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,901 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,901 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 12:38:20,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,903 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 12:38:20,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,905 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,905 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 12:38:20,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:20,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:20,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:20,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,907 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 12:38:20,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,909 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 12:38:20,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,909 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:20,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,910 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:20,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,913 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 12:38:20,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,913 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:20,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,914 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:20,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,917 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 12:38:20,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,922 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 12:38:20,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,923 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:20,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,923 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:20,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,926 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 12:38:20,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:20,930 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 12:38:20,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:20,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:20,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:20,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:20,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:20,931 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:20,935 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:20,938 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:38:20,938 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 12:38:20,938 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:20,939 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:20,939 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:20,939 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 Supporting invariants [] [2018-11-10 12:38:21,082 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:21,085 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:21,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:21,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:21,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:21,124 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 12:38:21,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:21,135 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:21,136 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 12:38:21,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 12:38:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:21,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:21,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:21,168 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 12:38:21,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-10 12:38:21,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 12:38:21,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:21,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-11-10 12:38:21,211 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:21,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:21,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:21,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-10 12:38:21,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:21,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:21,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:21,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-11-10 12:38:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 12:38:21,319 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 12:38:21,319 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 414 states and 450 transitions. cyclomatic complexity: 47 Second operand 10 states. [2018-11-10 12:38:21,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 414 states and 450 transitions. cyclomatic complexity: 47. Second operand 10 states. Result 796 states and 868 transitions. Complement of second has 15 states. [2018-11-10 12:38:21,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 12:38:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2018-11-10 12:38:21,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 50 letters. Loop has 36 letters. [2018-11-10 12:38:21,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:21,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 86 letters. Loop has 36 letters. [2018-11-10 12:38:21,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:21,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 57 transitions. Stem has 50 letters. Loop has 72 letters. [2018-11-10 12:38:21,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:21,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 868 transitions. [2018-11-10 12:38:21,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-10 12:38:21,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 491 states and 534 transitions. [2018-11-10 12:38:21,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2018-11-10 12:38:21,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2018-11-10 12:38:21,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 491 states and 534 transitions. [2018-11-10 12:38:21,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:38:21,485 INFO L705 BuchiCegarLoop]: Abstraction has 491 states and 534 transitions. [2018-11-10 12:38:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states and 534 transitions. [2018-11-10 12:38:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 399. [2018-11-10 12:38:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-10 12:38:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 433 transitions. [2018-11-10 12:38:21,495 INFO L728 BuchiCegarLoop]: Abstraction has 399 states and 433 transitions. [2018-11-10 12:38:21,495 INFO L608 BuchiCegarLoop]: Abstraction has 399 states and 433 transitions. [2018-11-10 12:38:21,495 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 12:38:21,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 433 transitions. [2018-11-10 12:38:21,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-10 12:38:21,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:38:21,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:38:21,497 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:21,497 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:38:21,497 INFO L793 eck$LassoCheckResult]: Stem: 15636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15591#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 15592#L554-2 assume true; 15602#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15641#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15610#L551-3 assume main_#t~short7; 15611#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15618#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15622#L551-7 main_#t~short9 := main_#t~short7; 15627#L551-8 assume main_#t~short9; 15593#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15594#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15605#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 15597#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 15598#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 15629#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 15783#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 15782#L558-2 havoc main_#t~mem15; 15780#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 15777#L559-1 havoc main_#t~nondet16; 15778#L554-2 assume true; 15771#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15772#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15767#L551-3 assume main_#t~short7; 15768#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15760#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15761#L551-7 main_#t~short9 := main_#t~short7; 15752#L551-8 assume main_#t~short9; 15753#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15744#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15745#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 15786#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 15716#L554 assume main_#t~nondet12 != 0;havoc main_#t~nondet12; 15713#L555 SUMMARY for call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 15710#L555-1 SUMMARY for call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 15707#L555-2 havoc main_#t~mem13; 15705#L556 SUMMARY for call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 15701#L556-1 havoc main_#t~nondet14; 15697#L554-2 assume true; 15694#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15691#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15688#L551-3 assume main_#t~short7; 15684#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15682#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15680#L551-7 main_#t~short9 := main_#t~short7; 15678#L551-8 assume main_#t~short9; 15675#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15674#L551-10 [2018-11-10 12:38:21,497 INFO L795 eck$LassoCheckResult]: Loop: 15674#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15648#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 15646#L552 assume !(main_#t~nondet10 != 0);havoc main_#t~nondet10; 15644#L554 assume !(main_#t~nondet12 != 0);havoc main_#t~nondet12; 15614#L558 SUMMARY for call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L558 15615#L558-1 SUMMARY for call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L558-1 15620#L558-2 havoc main_#t~mem15; 15608#L559 SUMMARY for call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4); srcloc: L559 15584#L559-1 havoc main_#t~nondet16; 15585#L554-2 assume true; 15665#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15663#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15661#L551-3 assume main_#t~short7; 15659#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15657#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15655#L551-7 main_#t~short9 := main_#t~short7; 15653#L551-8 assume main_#t~short9; 15649#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15647#L551-10 main_#t~short9 := main_#t~mem8 > 0; 15645#L551-12 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem8;havoc main_#t~short7;havoc main_#t~mem6;havoc main_#t~mem5; 15643#L552 assume main_#t~nondet10 != 0;havoc main_#t~nondet10; 15633#L553 SUMMARY for call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L553 15634#L553-1 SUMMARY for call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L553-1 15704#L553-2 havoc main_#t~mem11; 15700#L554-2 assume true; 15696#L551-1 SUMMARY for call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L551-1 15693#L551-2 main_#t~short7 := main_#t~mem5 > 0; 15690#L551-3 assume main_#t~short7; 15686#L551-4 SUMMARY for call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L551-4 15683#L551-5 main_#t~short7 := main_#t~mem6 > 0; 15681#L551-7 main_#t~short9 := main_#t~short7; 15679#L551-8 assume main_#t~short9; 15677#L551-9 SUMMARY for call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L551-9 15674#L551-10 [2018-11-10 12:38:21,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1326707136, now seen corresponding path program 4 times [2018-11-10 12:38:21,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:21,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:21,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:21,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:21,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:21,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:21,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1099477065, now seen corresponding path program 1 times [2018-11-10 12:38:21,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:21,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:21,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:38:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:21,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:21,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1567210152, now seen corresponding path program 1 times [2018-11-10 12:38:21,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:38:21,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:38:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:38:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:38:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:38:21,808 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 98 [2018-11-10 12:38:22,532 WARN L179 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 163 [2018-11-10 12:38:22,713 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-10 12:38:22,716 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:38:22,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:38:22,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:38:22,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:38:22,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:38:22,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:38:22,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:38:22,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:38:22,717 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration13_Lasso [2018-11-10 12:38:22,717 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:38:22,717 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:38:22,720 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 12:38:22,722 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 12:38:22,724 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 12:38:22,725 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 12:38:22,728 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 12:38:22,730 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 12:38:22,732 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 12:38:22,734 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 12:38:23,026 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2018-11-10 12:38:23,154 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-11-10 12:38:23,154 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 12:38:23,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:23,158 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 12:38:23,159 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 12:38:23,160 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 12:38:23,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:23,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:23,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:38:23,348 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-11-10 12:38:23,577 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:38:23,577 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:38:23,578 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 12:38:23,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:23,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:23,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:23,579 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,579 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 12:38:23,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,586 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 12:38:23,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,588 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,589 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 12:38:23,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,591 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 12:38:23,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,592 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,594 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 12:38:23,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,596 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 12:38:23,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:38:23,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:38:23,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:38:23,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,598 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 12:38:23,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,602 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 12:38:23,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,605 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 12:38:23,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,607 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 12:38:23,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,608 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:23,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,608 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:23,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,611 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 12:38:23,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,615 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 12:38:23,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,615 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:23,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,616 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:23,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,618 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 12:38:23,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,619 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:38:23,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,620 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:38:23,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:38:23,622 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 12:38:23,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:38:23,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:38:23,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:38:23,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:38:23,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:38:23,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:38:23,628 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:38:23,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:38:23,631 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:38:23,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:38:23,632 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:38:23,632 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:38:23,633 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_11) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_11 Supporting invariants [] [2018-11-10 12:38:23,829 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 12:38:23,830 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:38:23,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:23,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:23,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:23,865 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 12:38:23,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:23,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:23,880 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 12:38:23,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 12:38:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:23,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:23,908 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:23,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:23,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:23,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:23,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:23,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:23,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:23,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 12:38:23,993 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 12:38:23,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:23,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-11-10 12:38:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:24,004 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 12:38:24,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45 Second operand 9 states. [2018-11-10 12:38:24,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 516 states and 557 transitions. Complement of second has 14 states. [2018-11-10 12:38:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:38:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2018-11-10 12:38:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 49 transitions. Stem has 47 letters. Loop has 33 letters. [2018-11-10 12:38:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:24,122 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:24,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:24,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:24,165 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,167 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 12:38:24,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,182 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 12:38:24,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 12:38:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:24,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:24,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:24,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:24,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:24,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:24,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:24,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:24,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 12:38:24,314 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 12:38:24,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-11-10 12:38:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:24,329 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 12:38:24,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45 Second operand 9 states. [2018-11-10 12:38:24,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 597 states and 641 transitions. Complement of second has 18 states. [2018-11-10 12:38:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:38:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2018-11-10 12:38:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 66 transitions. Stem has 47 letters. Loop has 33 letters. [2018-11-10 12:38:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:24,482 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:38:24,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:38:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:24,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:24,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,537 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 12:38:24,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,549 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 12:38:24,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-11-10 12:38:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:38:24,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:38:24,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:38:24,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 12:38:24,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 12:38:24,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 12:38:24,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 12:38:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 12:38:24,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2018-11-10 12:38:24,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 12:38:24,660 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 12:38:24,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:38:24,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-11-10 12:38:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:38:24,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 12:38:24,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45 Second operand 9 states. [2018-11-10 12:38:24,805 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 399 states and 433 transitions. cyclomatic complexity: 45. Second operand 9 states. Result 778 states and 847 transitions. Complement of second has 17 states. [2018-11-10 12:38:24,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:38:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:38:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2018-11-10 12:38:24,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 69 transitions. Stem has 47 letters. Loop has 33 letters. [2018-11-10 12:38:24,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:24,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 69 transitions. Stem has 80 letters. Loop has 33 letters. [2018-11-10 12:38:24,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:24,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 69 transitions. Stem has 47 letters. Loop has 66 letters. [2018-11-10 12:38:24,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:38:24,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 778 states and 847 transitions. [2018-11-10 12:38:24,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:38:24,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 778 states to 0 states and 0 transitions. [2018-11-10 12:38:24,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:38:24,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:38:24,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:38:24,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:38:24,815 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:38:24,815 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:38:24,815 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:38:24,815 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 12:38:24,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:38:24,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:38:24,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:38:24,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:38:24 BoogieIcfgContainer [2018-11-10 12:38:24,822 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:38:24,822 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:38:24,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:38:24,823 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:38:24,823 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:37:58" (3/4) ... [2018-11-10 12:38:24,827 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:38:24,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:38:24,827 INFO L168 Benchmark]: Toolchain (without parser) took 26977.70 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 552.1 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -115.6 MB). Peak memory consumption was 436.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:24,828 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:38:24,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:24,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -209.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:24,829 INFO L168 Benchmark]: Boogie Preprocessor took 18.28 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 12:38:24,829 INFO L168 Benchmark]: RCFGBuilder took 304.47 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:24,829 INFO L168 Benchmark]: BuchiAutomizer took 26254.52 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 403.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 452.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:38:24,829 INFO L168 Benchmark]: Witness Printer took 4.30 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:38:24,831 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 310.00 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -209.0 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.28 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 304.47 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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26254.52 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 403.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.4 MB). Peak memory consumption was 452.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.6 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 13 terminating modules (2 trivial, 8 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 16 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 9 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.2s and 14 iterations. TraceHistogramMax:3. Analysis of lassos took 19.6s. Construction of modules took 0.7s. Büchi inclusion checks took 5.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 767 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 588 states and ocurred in iteration 10. Nontrivial modules had stage [7, 1, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/37 HoareTripleCheckerStatistics: 665 SDtfs, 1081 SDslu, 1035 SDs, 0 SdLazy, 1203 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso11 LassoPreprocessingBenchmarks: Lassos: inital391 mio100 ax105 hnf100 lsp90 ukn72 mio100 lsp39 div100 bol100 ite100 ukn100 eq198 hnf87 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 3 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...