./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/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_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 30ab881e1a71a9d76a9921c34ce47cc9425d2331 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 22:57:45,459 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:57:45,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:57:45,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:57:45,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:57:45,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:57:45,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:57:45,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:57:45,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:57:45,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:57:45,470 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:57:45,470 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:57:45,471 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:57:45,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:57:45,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:57:45,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:57:45,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:57:45,474 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:57:45,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:57:45,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:57:45,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:57:45,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:57:45,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:57:45,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:57:45,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:57:45,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:57:45,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:57:45,479 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:57:45,479 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:57:45,480 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:57:45,480 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:57:45,480 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:57:45,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:57:45,481 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:57:45,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:57:45,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:57:45,481 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 22:57:45,489 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:57:45,489 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:57:45,490 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 22:57:45,490 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 22:57:45,490 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 22:57:45,490 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 22:57:45,490 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 22:57:45,490 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 22:57:45,491 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:57:45,491 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 22:57:45,492 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 22:57:45,492 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 22:57:45,492 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:57:45,492 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:57:45,492 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 22:57:45,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:57:45,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 22:57:45,492 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 22:57:45,493 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 22:57:45,493 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_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-12-02 22:57:45,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:57:45,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:57:45,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:57:45,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:57:45,523 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:57:45,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-12-02 22:57:45,568 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/data/060f9dd9d/fc386f7039cd46d2b774c3eee6af6e3c/FLAGb5cef1714 [2018-12-02 22:57:45,887 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:57:45,887 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-12-02 22:57:45,892 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/data/060f9dd9d/fc386f7039cd46d2b774c3eee6af6e3c/FLAGb5cef1714 [2018-12-02 22:57:45,900 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/data/060f9dd9d/fc386f7039cd46d2b774c3eee6af6e3c [2018-12-02 22:57:45,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:57:45,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:57:45,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:57:45,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:57:45,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:57:45,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:57:45" (1/1) ... [2018-12-02 22:57:45,909 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:45, skipping insertion in model container [2018-12-02 22:57:45,909 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:57:45" (1/1) ... [2018-12-02 22:57:45,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:57:45,935 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:57:46,087 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:57:46,093 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:57:46,150 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:57:46,169 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:57:46,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46 WrapperNode [2018-12-02 22:57:46,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:57:46,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:57:46,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:57:46,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:57:46,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:57:46,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:57:46,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:57:46,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:57:46,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... [2018-12-02 22:57:46,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:57:46,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:57:46,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:57:46,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:57:46,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a207ec1a-2f9f-43e2-bee3-debe56a1a93a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:57:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 22:57:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 22:57:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 22:57:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 22:57:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:57:46,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:57:46,355 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:57:46,355 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 22:57:46,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:57:46 BoogieIcfgContainer [2018-12-02 22:57:46,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:57:46,356 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 22:57:46,356 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 22:57:46,358 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 22:57:46,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:57:46,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 10:57:45" (1/3) ... [2018-12-02 22:57:46,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@697ab506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:57:46, skipping insertion in model container [2018-12-02 22:57:46,359 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:57:46,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:57:46" (2/3) ... [2018-12-02 22:57:46,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@697ab506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:57:46, skipping insertion in model container [2018-12-02 22:57:46,360 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 22:57:46,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:57:46" (3/3) ... [2018-12-02 22:57:46,361 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-12-02 22:57:46,398 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 22:57:46,399 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 22:57:46,399 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 22:57:46,399 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 22:57:46,399 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:57:46,399 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:57:46,399 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 22:57:46,399 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:57:46,399 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 22:57:46,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-02 22:57:46,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:46,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:57:46,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:57:46,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 22:57:46,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:57:46,426 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 22:57:46,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-12-02 22:57:46,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:46,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:57:46,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:57:46,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 22:57:46,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:57:46,434 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 11#L551-2true [2018-12-02 22:57:46,435 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 7#L551true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 11#L551-2true [2018-12-02 22:57:46,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 22:57:46,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:46,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:46,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:46,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:46,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:46,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:46,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-12-02 22:57:46,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:46,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:46,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:46,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:46,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:46,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-12-02 22:57:46,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:46,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:46,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:46,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:46,719 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:57:46,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:57:46,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:57:46,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:57:46,720 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:57:46,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:57:46,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:57:46,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:57:46,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 22:57:46,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:57:46,721 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:57:46,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:46,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,065 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:57:47,068 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:57:47,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:47,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:47,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:47,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:47,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,092 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:47,092 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:47,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,098 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 22:57:47,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,099 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 22:57:47,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:47,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:47,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,126 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:47,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,128 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:47,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:47,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:47,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:47,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:47,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:47,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:47,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:47,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:47,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:47,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:47,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:47,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:47,144 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:57:47,147 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:57:47,147 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:57:47,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:57:47,149 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 22:57:47,149 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:57:47,149 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-12-02 22:57:47,179 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 22:57:47,182 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:57:47,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:47,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:47,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:47,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 22:57:47,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-12-02 22:57:47,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 40 states and 48 transitions. Complement of second has 10 states. [2018-12-02 22:57:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 22:57:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 22:57:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-12-02 22:57:47,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 22:57:47,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:47,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 22:57:47,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:47,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-02 22:57:47,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:47,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-12-02 22:57:47,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:47,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2018-12-02 22:57:47,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 22:57:47,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 22:57:47,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-02 22:57:47,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:57:47,316 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-02 22:57:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-02 22:57:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-02 22:57:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 22:57:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-12-02 22:57:47,332 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-02 22:57:47,332 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-12-02 22:57:47,332 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 22:57:47,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-12-02 22:57:47,333 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:47,333 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:57:47,333 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:57:47,333 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 22:57:47,333 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:57:47,334 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 147#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 151#L551-2 [2018-12-02 22:57:47,334 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 156#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 151#L551-2 [2018-12-02 22:57:47,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-12-02 22:57:47,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:47,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:47,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:47,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:57:47,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:57:47,358 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 22:57:47,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2018-12-02 22:57:47,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:57:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:57:47,454 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-12-02 22:57:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:57:47,461 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-02 22:57:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:57:47,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-12-02 22:57:47,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:47,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2018-12-02 22:57:47,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-02 22:57:47,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-02 22:57:47,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-12-02 22:57:47,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:57:47,463 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-02 22:57:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-12-02 22:57:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-02 22:57:47,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 22:57:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-12-02 22:57:47,464 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-02 22:57:47,464 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-12-02 22:57:47,464 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 22:57:47,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-12-02 22:57:47,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:47,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:57:47,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:57:47,465 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 22:57:47,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:57:47,466 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 185#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 188#L551-2 [2018-12-02 22:57:47,466 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 193#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 188#L551-2 [2018-12-02 22:57:47,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-12-02 22:57:47,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:47,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:47,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:57:47,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:47,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2018-12-02 22:57:47,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:47,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:47,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2018-12-02 22:57:47,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:47,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:57:47,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:47,690 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2018-12-02 22:57:47,723 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:57:47,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:57:47,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:57:47,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:57:47,723 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:57:47,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:57:47,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:57:47,723 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:57:47,723 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-02 22:57:47,723 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:57:47,723 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:57:47,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:47,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:57:48,023 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:57:48,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,039 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 22:57:48,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,039 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 22:57:48,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,049 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:48,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,049 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:48,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,056 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:48,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,057 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:48,057 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,080 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:57:48,082 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:57:48,082 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:57:48,082 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:57:48,083 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 22:57:48,083 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:57:48,083 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-12-02 22:57:48,113 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 22:57:48,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:57:48,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:48,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:48,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:48,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 22:57:48,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-12-02 22:57:48,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-12-02 22:57:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:57:48,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 22:57:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 22:57:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 22:57:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 22:57:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-02 22:57:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:48,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-12-02 22:57:48,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:48,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2018-12-02 22:57:48,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 22:57:48,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 22:57:48,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-12-02 22:57:48,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:57:48,193 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 22:57:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-12-02 22:57:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-02 22:57:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 22:57:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-12-02 22:57:48,195 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 22:57:48,195 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-12-02 22:57:48,195 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 22:57:48,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-12-02 22:57:48,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 22:57:48,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:57:48,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:57:48,196 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2018-12-02 22:57:48,196 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:57:48,197 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 319#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 323#L551-2 [2018-12-02 22:57:48,197 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 331#L551 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem8 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem8; 323#L551-2 [2018-12-02 22:57:48,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2018-12-02 22:57:48,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:48,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:48,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:48,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2018-12-02 22:57:48,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:48,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:48,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:57:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:48,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2018-12-02 22:57:48,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:48,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:57:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:48,531 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 98 [2018-12-02 22:57:48,607 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:57:48,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:57:48,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:57:48,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:57:48,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:57:48,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:57:48,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:57:48,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:57:48,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-02 22:57:48,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:57:48,607 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:57:48,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:48,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:57:48,919 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:57:48,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:48,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:48,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 22:57:48,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,926 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 22:57:48,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:48,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,935 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:48,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,936 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:48,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,939 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,939 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,942 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,944 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:48,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,944 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:48,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,950 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:48,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:48,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:48,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:48,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:48,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:48,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:48,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:48,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:57:48,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:57:48,959 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:57:48,960 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:57:48,960 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 22:57:48,960 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:57:48,960 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-12-02 22:57:48,982 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 22:57:48,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:57:48,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:49,035 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 22:57:49,035 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 22:57:49,052 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-12-02 22:57:49,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:57:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 22:57:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 22:57:49,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 22:57:49,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,053 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 22:57:49,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:49,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 22:57:49,093 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 22:57:49,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-12-02 22:57:49,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:57:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 22:57:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-02 22:57:49,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 22:57:49,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,109 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 22:57:49,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:49,150 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 22:57:49,150 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-02 22:57:49,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2018-12-02 22:57:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 22:57:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 22:57:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-02 22:57:49,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-02 22:57:49,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2018-12-02 22:57:49,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2018-12-02 22:57:49,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,166 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-12-02 22:57:49,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 22:57:49,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2018-12-02 22:57:49,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-02 22:57:49,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-02 22:57:49,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-12-02 22:57:49,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 22:57:49,168 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-12-02 22:57:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-12-02 22:57:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2018-12-02 22:57:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 22:57:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-02 22:57:49,169 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-02 22:57:49,169 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-02 22:57:49,169 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 22:57:49,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-02 22:57:49,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 22:57:49,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 22:57:49,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 22:57:49,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 22:57:49,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 22:57:49,169 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 641#L551-2 [2018-12-02 22:57:49,169 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~mem5;havoc main_#t~short6;havoc main_#t~mem4; 644#L551 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(main_#t~nondet9, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet9;call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem10 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem10; 641#L551-2 [2018-12-02 22:57:49,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,170 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 22:57:49,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:49,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:49,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:57:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:49,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2018-12-02 22:57:49,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:49,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 22:57:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:49,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2018-12-02 22:57:49,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:57:49,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:57:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:49,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:57:49,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:57:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 22:57:49,301 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 22:57:49,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 22:57:49,301 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 22:57:49,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 22:57:49,301 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 22:57:49,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 22:57:49,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 22:57:49,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 22:57:49,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-02 22:57:49,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 22:57:49,302 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 22:57:49,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 22:57:49,555 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 22:57:49,555 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 22:57:49,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,561 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,567 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,574 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:49,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,574 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:49,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,585 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 22:57:49,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,586 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 22:57:49,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 22:57:49,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 22:57:49,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 22:57:49,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 22:57:49,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 22:57:49,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 22:57:49,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 22:57:49,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 22:57:49,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 22:57:49,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 22:57:49,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 22:57:49,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 22:57:49,595 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 22:57:49,595 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 22:57:49,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 22:57:49,596 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 22:57:49,596 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 22:57:49,596 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-12-02 22:57:49,636 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 22:57:49,637 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 22:57:49,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:57:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:57:49,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 22:57:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:57:49,682 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-02 22:57:49,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-02 22:57:49,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 26 states and 33 transitions. Complement of second has 8 states. [2018-12-02 22:57:49,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-02 22:57:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 22:57:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-02 22:57:49,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 22:57:49,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-02 22:57:49,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-12-02 22:57:49,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 22:57:49,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-12-02 22:57:49,734 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 22:57:49,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-12-02 22:57:49,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 22:57:49,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 22:57:49,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 22:57:49,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 22:57:49,734 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:57:49,734 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:57:49,734 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:57:49,734 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 22:57:49,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 22:57:49,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 22:57:49,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 22:57:49,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 10:57:49 BoogieIcfgContainer [2018-12-02 22:57:49,740 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 22:57:49,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:57:49,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:57:49,740 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:57:49,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:57:46" (3/4) ... [2018-12-02 22:57:49,744 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 22:57:49,744 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:57:49,744 INFO L168 Benchmark]: Toolchain (without parser) took 3842.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:57:49,745 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:57:49,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 22:57:49,746 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 22:57:49,746 INFO L168 Benchmark]: Boogie Preprocessor took 12.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:57:49,747 INFO L168 Benchmark]: RCFGBuilder took 150.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:57:49,747 INFO L168 Benchmark]: BuchiAutomizer took 3383.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -69.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:57:49,747 INFO L168 Benchmark]: Witness Printer took 3.77 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-02 22:57:49,750 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.61 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 150.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3383.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 67.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -69.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.77 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 74 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax109 hnf100 lsp86 ukn61 mio100 lsp40 div100 bol100 ite100 ukn100 eq184 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...