./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/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_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/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-aa41828 [2018-11-23 04:03:04,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:03:04,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:03:04,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:03:04,136 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:03:04,137 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:03:04,138 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:03:04,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:03:04,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:03:04,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:03:04,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:03:04,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:03:04,142 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:03:04,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:03:04,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:03:04,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:03:04,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:03:04,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:03:04,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:03:04,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:03:04,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:03:04,149 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:03:04,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:03:04,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:03:04,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:03:04,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:03:04,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:03:04,153 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:03:04,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:03:04,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:03:04,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:03:04,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:03:04,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:03:04,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:03:04,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:03:04,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:03:04,158 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 04:03:04,169 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:03:04,169 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:03:04,170 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:03:04,170 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:03:04,170 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:03:04,170 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:03:04,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:03:04,171 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:03:04,172 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:03:04,172 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:03:04,173 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:03:04,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:03:04,173 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:03:04,173 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:03:04,173 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:03:04,173 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_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30ab881e1a71a9d76a9921c34ce47cc9425d2331 [2018-11-23 04:03:04,195 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:03:04,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:03:04,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:03:04,209 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:03:04,209 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:03:04,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-23 04:03:04,249 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/data/7ec6f70f6/6e35846ef0b047b7ada2039e06fd56b0/FLAGe24b2ba7f [2018-11-23 04:03:04,668 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:03:04,668 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-23 04:03:04,674 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/data/7ec6f70f6/6e35846ef0b047b7ada2039e06fd56b0/FLAGe24b2ba7f [2018-11-23 04:03:04,683 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/data/7ec6f70f6/6e35846ef0b047b7ada2039e06fd56b0 [2018-11-23 04:03:04,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:03:04,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:03:04,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:03:04,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:03:04,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:03:04,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:03:04" (1/1) ... [2018-11-23 04:03:04,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d53fc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:04, skipping insertion in model container [2018-11-23 04:03:04,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:03:04" (1/1) ... [2018-11-23 04:03:04,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:03:04,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:03:04,909 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:03:04,918 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:03:05,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:03:05,025 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:03:05,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05 WrapperNode [2018-11-23 04:03:05,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:03:05,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:03:05,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:03:05,026 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:03:05,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:03:05,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:03:05,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:03:05,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:03:05,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... [2018-11-23 04:03:05,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:03:05,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:03:05,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:03:05,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:03:05,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_013cf697-c757-4707-b639-96be6a43a70a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:03:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:03:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:03:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:03:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:03:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:03:05,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:03:05,281 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:03:05,282 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 04:03:05,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:03:05 BoogieIcfgContainer [2018-11-23 04:03:05,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:03:05,283 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:03:05,283 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:03:05,286 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:03:05,286 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:03:05,287 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:03:04" (1/3) ... [2018-11-23 04:03:05,287 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@243d797d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:03:05, skipping insertion in model container [2018-11-23 04:03:05,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:03:05,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:03:05" (2/3) ... [2018-11-23 04:03:05,288 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@243d797d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:03:05, skipping insertion in model container [2018-11-23 04:03:05,288 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:03:05,288 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:03:05" (3/3) ... [2018-11-23 04:03:05,290 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i [2018-11-23 04:03:05,336 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:03:05,337 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:03:05,337 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:03:05,337 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:03:05,337 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:03:05,337 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:03:05,337 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:03:05,338 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:03:05,338 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:03:05,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-23 04:03:05,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:05,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:03:05,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:03:05,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:03:05,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:03:05,374 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:03:05,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-23 04:03:05,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:05,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:03:05,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:03:05,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:03:05,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:03:05,382 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 11#L551-2true [2018-11-23 04:03:05,383 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~short6;havoc main_#t~mem5;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-11-23 04:03:05,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 04:03:05,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:05,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:05,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:05,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:05,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-11-23 04:03:05,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:05,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:05,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:05,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:05,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:05,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-11-23 04:03:05,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:05,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:05,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:05,646 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2018-11-23 04:03:05,785 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:03:05,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:03:05,787 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:03:05,787 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:03:05,787 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:03:05,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:03:05,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:03:05,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:03:05,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-23 04:03:05,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:03:05,788 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:03:05,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:05,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:03:06,226 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:03:06,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:06,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:06,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:06,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:06,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:06,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:06,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:06,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:06,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:06,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:06,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:06,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:06,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:06,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:06,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:06,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:06,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:06,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:06,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:06,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:06,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:06,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:06,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:06,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:06,284 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:03:06,288 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 04:03:06,288 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 04:03:06,290 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:03:06,290 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 04:03:06,290 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:03:06,291 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-23 04:03:06,312 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 04:03:06,315 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 04:03:06,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:06,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:06,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:06,404 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 04:03:06,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2018-11-23 04:03:06,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 40 states and 48 transitions. Complement of second has 10 states. [2018-11-23 04:03:06,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 04:03:06,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 04:03:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 04:03:06,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 04:03:06,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:06,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 04:03:06,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:06,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-23 04:03:06,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:06,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 48 transitions. [2018-11-23 04:03:06,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:06,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 16 states and 22 transitions. [2018-11-23 04:03:06,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 04:03:06,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-23 04:03:06,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-23 04:03:06,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:03:06,469 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-23 04:03:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-23 04:03:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 04:03:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 04:03:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2018-11-23 04:03:06,487 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-23 04:03:06,487 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2018-11-23 04:03:06,487 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:03:06,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2018-11-23 04:03:06,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:06,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:03:06,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:03:06,488 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:03:06,488 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:03:06,488 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~short6;havoc main_#t~mem5;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-11-23 04:03:06,488 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~short6;havoc main_#t~mem5;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-11-23 04:03:06,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash 889571373, now seen corresponding path program 1 times [2018-11-23 04:03:06,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:06,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:06,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:06,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:06,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:03:06,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:03:06,515 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:03:06,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 2 times [2018-11-23 04:03:06,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:06,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:06,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:06,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:03:06,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:03:06,623 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-23 04:03:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:03:06,633 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-11-23 04:03:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:03:06,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-23 04:03:06,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:06,635 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 17 transitions. [2018-11-23 04:03:06,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 04:03:06,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 04:03:06,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-23 04:03:06,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:03:06,636 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 04:03:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-23 04:03:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 04:03:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 04:03:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-23 04:03:06,637 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 04:03:06,638 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-23 04:03:06,638 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:03:06,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-23 04:03:06,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:06,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:03:06,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:03:06,639 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:03:06,639 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:03:06,639 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~short6;havoc main_#t~mem5;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-11-23 04:03:06,639 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~short6;havoc main_#t~mem5;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-11-23 04:03:06,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 1 times [2018-11-23 04:03:06,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:06,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:06,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:03:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:06,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 3 times [2018-11-23 04:03:06,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:06,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:06,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:06,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:06,666 INFO L82 PathProgramCache]: Analyzing trace with hash -980235887, now seen corresponding path program 1 times [2018-11-23 04:03:06,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:06,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:03:06,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:06,875 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2018-11-23 04:03:06,913 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:03:06,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:03:06,914 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:03:06,914 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:03:06,914 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:03:06,914 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:03:06,914 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:03:06,914 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:03:06,914 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-23 04:03:06,914 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:03:06,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:03:06,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:06,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:03:07,280 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:03:07,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:07,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:07,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:07,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:07,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:07,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:07,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:07,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:07,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:07,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:07,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:07,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:07,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:07,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:07,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:07,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:07,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,300 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:03:07,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:03:07,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:07,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,327 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:03:07,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,328 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:03:07,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,340 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:03:07,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,341 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:03:07,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:07,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:07,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:07,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:07,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:07,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:07,354 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:07,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:07,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:03:07,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 04:03:07,362 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 04:03:07,363 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:03:07,364 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:03:07,364 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:03:07,364 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [] [2018-11-23 04:03:07,396 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 04:03:07,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 04:03:07,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:07,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:07,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:07,493 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 04:03:07,493 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-23 04:03:07,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2018-11-23 04:03:07,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 04:03:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 04:03:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 04:03:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 04:03:07,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:07,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 04:03:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:07,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 04:03:07,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:07,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-23 04:03:07,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:07,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 04:03:07,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 04:03:07,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 04:03:07,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-23 04:03:07,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:03:07,537 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 04:03:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-23 04:03:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 04:03:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 04:03:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-23 04:03:07,538 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 04:03:07,538 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-23 04:03:07,538 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:03:07,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-23 04:03:07,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 04:03:07,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:03:07,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:03:07,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2018-11-23 04:03:07,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:03:07,539 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~short6;havoc main_#t~mem5;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~short6;havoc main_#t~mem5;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-11-23 04:03:07,539 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~short6;havoc main_#t~mem5;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-11-23 04:03:07,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:07,539 INFO L82 PathProgramCache]: Analyzing trace with hash -980235885, now seen corresponding path program 2 times [2018-11-23 04:03:07,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:07,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:07,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 4 times [2018-11-23 04:03:07,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:07,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:07,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:03:07,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:07,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:07,565 INFO L82 PathProgramCache]: Analyzing trace with hash -987685255, now seen corresponding path program 2 times [2018-11-23 04:03:07,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:07,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:07,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:03:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:07,860 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-11-23 04:03:07,914 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:03:07,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:03:07,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:03:07,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:03:07,915 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:03:07,915 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:03:07,915 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:03:07,915 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:03:07,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-23 04:03:07,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:03:07,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:03:07,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:07,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,239 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:03:08,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:03:08,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,246 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 04:03:08,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,247 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 04:03:08,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,257 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,257 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:08,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:08,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:08,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,276 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:03:08,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:03:08,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,293 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:03:08,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,294 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:03:08,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:08,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:08,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:08,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:08,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:08,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:08,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:08,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:08,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:03:08,316 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 04:03:08,316 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 04:03:08,316 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:03:08,317 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:03:08,317 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:03:08,317 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-23 04:03:08,379 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 04:03:08,380 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 04:03:08,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:08,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:08,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:08,448 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 04:03:08,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 04:03:08,477 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-11-23 04:03:08,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 04:03:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 04:03:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 04:03:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 04:03:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:08,479 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 04:03:08,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:08,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:08,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:08,559 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 04:03:08,559 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 04:03:08,599 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 7 states. [2018-11-23 04:03:08,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 04:03:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 04:03:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-23 04:03:08,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 04:03:08,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:08,601 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 04:03:08,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:08,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:08,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:08,653 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 04:03:08,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 04:03:08,678 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2018-11-23 04:03:08,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 04:03:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 04:03:08,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-23 04:03:08,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-23 04:03:08,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:08,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-23 04:03:08,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:08,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 04:03:08,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:08,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2018-11-23 04:03:08,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 04:03:08,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 32 transitions. [2018-11-23 04:03:08,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 04:03:08,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-23 04:03:08,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-23 04:03:08,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:03:08,683 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 04:03:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-23 04:03:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 10. [2018-11-23 04:03:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 04:03:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-23 04:03:08,685 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 04:03:08,685 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 04:03:08,685 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:03:08,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-23 04:03:08,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 04:03:08,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:03:08,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:03:08,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:03:08,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 04:03:08,686 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 640#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet7, main_#t~mem8, main_#t~nondet9, main_#t~mem10, main_#t~mem4, main_#t~mem5, main_#t~short6, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 641#L551-2 [2018-11-23 04:03:08,686 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~short6;havoc main_#t~mem5;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-11-23 04:03:08,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 04:03:08,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:08,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:08,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:08,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:03:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:08,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:08,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1142249, now seen corresponding path program 1 times [2018-11-23 04:03:08,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:08,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:08,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:03:08,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:08,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:08,701 INFO L82 PathProgramCache]: Analyzing trace with hash 889569451, now seen corresponding path program 3 times [2018-11-23 04:03:08,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:03:08,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:03:08,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:08,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:03:08,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:03:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:03:08,862 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:03:08,862 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:03:08,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:03:08,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:03:08,862 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:03:08,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:03:08,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:03:08,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:03:08,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig3-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-23 04:03:08,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:03:08,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:03:08,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-11-23 04:03:08,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:08,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 04:03:09,134 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:03:09,134 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:03:09,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-11-23 04:03:09,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:09,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:09,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:09,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,139 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:09,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,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-11-23 04:03:09,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:09,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:09,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:09,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:09,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:09,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:09,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:09,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:09,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,149 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:03:09,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,150 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:03:09,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,154 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:03:09,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:03:09,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:09,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:09,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:09,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:09,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:09,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:03:09,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:03:09,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:03:09,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 04:03:09,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:03:09,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:03:09,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:03:09,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:03:09,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:03:09,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:03:09,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:03:09,176 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:03:09,177 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 04:03:09,177 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 04:03:09,177 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:03:09,177 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 04:03:09,177 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:03:09,177 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_4 Supporting invariants [] [2018-11-23 04:03:09,235 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 04:03:09,237 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 04:03:09,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:03:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:09,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:03:09,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:03:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:03:09,310 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-23 04:03:09,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-23 04:03:09,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 3. Second operand 5 states. Result 26 states and 33 transitions. Complement of second has 8 states. [2018-11-23 04:03:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 04:03:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 04:03:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-23 04:03:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 04:03:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-23 04:03:09,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:09,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-23 04:03:09,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:03:09,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2018-11-23 04:03:09,341 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 04:03:09,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2018-11-23 04:03:09,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 04:03:09,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 04:03:09,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 04:03:09,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:03:09,342 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:03:09,342 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:03:09,342 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:03:09,342 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 04:03:09,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:03:09,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 04:03:09,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 04:03:09,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 04:03:09 BoogieIcfgContainer [2018-11-23 04:03:09,347 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 04:03:09,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:03:09,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:03:09,347 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:03:09,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:03:05" (3/4) ... [2018-11-23 04:03:09,350 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 04:03:09,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:03:09,350 INFO L168 Benchmark]: Toolchain (without parser) took 4665.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.6 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -222.0 MB). Peak memory consumption was 115.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:03:09,351 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:03:09,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -203.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:03:09,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:03:09,352 INFO L168 Benchmark]: Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:03:09,352 INFO L168 Benchmark]: RCFGBuilder took 210.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:03:09,352 INFO L168 Benchmark]: BuchiAutomizer took 4064.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -40.1 MB). Peak memory consumption was 128.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:03:09,353 INFO L168 Benchmark]: Witness Printer took 2.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:03:09,356 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -203.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4064.46 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -40.1 MB). Peak memory consumption was 128.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.64 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 47 SDslu, 18 SDs, 0 SdLazy, 74 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax109 hnf100 lsp86 ukn60 mio100 lsp42 div100 bol100 ite100 ukn100 eq186 hnf88 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms 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...