./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/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 f9de9875f09e594325a645528f016ce12ac5c646 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:00,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:00,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:00,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:00,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:00,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:00,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:00,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:00,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:00,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:00,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:00,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:00,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:00,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:00,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:00,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:00,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:00,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:00,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:00,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:00,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:00,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:00,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:00,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:00,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:00,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:00,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:00,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:00,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:00,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:00,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:00,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:00,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:00,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:00,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:00,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:00,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:00,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:00,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:00,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:00,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:00,229 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:06:00,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:00,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:00,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:00,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:00,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:00,265 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:06:00,265 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:06:00,265 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:06:00,266 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:06:00,266 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:06:00,266 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:06:00,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:00,267 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:06:00,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:00,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:00,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:06:00,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:06:00,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:06:00,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:00,268 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:06:00,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:00,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:06:00,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:00,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:00,270 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:06:00,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:00,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:00,271 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:06:00,272 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:06:00,272 INFO L138 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/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/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 -> f9de9875f09e594325a645528f016ce12ac5c646 [2019-11-16 00:06:00,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:00,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:00,335 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:00,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:00,338 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:00,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a.c [2019-11-16 00:06:00,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/data/6ae771a1c/6afd0de42412498a8196225916d2eabe/FLAG55e564671 [2019-11-16 00:06:00,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:00,860 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig7a.c [2019-11-16 00:06:00,866 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/data/6ae771a1c/6afd0de42412498a8196225916d2eabe/FLAG55e564671 [2019-11-16 00:06:01,265 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/data/6ae771a1c/6afd0de42412498a8196225916d2eabe [2019-11-16 00:06:01,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:01,269 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:01,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:01,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:01,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:01,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38cb2b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01, skipping insertion in model container [2019-11-16 00:06:01,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:01,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:01,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:01,496 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:01,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:01,623 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:01,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01 WrapperNode [2019-11-16 00:06:01,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:01,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:01,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:01,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:01,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:01,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:01,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:01,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:01,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... [2019-11-16 00:06:01,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:01,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:01,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:01,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:01,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/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 [2019-11-16 00:06:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:01,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:01,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:01,908 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:06:01,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:01 BoogieIcfgContainer [2019-11-16 00:06:01,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:01,910 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:06:01,910 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:06:01,914 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:06:01,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:01,915 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:06:01" (1/3) ... [2019-11-16 00:06:01,917 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c4272b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:06:01, skipping insertion in model container [2019-11-16 00:06:01,918 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:01,918 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:01" (2/3) ... [2019-11-16 00:06:01,919 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c4272b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:06:01, skipping insertion in model container [2019-11-16 00:06:01,919 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:06:01,919 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:01" (3/3) ... [2019-11-16 00:06:01,921 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig7a.c [2019-11-16 00:06:01,999 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:06:01,999 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:06:01,999 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:06:02,000 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:02,000 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:02,000 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:06:02,000 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:02,001 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:06:02,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-16 00:06:02,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:02,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:02,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:02,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:06:02,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:02,045 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:06:02,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-16 00:06:02,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:02,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:02,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:02,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:06:02,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:02,055 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 7#L21-2true [2019-11-16 00:06:02,056 INFO L793 eck$LassoCheckResult]: Loop: 7#L21-2true assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 3#L21true assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L21-2true [2019-11-16 00:06:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-16 00:06:02,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767451438] [2019-11-16 00:06:02,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,172 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-16 00:06:02,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954574509] [2019-11-16 00:06:02,174 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,191 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,193 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-16 00:06:02,193 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991591360] [2019-11-16 00:06:02,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:02,214 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:02,355 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:02,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:02,356 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:02,356 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:02,356 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:02,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:02,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:02,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:02,357 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration1_Loop [2019-11-16 00:06:02,357 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:02,357 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:02,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,560 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:02,561 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:02,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:02,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:02,579 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:02,579 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:02,597 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:02,597 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:02,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:02,604 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:02,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:02,613 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:02,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:02,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:02,641 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:06:02,644 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:02,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:02,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:02,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:02,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:02,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:02,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:02,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:02,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration1_Loop [2019-11-16 00:06:02,645 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:02,645 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:02,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:02,797 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:02,802 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:02,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:02,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:02,808 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:02,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:02,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:02,817 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:02,818 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:02,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:02,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:02,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:02,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:02,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:02,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:02,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:02,850 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:02,868 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:02,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:02,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:02,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:02,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:02,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:02,886 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:02,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:02,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:02,894 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:02,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:02,898 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:02,900 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:02,900 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:02,901 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:02,901 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:06:02,904 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:02,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:02,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:02,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:02,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:02,998 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:02,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-16 00:06:03,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 8 states. [2019-11-16 00:06:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-16 00:06:03,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-16 00:06:03,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:03,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-16 00:06:03,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:03,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-16 00:06:03,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:03,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-16 00:06:03,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:03,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-16 00:06:03,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-16 00:06:03,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-16 00:06:03,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-16 00:06:03,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:03,069 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:06:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-16 00:06:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-16 00:06:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:06:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-16 00:06:03,100 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:06:03,100 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:06:03,100 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:06:03,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-16 00:06:03,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:03,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:03,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:03,102 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:06:03,102 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:03,102 INFO L791 eck$LassoCheckResult]: Stem: 71#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 72#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 67#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 68#L21-2 [2019-11-16 00:06:03,102 INFO L793 eck$LassoCheckResult]: Loop: 68#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 73#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 68#L21-2 [2019-11-16 00:06:03,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,103 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-16 00:06:03,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833704599] [2019-11-16 00:06:03,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,119 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-16 00:06:03,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246785990] [2019-11-16 00:06:03,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,130 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,131 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-16 00:06:03,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693964780] [2019-11-16 00:06:03,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,149 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,191 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:03,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:03,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:03,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:03,192 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:03,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:03,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:03,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration2_Loop [2019-11-16 00:06:03,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:03,193 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:03,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,343 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:03,343 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:03,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:03,358 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,363 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:03,364 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:03,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:03,380 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,389 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:03,390 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=2, ULTIMATE.start_main_~d~0=2} Honda state: {ULTIMATE.start_main_#t~nondet4=2, ULTIMATE.start_main_~d~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,401 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:03,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:03,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:03,408 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=7} Honda state: {ULTIMATE.start_main_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:03,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:03,431 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:03,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:03,473 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:06:03,476 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:03,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:03,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:03,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:03,476 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:03,476 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,476 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:03,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:03,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration2_Loop [2019-11-16 00:06:03,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:03,477 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:03,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,623 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:03,623 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:03,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:03,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:03,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:03,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:03,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:03,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:03,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:03,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:03,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:03,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:03,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:03,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:03,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:03,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:03,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:03,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:03,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:03,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:03,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:03,655 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:03,655 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:03,655 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:06:03,655 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:03,656 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:06:03,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:03,672 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:03,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:03,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:03,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:03,677 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:03,677 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:03,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:03,680 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:03,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:03,684 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:03,693 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:03,697 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:03,698 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:03,698 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:03,698 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:03,699 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:06:03,700 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:03,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:03,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:03,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:03,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:03,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:03,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:03,757 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:06:03,776 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-11-16 00:06:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-16 00:06:03,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-16 00:06:03,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:03,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:06:03,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:03,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-16 00:06:03,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:03,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-16 00:06:03,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:03,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-16 00:06:03,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-16 00:06:03,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:06:03,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-16 00:06:03,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:03,782 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:06:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-16 00:06:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-16 00:06:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:06:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-16 00:06:03,789 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:06:03,790 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:06:03,790 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:06:03,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-16 00:06:03,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:06:03,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:03,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:03,793 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-16 00:06:03,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:03,794 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 126#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 121#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 122#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 129#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 127#L21-2 [2019-11-16 00:06:03,794 INFO L793 eck$LassoCheckResult]: Loop: 127#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 128#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 127#L21-2 [2019-11-16 00:06:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-16 00:06:03,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794956622] [2019-11-16 00:06:03,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-16 00:06:03,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734240677] [2019-11-16 00:06:03,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,868 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:03,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-16 00:06:03,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:03,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996415643] [2019-11-16 00:06:03,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:03,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:03,900 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:03,936 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:03,936 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:03,936 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:03,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:03,936 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:03,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:03,937 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:03,937 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:03,937 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration3_Loop [2019-11-16 00:06:03,937 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:03,937 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:03,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:03,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,090 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:04,090 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,110 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:04,111 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:04,117 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:04,117 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet3=7} Honda state: {ULTIMATE.start_main_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:04,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:04,142 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:04,142 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:04,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:04,166 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:04,166 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4=2, ULTIMATE.start_main_~d~0=2} Honda state: {ULTIMATE.start_main_#t~nondet4=2, ULTIMATE.start_main_~d~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:04,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:04,190 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:04,196 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:04,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:04,214 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:06:04,215 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:04,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:04,237 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:04,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:04,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:04,274 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,280 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:04,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:04,281 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:04,281 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:04,281 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:04,281 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:04,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:04,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration3_Loop [2019-11-16 00:06:04,282 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:04,282 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:04,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,435 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:04,435 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:04,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,437 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-16 00:06:04,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,438 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-16 00:06:04,438 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,442 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,454 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,454 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,454 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,469 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:04,470 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:04,473 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:04,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:04,475 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:04,475 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:04,475 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:04,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:04,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:04,477 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:04,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:04,481 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:04,483 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:04,484 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:04,484 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:04,485 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:04,485 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:04,485 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:06:04,486 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:04,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:04,552 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:06:04,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-16 00:06:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-16 00:06:04,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:06:04,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,574 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:06:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:04,657 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:04,657 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:06:04,674 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-16 00:06:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-16 00:06:04,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:06:04,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,677 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:06:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:04,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:04,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:04,749 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 2 loop predicates [2019-11-16 00:06:04,749 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:06:04,768 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-11-16 00:06:04,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:06:04,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:06:04,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:06:04,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:06:04,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:04,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-16 00:06:04,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:04,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-16 00:06:04,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-16 00:06:04,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:06:04,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-16 00:06:04,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:04,778 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-16 00:06:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-16 00:06:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-16 00:06:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:06:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-16 00:06:04,782 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-16 00:06:04,783 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-16 00:06:04,783 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:06:04,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-16 00:06:04,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:04,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:04,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:04,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:06:04,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:04,785 INFO L791 eck$LassoCheckResult]: Stem: 272#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 269#L21-2 [2019-11-16 00:06:04,786 INFO L793 eck$LassoCheckResult]: Loop: 269#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 268#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 269#L21-2 [2019-11-16 00:06:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-16 00:06:04,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:04,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980481106] [2019-11-16 00:06:04,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:04,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:04,795 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-16 00:06:04,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:04,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607387824] [2019-11-16 00:06:04,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:04,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:04,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:04,821 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-16 00:06:04,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:04,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982827798] [2019-11-16 00:06:04,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:04,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:04,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:04,845 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:04,898 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:04,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:04,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:04,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:04,898 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:04,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:04,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:04,899 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:04,899 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration4_Loop [2019-11-16 00:06:04,899 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:04,899 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:04,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:04,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,082 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:05,082 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,104 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:05,104 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:05,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:06:05,142 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:06:05,144 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:05,144 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:05,144 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:05,144 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:05,145 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:05,145 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,145 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:05,145 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:05,145 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration4_Loop [2019-11-16 00:06:05,145 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:05,145 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:05,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,289 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:05,289 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:05,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,295 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:05,308 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:05,312 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:05,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:05,313 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:05,313 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:05,314 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0) = 1*ULTIMATE.start_main_~d~0 Supporting invariants [] [2019-11-16 00:06:05,314 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:05,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:05,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-16 00:06:05,380 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-11-16 00:06:05,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-16 00:06:05,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-16 00:06:05,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-16 00:06:05,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-16 00:06:05,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-16 00:06:05,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:05,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-16 00:06:05,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-16 00:06:05,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-16 00:06:05,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-16 00:06:05,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:05,385 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-16 00:06:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-16 00:06:05,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-16 00:06:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:06:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-16 00:06:05,387 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-16 00:06:05,387 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-16 00:06:05,387 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:06:05,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-16 00:06:05,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:06:05,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:05,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:05,389 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-16 00:06:05,390 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:06:05,390 INFO L791 eck$LassoCheckResult]: Stem: 318#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 319#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 320#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 321#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 314#L21 [2019-11-16 00:06:05,390 INFO L793 eck$LassoCheckResult]: Loop: 314#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 315#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 314#L21 [2019-11-16 00:06:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-16 00:06:05,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650028133] [2019-11-16 00:06:05,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,400 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:05,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-16 00:06:05,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360926412] [2019-11-16 00:06:05,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash 925765410, now seen corresponding path program 3 times [2019-11-16 00:06:05,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16612514] [2019-11-16 00:06:05,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:05,420 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:05,448 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:05,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:05,448 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:05,448 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:05,448 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:05,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:05,449 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:05,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration5_Loop [2019-11-16 00:06:05,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:05,449 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:05,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,562 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:05,562 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:05,584 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:05,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:05,621 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,670 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:06:05,672 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:05,672 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:05,672 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:05,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:05,672 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:05,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:05,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:05,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:05,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration5_Loop [2019-11-16 00:06:05,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:05,673 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:05,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:05,794 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:05,794 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:05,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,795 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,796 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,797 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:06:05,797 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:06:05,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:06:05,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:05,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:05,801 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:05,801 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:05,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:05,801 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:05,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:05,802 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:05,805 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:05,808 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:05,808 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:05,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:05,809 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:05,809 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:05,809 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~d~0) = 1*ULTIMATE.start_main_~d~0 Supporting invariants [] [2019-11-16 00:06:05,809 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:05,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:05,876 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:05,877 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:06:05,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-11-16 00:06:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:06:05,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:06:05,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,899 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:06:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:05,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:06:05,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:06:05,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-11-16 00:06:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:06:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:06:05,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:05,964 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:06:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:05,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:06,016 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 2 loop predicates [2019-11-16 00:06:06,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:06:06,041 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 19 transitions. Complement of second has 4 states. [2019-11-16 00:06:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:06:06,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:06:06,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:06:06,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:06:06,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:06:06,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 19 transitions. [2019-11-16 00:06:06,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:06:06,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 11 states and 16 transitions. [2019-11-16 00:06:06,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-16 00:06:06,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-16 00:06:06,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-16 00:06:06,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:06:06,047 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:06:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-16 00:06:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2019-11-16 00:06:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:06:06,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-16 00:06:06,049 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:06:06,049 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:06:06,049 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:06:06,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-16 00:06:06,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:06:06,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:06:06,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:06:06,050 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-16 00:06:06,050 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-16 00:06:06,050 INFO L791 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~x~0, main_~y~0, main_~d~0;havoc main_~x~0;havoc main_~y~0;havoc main_~d~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~d~0 := main_#t~nondet2;havoc main_#t~nondet2; 446#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 443#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 444#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 441#L21 [2019-11-16 00:06:06,050 INFO L793 eck$LassoCheckResult]: Loop: 441#L21 assume !(0 != main_#t~nondet3);havoc main_#t~nondet3;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~y~0 := main_~y~0 - 1;main_~d~0 := main_~d~0 - 1; 442#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 443#L21 assume 0 != main_#t~nondet3;havoc main_#t~nondet3;main_~x~0 := main_~x~0 - 1;main_~d~0 := main_#t~nondet4;havoc main_#t~nondet4; 444#L21-2 assume !!((main_~x~0 > 0 && main_~y~0 > 0) && main_~d~0 > 0); 441#L21 [2019-11-16 00:06:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 3 times [2019-11-16 00:06:06,051 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:06,051 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923669193] [2019-11-16 00:06:06,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:06,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-16 00:06:06,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:06,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832441217] [2019-11-16 00:06:06,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:06,069 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 602329151, now seen corresponding path program 4 times [2019-11-16 00:06:06,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:06,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707615179] [2019-11-16 00:06:06,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:06,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:06,090 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:06,157 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:06,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:06,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:06,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:06,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:06:06,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:06,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:06,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:06,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration6_Loop [2019-11-16 00:06:06,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:06,159 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:06,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,309 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:06,309 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:06,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:06:06,325 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2106e46-acc0-4398-8651-07d3bd764c0d/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:06:06,342 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:06:06,343 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:06,400 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:06:06,402 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:06:06,402 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:06:06,402 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:06:06,402 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:06:06,402 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:06:06,402 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:06:06,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:06:06,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:06:06,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig7a.c_Iteration6_Loop [2019-11-16 00:06:06,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:06:06,403 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:06:06,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:06:06,493 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:06:06,494 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:06:06,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:06:06,495 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:06:06,495 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:06:06,495 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:06:06,495 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:06:06,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:06:06,496 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:06:06,496 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:06:06,498 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:06:06,500 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:06:06,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:06:06,501 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:06:06,501 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:06:06,501 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:06:06,501 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-16 00:06:06,502 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:06:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:06,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:06:06,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:06,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:06:06,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:06:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:06,565 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 [2019-11-16 00:06:06,566 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4 Second operand 4 states. [2019-11-16 00:06:06,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 20 states and 29 transitions. Complement of second has 6 states. [2019-11-16 00:06:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:06:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:06:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-11-16 00:06:06,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:06:06,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:06:06,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-16 00:06:06,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:06:06,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. [2019-11-16 00:06:06,590 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:06:06,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-11-16 00:06:06,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:06:06,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:06:06,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:06:06,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:06:06,591 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:06,591 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:06,591 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:06,591 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:06:06,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:06:06,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:06:06,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:06:06,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:06:06 BoogieIcfgContainer [2019-11-16 00:06:06,599 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:06:06,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:06:06,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:06:06,599 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:06:06,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:01" (3/4) ... [2019-11-16 00:06:06,604 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:06:06,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:06:06,606 INFO L168 Benchmark]: Toolchain (without parser) took 5336.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 944.7 MB in the beginning and 876.6 MB in the end (delta: 68.1 MB). Peak memory consumption was 174.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:06,607 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:06,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:06,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:06,609 INFO L168 Benchmark]: Boogie Preprocessor took 23.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:06,609 INFO L168 Benchmark]: RCFGBuilder took 221.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:06,610 INFO L168 Benchmark]: BuchiAutomizer took 4688.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 876.6 MB in the end (delta: 206.2 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:06,610 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.1 GB. Free memory is still 876.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:06,613 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.31 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 221.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4688.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 876.6 MB in the end (delta: 206.2 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.1 GB. Free memory is still 876.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function d and consists of 3 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function d and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 41 SDtfs, 27 SDslu, 8 SDs, 0 SdLazy, 57 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax147 hnf100 lsp27 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf113 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...