./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-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_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/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 30ab881e1a71a9d76a9921c34ce47cc9425d2331 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:25:19,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:25:19,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:25:19,756 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:25:19,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:25:19,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:25:19,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:25:19,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:25:19,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:25:19,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:25:19,759 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:25:19,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:25:19,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:25:19,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:25:19,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:25:19,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:25:19,761 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:25:19,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:25:19,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:25:19,764 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:25:19,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:25:19,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:25:19,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:25:19,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:25:19,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:25:19,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:25:19,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:25:19,770 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:25:19,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:25:19,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:25:19,771 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:25:19,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:25:19,772 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:25:19,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:25:19,772 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:25:19,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:25:19,773 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:25:19,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:25:19,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:25:19,785 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:25:19,785 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:25:19,785 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:25:19,785 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:25:19,785 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:25:19,786 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:25:19,786 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:25:19,786 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:25:19,786 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:25:19,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:25:19,786 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:25:19,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:25:19,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:25:19,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:25:19,788 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:25:19,788 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:25:19,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:25:19,788 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:25:19,788 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:25:19,789 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:25:19,789 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_109f7747-e8c4-47ae-95ca-d094ee7f88d6/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 -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-11-10 09:25:19,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:25:19,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:25:19,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:25:19,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:25:19,825 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:25:19,826 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-10 09:25:19,870 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/data/ed0b3ceef/721d92e67b89461c92c3d0c0150d8355/FLAGcac2bec8e [2018-11-10 09:25:20,205 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:25:20,205 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-10 09:25:20,215 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/data/ed0b3ceef/721d92e67b89461c92c3d0c0150d8355/FLAGcac2bec8e [2018-11-10 09:25:20,223 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/bin-2019/uautomizer/data/ed0b3ceef/721d92e67b89461c92c3d0c0150d8355 [2018-11-10 09:25:20,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:25:20,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:25:20,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:25:20,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:25:20,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:25:20,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6abbe121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20, skipping insertion in model container [2018-11-10 09:25:20,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:25:20,264 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:25:20,435 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:25:20,442 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:25:20,469 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:25:20,492 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:25:20,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20 WrapperNode [2018-11-10 09:25:20,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:25:20,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:25:20,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:25:20,493 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:25:20,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:25:20,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:25:20,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:25:20,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:25:20,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... [2018-11-10 09:25:20,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:25:20,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:25:20,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:25:20,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:25:20,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_109f7747-e8c4-47ae-95ca-d094ee7f88d6/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 09:25:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:25:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:25:20,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:25:20,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:25:20,796 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:25:20,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:25:20 BoogieIcfgContainer [2018-11-10 09:25:20,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:25:20,797 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:25:20,797 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:25:20,799 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:25:20,800 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:25:20,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:25:20" (1/3) ... [2018-11-10 09:25:20,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62f3994d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:25:20, skipping insertion in model container [2018-11-10 09:25:20,801 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:25:20,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:20" (2/3) ... [2018-11-10 09:25:20,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62f3994d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:25:20, skipping insertion in model container [2018-11-10 09:25:20,801 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:25:20,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:25:20" (3/3) ... [2018-11-10 09:25:20,802 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-10 09:25:20,849 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:25:20,849 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:25:20,850 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:25:20,850 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:25:20,850 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:25:20,850 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:25:20,850 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:25:20,850 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:25:20,850 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:25:20,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 09:25:20,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:25:20,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:20,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:20,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:25:20,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:20,878 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:25:20,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-10 09:25:20,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:25:20,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:20,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:20,880 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:25:20,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:20,885 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#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~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~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; 23#L551-2true [2018-11-10 09:25:20,885 INFO L795 eck$LassoCheckResult]: Loop: 23#L551-2true assume true; 24#L550-1true SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 3#L550-2true main_#t~short6 := main_#t~mem4 > 0; 5#L550-3true assume !main_#t~short6; 11#L550-7true assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 18#L551true assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 16#L552true SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 19#L552-1true SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 21#L552-2true havoc main_#t~mem8; 23#L551-2true [2018-11-10 09:25:20,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:20,889 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 09:25:20,890 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:20,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1516971858, now seen corresponding path program 1 times [2018-11-10 09:25:20,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:20,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:20,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:20,996 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 09:25:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:25:20,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:25:21,000 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:25:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:25:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:25:21,011 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 3 states. [2018-11-10 09:25:21,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:25:21,035 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-10 09:25:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:25:21,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-10 09:25:21,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:25:21,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 19 transitions. [2018-11-10 09:25:21,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 09:25:21,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 09:25:21,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2018-11-10 09:25:21,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:25:21,042 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 09:25:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2018-11-10 09:25:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 09:25:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 09:25:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-10 09:25:21,059 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 09:25:21,059 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-10 09:25:21,059 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:25:21,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2018-11-10 09:25:21,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:25:21,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:21,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:21,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:25:21,060 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:21,060 INFO L793 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 65#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~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~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; 66#L551-2 [2018-11-10 09:25:21,060 INFO L795 eck$LassoCheckResult]: Loop: 66#L551-2 assume true; 71#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 54#L550-2 main_#t~short6 := main_#t~mem4 > 0; 55#L550-3 assume main_#t~short6; 56#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 57#L550-5 main_#t~short6 := main_#t~mem5 > 0; 58#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 64#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 68#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 69#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 70#L552-2 havoc main_#t~mem8; 66#L551-2 [2018-11-10 09:25:21,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 09:25:21,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:21,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:21,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:21,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash 86377137, now seen corresponding path program 1 times [2018-11-10 09:25:21,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:21,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:21,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:21,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:21,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:21,095 INFO L82 PathProgramCache]: Analyzing trace with hash -290098769, now seen corresponding path program 1 times [2018-11-10 09:25:21,095 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:21,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:21,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:21,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:21,246 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-10 09:25:21,399 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:21,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:21,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:21,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:21,400 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:21,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:21,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:21,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:21,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 09:25:21,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:21,401 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25:21,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,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 09:25:21,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 09:25:21,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 09:25:21,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:21,600 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-11-10 09:25:21,965 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:21,970 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:21,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:21,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:21,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:21,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:21,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:21,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:21,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:21,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:21,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:21,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:21,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:21,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:21,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:21,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:21,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:21,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:21,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:21,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:21,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:21,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:21,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:21,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:21,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:21,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:21,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:21,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:21,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:21,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:21,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:21,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:21,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:21,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:21,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:21,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:21,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:21,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:21,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:21,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:21,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:21,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:21,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:22,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:22,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:22,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,016 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:22,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,020 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 09:25:22,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,020 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 09:25:22,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:22,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:22,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:22,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:22,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:22,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,049 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:25:22,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,050 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:25:22,051 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,062 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:22,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:22,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:22,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:22,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:22,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:22,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:22,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:22,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:22,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:22,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:22,082 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:22,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:25:22,086 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:25:22,087 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:22,087 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:25:22,088 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:22,088 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 09:25:22,114 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:25:22,118 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:22,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:22,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:22,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:22,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:22,216 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 09:25:22,220 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 09:25:22,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:22,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:22,232 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 09:25:22,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2018-11-10 09:25:22,247 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 09:25:22,249 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 09:25:22,249 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 2 Second operand 8 states. [2018-11-10 09:25:22,354 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 19 transitions. cyclomatic complexity: 2. Second operand 8 states. Result 43 states and 46 transitions. Complement of second has 15 states. [2018-11-10 09:25:22,355 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 09:25:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 09:25:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-11-10 09:25:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 2 letters. Loop has 11 letters. [2018-11-10 09:25:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:22,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 13 letters. Loop has 11 letters. [2018-11-10 09:25:22,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:22,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 15 transitions. Stem has 2 letters. Loop has 22 letters. [2018-11-10 09:25:22,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:22,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 46 transitions. [2018-11-10 09:25:22,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:25:22,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 43 transitions. [2018-11-10 09:25:22,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 09:25:22,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 09:25:22,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2018-11-10 09:25:22,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:25:22,360 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-11-10 09:25:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2018-11-10 09:25:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-10 09:25:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 09:25:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-11-10 09:25:22,363 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-10 09:25:22,363 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-11-10 09:25:22,363 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:25:22,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 41 transitions. [2018-11-10 09:25:22,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:25:22,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:22,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:22,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:22,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:22,364 INFO L793 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#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~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~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; 260#L551-2 assume true; 271#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 240#L550-2 main_#t~short6 := main_#t~mem4 > 0; 241#L550-3 assume main_#t~short6; 244#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 249#L550-5 main_#t~short6 := main_#t~mem5 > 0; 250#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 257#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 254#L554 [2018-11-10 09:25:22,365 INFO L795 eck$LassoCheckResult]: Loop: 254#L554 SUMMARY for call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 255#L554-1 havoc main_#t~nondet9; 252#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 253#L555-1 SUMMARY for call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 256#L555-2 havoc main_#t~mem10; 261#L551-2 assume true; 277#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 276#L550-2 main_#t~short6 := main_#t~mem4 > 0; 275#L550-3 assume main_#t~short6; 246#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 247#L550-5 main_#t~short6 := main_#t~mem5 > 0; 274#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 273#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 254#L554 [2018-11-10 09:25:22,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash -470724655, now seen corresponding path program 1 times [2018-11-10 09:25:22,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:22,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:22,383 INFO L82 PathProgramCache]: Analyzing trace with hash -922010546, now seen corresponding path program 1 times [2018-11-10 09:25:22,383 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:22,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:22,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1977213314, now seen corresponding path program 1 times [2018-11-10 09:25:22,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,678 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2018-11-10 09:25:22,719 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:22,719 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:22,719 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:22,719 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:22,719 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:22,719 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:22,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:22,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:22,719 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-10 09:25:22,719 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:22,719 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25: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 09:25: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 09:25: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 09:25: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 09:25:22,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25: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 09:25:22,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:22,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:23,173 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:23,174 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:23,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 09:25:23,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,181 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,191 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,198 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,200 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:23,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:23,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:23,202 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:23,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:23,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:23,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:23,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:23,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:23,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:23,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:23,215 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:23,223 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:25:23,223 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:25:23,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:23,225 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:25:23,225 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:23,225 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-10 09:25:23,261 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:25:23,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:23,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:23,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:23,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 09:25:23,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 09:25:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:23,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:23,316 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 19 treesize of output 20 [2018-11-10 09:25:23,318 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 09:25:23,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,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 09:25:23,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:12 [2018-11-10 09:25:23,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:23,345 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 09:25:23,349 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 09:25:23,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,358 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 09:25:23,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 09:25:23,415 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 09:25:23,415 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 09:25:23,415 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-10 09:25:23,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 41 transitions. cyclomatic complexity: 5. Second operand 9 states. Result 73 states and 80 transitions. Complement of second has 13 states. [2018-11-10 09:25:23,516 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 09:25:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:25:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2018-11-10 09:25:23,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 10 letters. Loop has 13 letters. [2018-11-10 09:25:23,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:23,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 23 letters. Loop has 13 letters. [2018-11-10 09:25:23,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:23,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 10 letters. Loop has 26 letters. [2018-11-10 09:25:23,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:23,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 80 transitions. [2018-11-10 09:25:23,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 09:25:23,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 59 states and 64 transitions. [2018-11-10 09:25:23,520 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 09:25:23,520 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 09:25:23,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2018-11-10 09:25:23,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:25:23,520 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2018-11-10 09:25:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2018-11-10 09:25:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-10 09:25:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 09:25:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-11-10 09:25:23,523 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-10 09:25:23,523 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-10 09:25:23,523 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:25:23,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 63 transitions. [2018-11-10 09:25:23,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 09:25:23,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:23,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:23,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:23,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:23,525 INFO L793 eck$LassoCheckResult]: Stem: 529#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 526#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~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~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; 527#L551-2 assume true; 542#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 543#L550-2 main_#t~short6 := main_#t~mem4 > 0; 551#L550-3 assume main_#t~short6; 549#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 547#L550-5 main_#t~short6 := main_#t~mem5 > 0; 545#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 544#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 520#L554 SUMMARY for call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 521#L554-1 havoc main_#t~nondet9; 518#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 519#L555-1 SUMMARY for call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 523#L555-2 havoc main_#t~mem10; 528#L551-2 assume true; 565#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 564#L550-2 main_#t~short6 := main_#t~mem4 > 0; 563#L550-3 assume main_#t~short6; 562#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 561#L550-5 main_#t~short6 := main_#t~mem5 > 0; 560#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 559#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 530#L552 [2018-11-10 09:25:23,525 INFO L795 eck$LassoCheckResult]: Loop: 530#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 531#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 536#L552-2 havoc main_#t~mem8; 538#L551-2 assume true; 540#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 508#L550-2 main_#t~short6 := main_#t~mem4 > 0; 509#L550-3 assume main_#t~short6; 512#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 514#L550-5 main_#t~short6 := main_#t~mem5 > 0; 516#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 524#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 530#L552 [2018-11-10 09:25:23,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1977213319, now seen corresponding path program 1 times [2018-11-10 09:25:23,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:23,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1219141219, now seen corresponding path program 2 times [2018-11-10 09:25:23,544 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:23,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2003518699, now seen corresponding path program 1 times [2018-11-10 09:25:23,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,859 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2018-11-10 09:25:23,920 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:23,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:23,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:23,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:23,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:23,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:23,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:23,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:23,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-10 09:25:23,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:23,921 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25:23,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:23,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:23,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,092 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-11-10 09:25:24,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 09:25:24,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 09:25:24,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:24,411 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:24,411 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:24,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:24,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,413 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 09:25:24,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,413 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 09:25:24,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:24,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:24,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:24,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:24,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,451 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,452 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:25:24,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,453 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:25:24,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,466 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:24,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:24,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:24,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:24,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:24,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:24,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:24,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:24,476 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:24,482 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 09:25:24,482 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 09:25:24,483 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:24,483 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:25:24,484 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:24,484 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)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-10 09:25:24,504 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:25:24,505 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:24,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:24,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:24,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:24,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:24,533 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 09:25:24,535 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 09:25:24,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:24,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:24,540 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 09:25:24,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 09:25:24,571 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 09:25:24,571 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 09:25:24,571 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 63 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-11-10 09:25:24,617 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 63 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 152 states and 163 transitions. Complement of second has 13 states. [2018-11-10 09:25:24,618 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 09:25:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 09:25:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 09:25:24,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 23 letters. Loop has 11 letters. [2018-11-10 09:25:24,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:24,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 34 letters. Loop has 11 letters. [2018-11-10 09:25:24,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:24,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 23 letters. Loop has 22 letters. [2018-11-10 09:25:24,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:24,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 163 transitions. [2018-11-10 09:25:24,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 09:25:24,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 103 states and 110 transitions. [2018-11-10 09:25:24,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 09:25:24,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 09:25:24,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 110 transitions. [2018-11-10 09:25:24,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:25:24,623 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 110 transitions. [2018-11-10 09:25:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 110 transitions. [2018-11-10 09:25:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-11-10 09:25:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 09:25:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-11-10 09:25:24,627 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-10 09:25:24,627 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-11-10 09:25:24,627 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:25:24,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 100 transitions. [2018-11-10 09:25:24,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 09:25:24,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:24,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:24,629 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:24,629 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:24,630 INFO L793 eck$LassoCheckResult]: Stem: 929#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 925#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~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~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; 926#L551-2 assume true; 942#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 904#L550-2 main_#t~short6 := main_#t~mem4 > 0; 905#L550-3 assume main_#t~short6; 986#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 984#L550-5 main_#t~short6 := main_#t~mem5 > 0; 982#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 980#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 979#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 977#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 975#L552-2 havoc main_#t~mem8; 973#L551-2 assume true; 971#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 902#L550-2 main_#t~short6 := main_#t~mem4 > 0; 903#L550-3 assume main_#t~short6; 906#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 967#L550-5 main_#t~short6 := main_#t~mem5 > 0; 922#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 923#L551 assume !(main_#t~nondet7 != 0);havoc main_#t~nondet7; 919#L554 SUMMARY for call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4); srcloc: L554 920#L554-1 havoc main_#t~nondet9; 962#L555 SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555 961#L555-1 SUMMARY for call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 960#L555-2 havoc main_#t~mem10; 959#L551-2 assume true; 957#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 955#L550-2 main_#t~short6 := main_#t~mem4 > 0; 953#L550-3 assume main_#t~short6; 951#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 949#L550-5 main_#t~short6 := main_#t~mem5 > 0; 947#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 944#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 930#L552 [2018-11-10 09:25:24,630 INFO L795 eck$LassoCheckResult]: Loop: 930#L552 SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L552 931#L552-1 SUMMARY for call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4); srcloc: L552-1 934#L552-2 havoc main_#t~mem8; 937#L551-2 assume true; 958#L550-1 SUMMARY for call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L550-1 956#L550-2 main_#t~short6 := main_#t~mem4 > 0; 954#L550-3 assume main_#t~short6; 952#L550-4 SUMMARY for call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L550-4 950#L550-5 main_#t~short6 := main_#t~mem5 > 0; 948#L550-7 assume !!main_#t~short6;havoc main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5; 946#L551 assume main_#t~nondet7 != 0;havoc main_#t~nondet7; 930#L552 [2018-11-10 09:25:24,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1112464397, now seen corresponding path program 2 times [2018-11-10 09:25:24,630 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:24,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:24,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:24,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:24,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1219141219, now seen corresponding path program 3 times [2018-11-10 09:25:24,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:24,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:24,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:24,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:24,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 806224599, now seen corresponding path program 3 times [2018-11-10 09:25:24,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:24,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:24,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:25,091 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 123 [2018-11-10 09:25:25,150 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:25,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:25,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:25,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:25,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:25,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:25,150 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:25,150 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:25,150 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-10 09:25:25,150 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:25,150 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25:25,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 09:25:25,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 09:25:25,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,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 09:25:25,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 09:25:25,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 09:25:25,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,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 09:25:25,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:25,580 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:25,581 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:25,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,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 09:25:25,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,595 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,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 09:25:25,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,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 09:25:25,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:25,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:25,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:25,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,616 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:25:25,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,618 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:25:25,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,638 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:25:25,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:25:25,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:25,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:25,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:25,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:25,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:25,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:25,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:25,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:25,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:25,693 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 09:25:25,693 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 09:25:25,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:25,694 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:25:25,694 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:25,694 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 09:25:25,723 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:25:25,725 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:25,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:25,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:25,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:25,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:25,771 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 09:25:25,773 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 09:25:25,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:25,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:25,780 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 09:25:25,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 09:25:25,817 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 09:25:25,817 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 09:25:25,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 09:25:25,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 135 states and 144 transitions. Complement of second has 13 states. [2018-11-10 09:25:25,863 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 09:25:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 09:25:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-10 09:25:25,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 34 letters. Loop has 11 letters. [2018-11-10 09:25:25,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:25,863 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:25:25,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:25,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:25,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:25,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:25,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 09:25:25,908 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 09:25:25,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:25,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:25,916 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 09:25:25,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 09:25:25,962 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 09:25:25,963 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 09:25:25,963 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 09:25:26,031 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 134 states and 141 transitions. Complement of second has 15 states. [2018-11-10 09:25:26,033 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 09:25:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 09:25:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2018-11-10 09:25:26,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 34 letters. Loop has 11 letters. [2018-11-10 09:25:26,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:26,034 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:25:26,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:26,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:26,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:26,066 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:26,067 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 09:25:26,069 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 09:25:26,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:26,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:26,079 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 09:25:26,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:9 [2018-11-10 09:25:26,110 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 09:25:26,110 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 09:25:26,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 09:25:26,157 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 100 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 157 states and 169 transitions. Complement of second has 14 states. [2018-11-10 09:25:26,158 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 09:25:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 09:25:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2018-11-10 09:25:26,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 34 letters. Loop has 11 letters. [2018-11-10 09:25:26,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:26,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 45 letters. Loop has 11 letters. [2018-11-10 09:25:26,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:26,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 33 transitions. Stem has 34 letters. Loop has 22 letters. [2018-11-10 09:25:26,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:26,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 169 transitions. [2018-11-10 09:25:26,162 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:25:26,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 0 states and 0 transitions. [2018-11-10 09:25:26,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:25:26,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:25:26,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:25:26,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:25:26,162 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:25:26,162 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:25:26,162 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:25:26,163 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:25:26,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:25:26,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:25:26,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:25:26,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:25:26 BoogieIcfgContainer [2018-11-10 09:25:26,172 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:25:26,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:25:26,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:25:26,173 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:25:26,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:25:20" (3/4) ... [2018-11-10 09:25:26,176 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:25:26,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:25:26,177 INFO L168 Benchmark]: Toolchain (without parser) took 5951.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -235.9 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:26,177 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:25:26,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 929.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:26,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:26,179 INFO L168 Benchmark]: Boogie Preprocessor took 13.96 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 09:25:26,179 INFO L168 Benchmark]: RCFGBuilder took 223.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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:26,179 INFO L168 Benchmark]: BuchiAutomizer took 5374.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.0 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:26,180 INFO L168 Benchmark]: Witness Printer took 3.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:25:26,182 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.60 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 929.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 929.6 MB in the beginning and 1.1 GB in the end (delta: -201.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.96 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 223.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: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5374.90 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -74.0 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.77 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 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[y][y] and consists of 8 locations. One deterministic 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[x][x] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 93 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 140 SDtfs, 165 SDslu, 157 SDs, 0 SdLazy, 213 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital195 mio100 ax109 hnf100 lsp85 ukn90 mio100 lsp39 div100 bol100 ite100 ukn100 eq189 hnf88 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...