./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/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_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/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-635dfa2 [2018-12-09 00:22:09,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:22:09,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:22:09,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:22:09,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:22:09,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:22:09,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:22:09,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:22:09,687 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:22:09,688 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:22:09,689 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:22:09,689 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:22:09,689 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:22:09,690 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:22:09,691 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:22:09,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:22:09,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:22:09,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:22:09,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:22:09,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:22:09,696 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:22:09,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:22:09,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:22:09,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:22:09,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:22:09,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:22:09,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:22:09,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:22:09,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:22:09,702 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:22:09,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:22:09,703 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:22:09,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:22:09,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:22:09,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:22:09,704 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:22:09,705 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 00:22:09,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:22:09,716 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:22:09,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:22:09,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:22:09,717 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:22:09,717 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 00:22:09,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:22:09,718 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 00:22:09,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 00:22:09,719 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 00:22:09,719 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:22:09,719 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 00:22:09,719 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:22:09,719 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 00:22:09,719 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:22:09,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:22:09,720 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 00:22:09,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:22:09,720 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:22:09,720 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 00:22:09,720 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 00:22:09,720 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_acce0841-0dad-4883-88e3-069e2b69667c/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-12-09 00:22:09,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:22:09,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:22:09,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:22:09,751 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:22:09,751 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:22:09,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-12-09 00:22:09,785 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/data/e4e1a0fdf/6516dba7b09c43cc9b28c1736ef28ca2/FLAG3dc5f5080 [2018-12-09 00:22:10,223 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:22:10,224 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-12-09 00:22:10,229 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/data/e4e1a0fdf/6516dba7b09c43cc9b28c1736ef28ca2/FLAG3dc5f5080 [2018-12-09 00:22:10,237 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/bin-2019/uautomizer/data/e4e1a0fdf/6516dba7b09c43cc9b28c1736ef28ca2 [2018-12-09 00:22:10,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:22:10,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:22:10,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:22:10,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:22:10,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:22:10,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6a5933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10, skipping insertion in model container [2018-12-09 00:22:10,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:22:10,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:22:10,400 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:22:10,407 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:22:10,462 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:22:10,480 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:22:10,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10 WrapperNode [2018-12-09 00:22:10,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:22:10,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:22:10,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:22:10,481 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:22:10,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:22:10,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:22:10,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:22:10,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:22:10,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... [2018-12-09 00:22:10,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:22:10,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:22:10,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:22:10,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:22:10,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acce0841-0dad-4883-88e3-069e2b69667c/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-12-09 00:22:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:22:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:22:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:22:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:22:10,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:22:10,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:22:10,645 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:22:10,645 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 00:22:10,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:22:10 BoogieIcfgContainer [2018-12-09 00:22:10,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:22:10,646 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 00:22:10,646 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 00:22:10,648 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 00:22:10,648 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:22:10,648 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 12:22:10" (1/3) ... [2018-12-09 00:22:10,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25520e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:22:10, skipping insertion in model container [2018-12-09 00:22:10,649 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:22:10,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:22:10" (2/3) ... [2018-12-09 00:22:10,650 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25520e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 12:22:10, skipping insertion in model container [2018-12-09 00:22:10,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 00:22:10,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:22:10" (3/3) ... [2018-12-09 00:22:10,651 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-12-09 00:22:10,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:22:10,682 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 00:22:10,682 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 00:22:10,682 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 00:22:10,682 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:22:10,682 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:22:10,682 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 00:22:10,682 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:22:10,682 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 00:22:10,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-09 00:22:10,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:10,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:22:10,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:22:10,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:22:10,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 00:22:10,707 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 00:22:10,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-09 00:22:10,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:10,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:22:10,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:22:10,708 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:22:10,708 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 00:22:10,712 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true 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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 11#L551-2true [2018-12-09 00:22:10,712 INFO L796 eck$LassoCheckResult]: Loop: 11#L551-2true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 12#L550-1true assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 6#L550-3true assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 7#L551true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 11#L551-2true [2018-12-09 00:22:10,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:10,716 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-09 00:22:10,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:10,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:10,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:10,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:10,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-12-09 00:22:10,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:10,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:10,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-12-09 00:22:10,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:10,994 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:22:10,995 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:22:10,995 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:22:10,995 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:22:10,995 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:22:10,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:22:10,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:22:10,995 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:22:10,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-09 00:22:10,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:22:10,996 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:22:11,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:11,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-12-09 00:22:11,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-12-09 00:22:11,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-12-09 00:22:11,351 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:22:11,356 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:22:11,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,366 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:11,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:11,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:11,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:11,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:11,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:11,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,396 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:22:11,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,397 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 00:22:11,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:11,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:11,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,431 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:11,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,432 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:11,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:11,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:11,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:11,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:11,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:11,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-12-09 00:22:11,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:11,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:11,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:11,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:11,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:11,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:11,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:11,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:22:11,455 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:22:11,455 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:22:11,457 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:22:11,457 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:22:11,457 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:22:11,457 INFO L520 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-12-09 00:22:11,481 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-09 00:22:11,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:22:11,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:11,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:11,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:11,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 00:22:11,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-12-09 00:22:11,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 40 states and 48 transitions. Complement of second has 10 states. [2018-12-09 00:22:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:22:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:22:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-12-09 00:22:11,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 00:22:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:11,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:22:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:11,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-09 00:22:11,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:11,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-12-09 00:22:11,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:11,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2018-12-09 00:22:11,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 00:22:11,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 00:22:11,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-09 00:22:11,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:22:11,615 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-09 00:22:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-09 00:22:11,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-09 00:22:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 00:22:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-12-09 00:22:11,631 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-09 00:22:11,632 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-09 00:22:11,632 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 00:22:11,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-12-09 00:22:11,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:11,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:22:11,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:22:11,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 00:22:11,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 00:22:11,633 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 145#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 153#L550-1 assume !main_#t~short6; 146#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 147#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 151#L551-2 [2018-12-09 00:22:11,633 INFO L796 eck$LassoCheckResult]: Loop: 151#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 155#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 157#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 156#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 151#L551-2 [2018-12-09 00:22:11,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-12-09 00:22:11,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:11,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:11,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:11,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:22:11,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:22:11,656 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 00:22:11,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2018-12-09 00:22:11,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:11,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:11,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:22:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:22:11,752 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-09 00:22:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:22:11,759 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-09 00:22:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:22:11,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-12-09 00:22:11,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:11,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2018-12-09 00:22:11,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 00:22:11,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-09 00:22:11,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-12-09 00:22:11,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:22:11,761 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 00:22:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-12-09 00:22:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-09 00:22:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 00:22:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-09 00:22:11,762 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 00:22:11,762 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-09 00:22:11,762 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 00:22:11,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-12-09 00:22:11,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:11,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:22:11,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:22:11,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-09 00:22:11,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 00:22:11,763 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 181#L-1 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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 182#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 191#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 184#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 185#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 188#L551-2 [2018-12-09 00:22:11,763 INFO L796 eck$LassoCheckResult]: Loop: 188#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 190#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 194#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 193#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 188#L551-2 [2018-12-09 00:22:11,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-12-09 00:22:11,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:11,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:22:11,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2018-12-09 00:22:11,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:11,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2018-12-09 00:22:11,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:11,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:22:11,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:11,972 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-12-09 00:22:12,007 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:22:12,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:22:12,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:22:12,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:22:12,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:22:12,008 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:22:12,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:22:12,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:22:12,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-09 00:22:12,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:22:12,008 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:22:12,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,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-12-09 00:22:12,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-12-09 00:22:12,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-12-09 00:22:12,365 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:22:12,365 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:22:12,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:12,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:12,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:12,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:12,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:12,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:12,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:12,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:12,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:12,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:12,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:12,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:12,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:12,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:12,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:12,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,377 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:22:12,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,377 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 00:22:12,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:12,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,384 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:12,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,385 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:12,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,392 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,393 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:12,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:12,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:12,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:12,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:12,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:12,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:12,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:12,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:12,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:22:12,417 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:22:12,417 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:22:12,418 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:22:12,419 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:22:12,419 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:22:12,419 INFO L520 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)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-12-09 00:22:12,434 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-09 00:22:12,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:22:12,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:12,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:12,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:12,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 00:22:12,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-09 00:22:12,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-12-09 00:22:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 00:22:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:22:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-09 00:22:12,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:22:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 00:22:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:12,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-09 00:22:12,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:12,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-12-09 00:22:12,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:12,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2018-12-09 00:22:12,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-09 00:22:12,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 00:22:12,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-09 00:22:12,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:22:12,507 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 00:22:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-09 00:22:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-09 00:22:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 00:22:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-09 00:22:12,509 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 00:22:12,509 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-09 00:22:12,509 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 00:22:12,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-09 00:22:12,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 00:22:12,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:22:12,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:22:12,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2018-12-09 00:22:12,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 00:22:12,510 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 316#L-1 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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 317#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 333#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 332#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 330#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 329#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 327#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 318#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 319#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 323#L551-2 [2018-12-09 00:22:12,510 INFO L796 eck$LassoCheckResult]: Loop: 323#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 325#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 328#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 331#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 323#L551-2 [2018-12-09 00:22:12,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2018-12-09 00:22:12,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:12,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:12,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2018-12-09 00:22:12,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:12,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:12,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:12,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:22:12,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:12,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2018-12-09 00:22:12,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:12,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:12,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:22:12,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:12,822 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2018-12-09 00:22:12,886 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:22:12,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:22:12,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:22:12,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:22:12,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:22:12,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:22:12,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:22:12,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:22:12,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-09 00:22:12,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:22:12,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:22:12,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:12,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,206 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:22:13,207 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:22:13,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,213 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 00:22:13,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,213 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 00:22:13,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,223 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:13,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,223 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:13,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,231 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:13,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,231 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:13,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,243 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:22:13,245 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:22:13,245 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:22:13,245 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:22:13,246 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 00:22:13,246 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:22:13,246 INFO L520 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-12-09 00:22:13,263 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-09 00:22:13,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:22:13,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:13,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:13,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:13,317 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 00:22:13,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 00:22:13,333 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-12-09 00:22:13,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 00:22:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:22:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-09 00:22:13,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 00:22:13,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:13,334 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:22:13,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:13,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:13,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:13,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 00:22:13,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 00:22:13,394 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-12-09 00:22:13,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 00:22:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:22:13,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-09 00:22:13,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 00:22:13,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:13,395 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 00:22:13,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:13,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:13,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:13,441 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 3 loop predicates [2018-12-09 00:22:13,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 00:22:13,463 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2018-12-09 00:22:13,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-09 00:22:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 00:22:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-09 00:22:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-09 00:22:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-09 00:22:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-09 00:22:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:13,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-12-09 00:22:13,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 00:22:13,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2018-12-09 00:22:13,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-09 00:22:13,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 00:22:13,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-09 00:22:13,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 00:22:13,468 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-09 00:22:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-09 00:22:13,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2018-12-09 00:22:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 00:22:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-09 00:22:13,469 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-09 00:22:13,469 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-09 00:22:13,469 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 00:22:13,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-09 00:22:13,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 00:22:13,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 00:22:13,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 00:22:13,470 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 00:22:13,470 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 00:22:13,470 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 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;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 641#L551-2 [2018-12-09 00:22:13,471 INFO L796 eck$LassoCheckResult]: Loop: 641#L551-2 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short6 := main_#t~mem4 > 0; 649#L550-1 assume main_#t~short6;call main_#t~mem5 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short6 := main_#t~mem5 > 0; 643#L550-3 assume !!main_#t~short6;havoc main_#t~mem4;havoc main_#t~mem5;havoc main_#t~short6; 644#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 641#L551-2 [2018-12-09 00:22:13,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-09 00:22:13,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:13,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:22:13,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:13,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:13,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2018-12-09 00:22:13,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:13,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:13,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:13,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:22:13,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:13,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:13,482 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2018-12-09 00:22:13,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:22:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:22:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:13,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:22:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:22:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:22:13,605 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 00:22:13,605 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 00:22:13,605 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 00:22:13,605 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 00:22:13,605 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 00:22:13,605 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 00:22:13,605 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 00:22:13,605 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 00:22:13,606 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-09 00:22:13,606 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 00:22:13,606 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 00:22:13,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 00:22:13,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 00:22:13,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 00:22:13,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,919 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,919 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,926 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:13,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,927 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:13,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,941 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 00:22:13,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,941 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 00:22:13,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 00:22:13,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 00:22:13,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 00:22:13,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 00:22:13,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 00:22:13,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 00:22:13,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 00:22:13,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 00:22:13,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 00:22:13,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 00:22:13,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 00:22:13,949 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 00:22:13,950 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 00:22:13,950 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 00:22:13,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 00:22:13,950 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 00:22:13,950 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 00:22:13,950 INFO L520 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)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-12-09 00:22:13,969 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-09 00:22:13,970 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:22:14,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:22:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:14,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:22:14,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:22:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:22:14,033 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 00:22:14,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-09 00:22:14,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 26 states and 33 transitions. Complement of second has 8 states. [2018-12-09 00:22:14,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 00:22:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 00:22:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-09 00:22:14,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-09 00:22:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:14,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-09 00:22:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:14,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-09 00:22:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 00:22:14,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-12-09 00:22:14,061 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:22:14,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-12-09 00:22:14,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 00:22:14,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 00:22:14,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 00:22:14,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 00:22:14,062 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:22:14,062 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:22:14,062 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:22:14,062 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 00:22:14,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:22:14,062 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 00:22:14,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 00:22:14,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 12:22:14 BoogieIcfgContainer [2018-12-09 00:22:14,066 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 00:22:14,066 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:22:14,066 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:22:14,066 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:22:14,067 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:22:10" (3/4) ... [2018-12-09 00:22:14,069 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:22:14,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:22:14,069 INFO L168 Benchmark]: Toolchain (without parser) took 3830.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -219.9 MB). Peak memory consumption was 76.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:22:14,070 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:22:14,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:22:14,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:22:14,071 INFO L168 Benchmark]: Boogie Preprocessor took 12.89 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-12-09 00:22:14,071 INFO L168 Benchmark]: RCFGBuilder took 128.88 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: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:22:14,071 INFO L168 Benchmark]: BuchiAutomizer took 3420.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.7 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:22:14,071 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:22:14,073 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 240.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.89 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 128.88 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: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3420.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.7 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.3 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 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 74 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax109 hnf100 lsp86 ukn61 mio100 lsp40 div100 bol100 ite100 ukn100 eq184 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...