./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/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_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/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-0cd3be1 [2018-11-28 11:40:25,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:40:25,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:40:25,063 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:40:25,063 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:40:25,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:40:25,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:40:25,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:40:25,067 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:40:25,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:40:25,068 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:40:25,068 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:40:25,069 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:40:25,070 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:40:25,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:40:25,071 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:40:25,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:40:25,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:40:25,074 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:40:25,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:40:25,075 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:40:25,076 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:40:25,078 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:40:25,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:40:25,078 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:40:25,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:40:25,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:40:25,080 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:40:25,081 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:40:25,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:40:25,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:40:25,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:40:25,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:40:25,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:40:25,083 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:40:25,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:40:25,084 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 11:40:25,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:40:25,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:40:25,096 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:40:25,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:40:25,096 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:40:25,097 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:40:25,097 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:40:25,097 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:40:25,097 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:40:25,097 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:40:25,097 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:40:25,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:40:25,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:40:25,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:40:25,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:40:25,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:40:25,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:40:25,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:40:25,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:40:25,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:40:25,099 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:40:25,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:40:25,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:40:25,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:40:25,100 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:40:25,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:40:25,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:40:25,100 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:40:25,101 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:40:25,101 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_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-11-28 11:40:25,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:40:25,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:40:25,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:40:25,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:40:25,137 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:40:25,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-28 11:40:25,182 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/data/b807a5663/88aaf6f93e3c4bd19dee4f4c85561f7a/FLAG041f1c9f4 [2018-11-28 11:40:25,613 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:40:25,614 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-28 11:40:25,623 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/data/b807a5663/88aaf6f93e3c4bd19dee4f4c85561f7a/FLAG041f1c9f4 [2018-11-28 11:40:25,632 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/data/b807a5663/88aaf6f93e3c4bd19dee4f4c85561f7a [2018-11-28 11:40:25,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:40:25,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:40:25,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:40:25,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:40:25,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:40:25,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c319f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25, skipping insertion in model container [2018-11-28 11:40:25,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:40:25,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:40:25,833 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:40:25,887 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:40:25,915 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:40:25,937 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:40:25,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25 WrapperNode [2018-11-28 11:40:25,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:40:25,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:40:25,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:40:25,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:40:25,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:40:25,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:40:25,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:40:25,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:40:25,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... [2018-11-28 11:40:25,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:40:25,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:40:25,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:40:25,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:40:25,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f163855e-7bf7-4570-8e24-caf9e9dbb340/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:40:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:40:26,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:40:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:40:26,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:40:26,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:40:26,140 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:40:26,140 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 11:40:26,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:26 BoogieIcfgContainer [2018-11-28 11:40:26,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:40:26,141 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:40:26,141 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:40:26,144 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:40:26,145 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:40:26,145 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:40:25" (1/3) ... [2018-11-28 11:40:26,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11be62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:26, skipping insertion in model container [2018-11-28 11:40:26,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:40:26,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:25" (2/3) ... [2018-11-28 11:40:26,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11be62f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:40:26, skipping insertion in model container [2018-11-28 11:40:26,146 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:40:26,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:26" (3/3) ... [2018-11-28 11:40:26,147 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-28 11:40:26,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:40:26,192 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:40:26,192 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:40:26,192 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:40:26,192 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:40:26,192 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:40:26,192 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:40:26,192 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:40:26,192 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:40:26,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 11:40:26,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:26,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:26,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:26,221 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:40:26,221 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:40:26,221 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:40:26,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 11:40:26,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:26,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:26,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:26,223 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:40:26,223 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:40:26,227 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-11-28 11:40:26,228 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~short6;havoc main_#t~mem5; 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-11-28 11:40:26,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 11:40:26,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:26,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:26,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:26,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-11-28 11:40:26,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:26,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:26,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:26,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:26,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-11-28 11:40:26,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:26,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:26,532 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-28 11:40:26,639 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:40:26,641 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:40:26,641 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:40:26,641 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:40:26,642 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:40:26,642 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:26,642 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:40:26,642 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:40:26,642 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-28 11:40:26,642 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:40:26,642 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:40:26,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:26,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,106 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:40:27,110 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:40:27,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,122 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:27,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:27,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:27,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:27,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:27,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:27,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,155 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:40:27,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,156 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:40:27,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:27,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:27,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,193 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:27,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,196 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:27,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:27,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:27,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:27,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:27,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:27,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-11-28 11:40:27,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:27,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:27,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:27,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:27,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:27,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:27,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:27,221 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:40:27,224 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:40:27,224 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:40:27,226 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:40:27,226 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:40:27,227 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:40:27,228 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-11-28 11:40:27,260 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 11:40:27,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:40:27,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:27,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:27,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:27,335 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-11-28 11:40:27,336 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-28 11:40:27,393 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-11-28 11:40:27,394 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-11-28 11:40:27,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:40:27,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-28 11:40:27,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 11:40:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:40:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 11:40:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:27,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-11-28 11:40:27,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:27,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2018-11-28 11:40:27,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:40:27,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 11:40:27,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-28 11:40:27,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:27,406 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-28 11:40:27,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-28 11:40:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-28 11:40:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 11:40:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-28 11:40:27,423 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 11:40:27,423 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-28 11:40:27,424 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:40:27,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-28 11:40:27,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:27,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:27,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:27,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:40:27,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:40:27,425 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~short6;havoc main_#t~mem5; 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-11-28 11:40:27,425 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~short6;havoc main_#t~mem5; 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-11-28 11:40:27,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:27,426 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-11-28 11:40:27,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:27,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:27,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:40:27,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:40:27,457 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:40:27,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:27,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2018-11-28 11:40:27,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:27,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:27,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:27,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:40:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:40:27,593 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 11:40:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:27,600 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-28 11:40:27,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:40:27,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-28 11:40:27,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:27,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2018-11-28 11:40:27,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 11:40:27,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 11:40:27,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-28 11:40:27,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:27,603 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 11:40:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-28 11:40:27,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 11:40:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 11:40:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-28 11:40:27,605 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 11:40:27,605 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-28 11:40:27,605 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:40:27,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-28 11:40:27,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:27,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:27,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:27,607 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:40:27,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:40:27,607 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~short6;havoc main_#t~mem5; 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-11-28 11:40:27,607 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~short6;havoc main_#t~mem5; 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-11-28 11:40:27,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:27,608 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-11-28 11:40:27,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:27,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:27,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2018-11-28 11:40:27,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:27,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2018-11-28 11:40:27,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:27,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:27,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:27,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:27,872 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-11-28 11:40:27,910 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:40:27,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:40:27,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:40:27,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:40:27,910 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:40:27,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:27,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:40:27,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:40:27,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 11:40:27,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:40:27,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:40:27,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,075 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-11-28 11:40:28,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:40:28,352 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:40:28,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:28,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:28,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:28,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:28,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:28,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:28,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,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-11-28 11:40:28,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,359 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:28,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:28,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:28,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:28,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,363 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:28,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:28,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:28,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:28,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:28,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,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-11-28 11:40:28,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,367 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:28,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:40:28,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,370 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:40:28,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:28,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,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-11-28 11:40:28,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,381 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:28,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,382 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:28,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:28,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,396 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:28,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,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-11-28 11:40:28,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:28,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:28,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:28,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:28,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:28,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:28,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:28,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:28,435 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:40:28,439 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:40:28,439 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:40:28,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:40:28,441 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:40:28,441 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:40:28,441 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-11-28 11:40:28,480 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 11:40:28,481 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:40:28,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:28,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:28,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:28,554 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-11-28 11:40:28,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-28 11:40:28,586 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-11-28 11:40:28,587 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-11-28 11:40:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:40:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 11:40:28,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:40:28,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:28,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:40:28,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:28,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 11:40:28,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:28,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-28 11:40:28,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:28,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 11:40:28,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 11:40:28,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:40:28,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-28 11:40:28,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:28,590 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 11:40:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-28 11:40:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-28 11:40:28,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 11:40:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-28 11:40:28,591 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 11:40:28,591 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-28 11:40:28,591 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:40:28,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-28 11:40:28,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 11:40:28,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:28,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:28,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2018-11-28 11:40:28,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:40:28,593 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~short6;havoc main_#t~mem5; 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~short6;havoc main_#t~mem5; 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-11-28 11:40:28,593 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~short6;havoc main_#t~mem5; 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-11-28 11:40:28,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2018-11-28 11:40:28,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:28,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:28,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:28,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:28,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2018-11-28 11:40:28,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:28,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:28,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:28,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:28,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:28,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:28,619 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2018-11-28 11:40:28,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:28,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:28,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:28,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:28,913 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2018-11-28 11:40:28,978 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:40:28,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:40:28,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:40:28,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:40:28,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:40:28,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:28,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:40:28,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:40:28,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 11:40:28,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:40:28,979 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:40:28,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:28,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:40:29,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:40:29,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:29,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:29,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:29,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:29,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:29,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:29,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:29,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,325 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 11:40:29,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,325 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:40:29,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:29,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,338 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:29,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,339 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:29,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,350 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:29,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,350 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:29,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:29,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:29,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:29,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:29,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:29,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:29,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:29,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:29,368 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:40:29,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:40:29,374 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:40:29,374 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:40:29,375 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 11:40:29,375 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:40:29,375 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-11-28 11:40:29,412 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 11:40:29,413 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:40:29,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:29,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:29,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:29,489 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-11-28 11:40:29,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 11:40:29,518 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-11-28 11:40:29,519 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-11-28 11:40:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:40:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 11:40:29,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:40:29,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:29,520 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:40:29,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:29,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:29,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:29,587 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-11-28 11:40:29,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 11:40:29,626 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-11-28 11:40:29,627 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-11-28 11:40:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:40:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 11:40:29,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:40:29,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:29,628 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 11:40:29,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:29,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:29,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:29,727 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-11-28 11:40:29,727 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-28 11:40:29,763 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-11-28 11:40:29,764 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-11-28 11:40:29,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 11:40:29,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 11:40:29,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 11:40:29,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:29,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-28 11:40:29,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:29,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-28 11:40:29,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:29,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-11-28 11:40:29,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:40:29,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2018-11-28 11:40:29,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 11:40:29,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 11:40:29,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-28 11:40:29,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 11:40:29,768 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-28 11:40:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-28 11:40:29,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2018-11-28 11:40:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 11:40:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 11:40:29,770 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 11:40:29,770 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 11:40:29,770 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:40:29,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 11:40:29,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 11:40:29,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:40:29,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:40:29,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 11:40:29,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 11:40:29,771 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-11-28 11:40:29,771 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~short6;havoc main_#t~mem5; 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-11-28 11:40:29,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:29,771 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 11:40:29,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:29,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:29,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:29,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:29,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2018-11-28 11:40:29,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:29,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:29,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:29,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:40:29,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:29,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2018-11-28 11:40:29,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:29,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:29,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:29,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:29,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:40:29,929 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:40:29,929 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:40:29,929 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:40:29,929 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:40:29,929 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:40:29,929 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:40:29,929 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:40:29,929 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:40:29,929 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 11:40:29,929 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:40:29,929 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:40:29,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:29,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:40:30,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:40:30,223 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:40:30,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,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-11-28 11:40:30,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,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-11-28 11:40:30,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,256 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:30,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,257 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:30,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,271 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 11:40:30,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,271 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 11:40:30,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:40:30,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 11:40:30,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:40:30,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:40:30,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:40:30,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:40:30,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:40:30,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:40:30,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:40:30,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:40:30,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:40:30,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 11:40:30,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 11:40:30,284 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 11:40:30,284 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 11:40:30,284 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 11:40:30,284 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 11:40:30,284 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-11-28 11:40:30,332 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 11:40:30,334 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 11:40:30,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:30,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:30,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:30,387 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-11-28 11:40:30,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-28 11:40:30,441 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-11-28 11:40:30,441 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-11-28 11:40:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 11:40:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 11:40:30,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 11:40:30,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:30,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 11:40:30,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:30,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 11:40:30,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 11:40:30,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-28 11:40:30,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:40:30,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-28 11:40:30,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:40:30,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:40:30,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:40:30,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:40:30,443 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:40:30,443 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:40:30,443 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:40:30,443 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:40:30,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:40:30,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:40:30,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:40:30,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:40:30 BoogieIcfgContainer [2018-11-28 11:40:30,448 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:40:30,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:40:30,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:40:30,448 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:40:30,448 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:26" (3/4) ... [2018-11-28 11:40:30,450 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:40:30,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:40:30,451 INFO L168 Benchmark]: Toolchain (without parser) took 4817.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -231.7 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:30,452 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:30,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:30,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:30,453 INFO L168 Benchmark]: Boogie Preprocessor took 13.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:30,453 INFO L168 Benchmark]: RCFGBuilder took 160.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:30,453 INFO L168 Benchmark]: BuchiAutomizer took 4306.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -55.0 MB). Peak memory consumption was 133.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:40:30,454 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:40:30,457 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -194.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.50 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. * Boogie Preprocessor took 13.44 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 160.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4306.88 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -55.0 MB). Peak memory consumption was 133.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 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 4.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. 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.1s 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: 12ms 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...