./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.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_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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 31d0c4253184c01eb9f9573658b07bed7aa94585 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:29:40,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:29:40,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:29:40,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:29:40,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:29:40,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:29:40,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:29:40,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:29:40,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:29:40,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:29:40,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:29:40,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:29:40,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:29:40,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:29:40,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:29:40,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:29:40,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:29:40,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:29:40,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:29:40,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:29:40,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:29:40,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:29:40,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:29:40,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:29:40,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:29:40,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:29:40,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:29:40,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:29:40,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:29:40,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:29:40,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:29:40,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:29:40,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:29:40,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:29:40,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:29:40,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:29:40,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:29:40,723 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:29:40,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:29:40,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:29:40,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:29:40,726 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:29:40,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:29:40,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:29:40,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:29:40,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:29:40,747 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:29:40,748 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:29:40,748 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:29:40,748 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:29:40,748 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:29:40,749 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:29:40,750 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:29:40,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:29:40,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:29:40,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:29:40,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:29:40,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:29:40,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:29:40,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:29:40,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:29:40,752 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:29:40,752 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:29:40,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:29:40,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:29:40,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:29:40,753 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:29:40,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:29:40,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:29:40,754 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:29:40,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:29:40,758 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_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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 -> 31d0c4253184c01eb9f9573658b07bed7aa94585 [2019-11-15 21:29:40,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:29:40,813 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:29:40,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:29:40,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:29:40,824 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:29:40,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-11-15 21:29:40,884 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/data/f705c21f3/ffb34ab4eec64ce7ab4012c37e425ce0/FLAG73aaec7bc [2019-11-15 21:29:41,281 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:29:41,282 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2019-11-15 21:29:41,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/data/f705c21f3/ffb34ab4eec64ce7ab4012c37e425ce0/FLAG73aaec7bc [2019-11-15 21:29:41,740 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/data/f705c21f3/ffb34ab4eec64ce7ab4012c37e425ce0 [2019-11-15 21:29:41,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:29:41,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:29:41,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:29:41,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:29:41,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:29:41,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:29:41" (1/1) ... [2019-11-15 21:29:41,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd7c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:41, skipping insertion in model container [2019-11-15 21:29:41,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:29:41" (1/1) ... [2019-11-15 21:29:41,770 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:29:41,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:29:42,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:29:42,051 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:29:42,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:29:42,084 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:29:42,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42 WrapperNode [2019-11-15 21:29:42,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:29:42,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:29:42,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:29:42,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:29:42,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:29:42,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:29:42,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:29:42,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:29:42,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:29:42,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:29:42,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:29:42,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:29:42,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:42,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:29:42,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:29:42,367 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:29:42,368 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 21:29:42,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:42 BoogieIcfgContainer [2019-11-15 21:29:42,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:29:42,370 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:29:42,370 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:29:42,376 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:29:42,377 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:29:42,378 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:29:41" (1/3) ... [2019-11-15 21:29:42,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55c6d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:29:42, skipping insertion in model container [2019-11-15 21:29:42,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:29:42,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (2/3) ... [2019-11-15 21:29:42,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55c6d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:29:42, skipping insertion in model container [2019-11-15 21:29:42,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:29:42,381 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:42" (3/3) ... [2019-11-15 21:29:42,382 INFO L371 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2019-11-15 21:29:42,433 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:29:42,433 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:29:42,433 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:29:42,434 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:29:42,434 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:29:42,434 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:29:42,434 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:29:42,435 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:29:42,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-15 21:29:42,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:29:42,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:42,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:42,479 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:42,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:29:42,479 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:29:42,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-15 21:29:42,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-15 21:29:42,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:42,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:42,481 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:42,482 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 21:29:42,488 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L19-2true [2019-11-15 21:29:42,489 INFO L793 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 9#L21-2true assume !(main_~x2~0 > 1); 8#L21-3true main_~x1~0 := 1 + main_~x1~0; 6#L19-2true [2019-11-15 21:29:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 21:29:42,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094952493] [2019-11-15 21:29:42,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:42,585 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:42,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-11-15 21:29:42,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722205352] [2019-11-15 21:29:42,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:42,629 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-15 21:29:42,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722205352] [2019-11-15 21:29:42,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:42,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:29:42,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697946652] [2019-11-15 21:29:42,634 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:42,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:42,651 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-11-15 21:29:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:42,700 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-15 21:29:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:42,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-15 21:29:42,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:29:42,707 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-11-15 21:29:42,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-15 21:29:42,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-15 21:29:42,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-11-15 21:29:42,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:42,710 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-15 21:29:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-11-15 21:29:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-11-15 21:29:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 21:29:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-11-15 21:29:42,742 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-15 21:29:42,742 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-11-15 21:29:42,743 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:29:42,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-11-15 21:29:42,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 21:29:42,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:42,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:42,744 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:42,744 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 21:29:42,744 INFO L791 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 27#L19-2 [2019-11-15 21:29:42,744 INFO L793 eck$LassoCheckResult]: Loop: 27#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 28#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 30#L21-2 assume !(main_~x2~0 > 1); 29#L21-3 main_~x1~0 := 1 + main_~x1~0; 27#L19-2 [2019-11-15 21:29:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-15 21:29:42,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414385546] [2019-11-15 21:29:42,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:42,752 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-11-15 21:29:42,753 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,753 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389210461] [2019-11-15 21:29:42,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,761 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:42,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389210461] [2019-11-15 21:29:42,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486988232] [2019-11-15 21:29:42,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:42,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:29:42,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:42,846 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:42,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-15 21:29:42,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570470185] [2019-11-15 21:29:42,847 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:42,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:42,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:42,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:42,849 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-15 21:29:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:42,879 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-11-15 21:29:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:29:42,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2019-11-15 21:29:42,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:29:42,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2019-11-15 21:29:42,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-15 21:29:42,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-11-15 21:29:42,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-11-15 21:29:42,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:42,882 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 21:29:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-11-15 21:29:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-11-15 21:29:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-15 21:29:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-15 21:29:42,884 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 21:29:42,884 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-11-15 21:29:42,884 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:29:42,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-11-15 21:29:42,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-15 21:29:42,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:42,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:42,885 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:42,885 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-11-15 21:29:42,885 INFO L791 eck$LassoCheckResult]: Stem: 53#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 54#L19-2 [2019-11-15 21:29:42,886 INFO L793 eck$LassoCheckResult]: Loop: 54#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 55#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 57#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 58#L21-2 assume !(main_~x2~0 > 1); 56#L21-3 main_~x1~0 := 1 + main_~x1~0; 54#L19-2 [2019-11-15 21:29:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-11-15 21:29:42,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290440665] [2019-11-15 21:29:42,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:42,894 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:42,895 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2019-11-15 21:29:42,895 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:42,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183389586] [2019-11-15 21:29:42,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:42,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:42,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183389586] [2019-11-15 21:29:42,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354643059] [2019-11-15 21:29:42,955 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:43,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:29:43,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:29:43,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:29:43,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,008 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:43,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-15 21:29:43,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981198888] [2019-11-15 21:29:43,009 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:43,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:43,010 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-11-15 21:29:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,049 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-11-15 21:29:43,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:43,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-11-15 21:29:43,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 21:29:43,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2019-11-15 21:29:43,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-15 21:29:43,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-15 21:29:43,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-15 21:29:43,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:43,052 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 21:29:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-15 21:29:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 21:29:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 21:29:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-15 21:29:43,053 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 21:29:43,053 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-15 21:29:43,053 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:29:43,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-15 21:29:43,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 21:29:43,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,055 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:43,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2019-11-15 21:29:43,055 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L19-2 [2019-11-15 21:29:43,055 INFO L793 eck$LassoCheckResult]: Loop: 87#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 88#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 90#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 92#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 91#L21-2 assume !(main_~x2~0 > 1); 89#L21-3 main_~x1~0 := 1 + main_~x1~0; 87#L19-2 [2019-11-15 21:29:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-11-15 21:29:43,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009553918] [2019-11-15 21:29:43,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,063 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2019-11-15 21:29:43,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273389181] [2019-11-15 21:29:43,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273389181] [2019-11-15 21:29:43,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223252841] [2019-11-15 21:29:43,119 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:43,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 21:29:43,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:29:43,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:29:43,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:43,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-15 21:29:43,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874872729] [2019-11-15 21:29:43,166 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:43,167 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-11-15 21:29:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,198 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-11-15 21:29:43,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:29:43,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-11-15 21:29:43,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:29:43,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2019-11-15 21:29:43,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:29:43,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-15 21:29:43,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-11-15 21:29:43,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:43,201 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-15 21:29:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-11-15 21:29:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-15 21:29:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 21:29:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-11-15 21:29:43,203 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-15 21:29:43,203 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-11-15 21:29:43,203 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:29:43,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-11-15 21:29:43,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:29:43,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,204 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:43,204 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2019-11-15 21:29:43,204 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 126#L19-2 [2019-11-15 21:29:43,205 INFO L793 eck$LassoCheckResult]: Loop: 126#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 127#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 129#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 132#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 131#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 130#L21-2 assume !(main_~x2~0 > 1); 128#L21-3 main_~x1~0 := 1 + main_~x1~0; 126#L19-2 [2019-11-15 21:29:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,205 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-11-15 21:29:43,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750149610] [2019-11-15 21:29:43,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,212 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2019-11-15 21:29:43,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407280785] [2019-11-15 21:29:43,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407280785] [2019-11-15 21:29:43,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646986975] [2019-11-15 21:29:43,274 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:43,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:29:43,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:29:43,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:29:43,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,322 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:43,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-11-15 21:29:43,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392990517] [2019-11-15 21:29:43,323 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:29:43,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:43,324 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-11-15 21:29:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,372 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-11-15 21:29:43,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:29:43,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-11-15 21:29:43,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:29:43,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-11-15 21:29:43,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:29:43,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:29:43,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-11-15 21:29:43,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:43,377 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 21:29:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-11-15 21:29:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-11-15 21:29:43,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-15 21:29:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-11-15 21:29:43,379 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 21:29:43,379 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-11-15 21:29:43,379 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:29:43,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-11-15 21:29:43,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-15 21:29:43,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,382 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:43,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2019-11-15 21:29:43,383 INFO L791 eck$LassoCheckResult]: Stem: 170#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 171#L19-2 [2019-11-15 21:29:43,383 INFO L793 eck$LassoCheckResult]: Loop: 171#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 172#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 174#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 178#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 177#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 176#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 175#L21-2 assume !(main_~x2~0 > 1); 173#L21-3 main_~x1~0 := 1 + main_~x1~0; 171#L19-2 [2019-11-15 21:29:43,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,383 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-11-15 21:29:43,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170310466] [2019-11-15 21:29:43,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,399 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:43,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2019-11-15 21:29:43,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284924960] [2019-11-15 21:29:43,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284924960] [2019-11-15 21:29:43,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314190497] [2019-11-15 21:29:43,493 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:43,530 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-15 21:29:43,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:29:43,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:29:43,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:43,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-15 21:29:43,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896574975] [2019-11-15 21:29:43,541 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:29:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:43,542 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-11-15 21:29:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,577 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-11-15 21:29:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:43,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-11-15 21:29:43,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:29:43,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-11-15 21:29:43,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-15 21:29:43,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-15 21:29:43,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-11-15 21:29:43,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:43,579 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 21:29:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-11-15 21:29:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-15 21:29:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-15 21:29:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-15 21:29:43,581 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 21:29:43,581 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-15 21:29:43,581 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:29:43,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-11-15 21:29:43,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 21:29:43,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:43,583 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2019-11-15 21:29:43,583 INFO L791 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 222#L19-2 [2019-11-15 21:29:43,583 INFO L793 eck$LassoCheckResult]: Loop: 222#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 223#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 225#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 230#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 229#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 228#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 227#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 226#L21-2 assume !(main_~x2~0 > 1); 224#L21-3 main_~x1~0 := 1 + main_~x1~0; 222#L19-2 [2019-11-15 21:29:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,583 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-11-15 21:29:43,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831686126] [2019-11-15 21:29:43,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,589 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:43,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2019-11-15 21:29:43,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360140341] [2019-11-15 21:29:43,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360140341] [2019-11-15 21:29:43,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057940002] [2019-11-15 21:29:43,688 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:43,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-15 21:29:43,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:29:43,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:29:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,739 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:43,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-15 21:29:43,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703848056] [2019-11-15 21:29:43,740 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:29:43,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:29:43,741 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2019-11-15 21:29:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,779 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-11-15 21:29:43,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:29:43,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-11-15 21:29:43,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:29:43,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-11-15 21:29:43,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:29:43,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:29:43,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-11-15 21:29:43,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:43,782 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-15 21:29:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-11-15 21:29:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 21:29:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:29:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-11-15 21:29:43,784 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-15 21:29:43,784 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-11-15 21:29:43,784 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:29:43,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-11-15 21:29:43,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-15 21:29:43,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,785 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:43,786 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2019-11-15 21:29:43,786 INFO L791 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 279#L19-2 [2019-11-15 21:29:43,786 INFO L793 eck$LassoCheckResult]: Loop: 279#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 280#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 282#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 288#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 287#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 286#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 285#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 284#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 283#L21-2 assume !(main_~x2~0 > 1); 281#L21-3 main_~x1~0 := 1 + main_~x1~0; 279#L19-2 [2019-11-15 21:29:43,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,786 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-11-15 21:29:43,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422967664] [2019-11-15 21:29:43,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,805 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2019-11-15 21:29:43,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424858278] [2019-11-15 21:29:43,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424858278] [2019-11-15 21:29:43,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608149377] [2019-11-15 21:29:43,943 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:29:43,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,980 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:43,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-11-15 21:29:43,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937876304] [2019-11-15 21:29:43,981 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:29:43,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:29:43,982 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-11-15 21:29:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:44,022 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-15 21:29:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:29:44,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-15 21:29:44,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 21:29:44,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-11-15 21:29:44,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 21:29:44,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:29:44,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-11-15 21:29:44,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:44,025 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-15 21:29:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-11-15 21:29:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-15 21:29:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-15 21:29:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-11-15 21:29:44,027 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-15 21:29:44,027 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-11-15 21:29:44,027 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:29:44,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-11-15 21:29:44,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-15 21:29:44,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:44,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:44,028 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:44,028 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2019-11-15 21:29:44,029 INFO L791 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 342#L19-2 [2019-11-15 21:29:44,029 INFO L793 eck$LassoCheckResult]: Loop: 342#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 343#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 345#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 352#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 351#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 350#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 349#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 348#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 347#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 346#L21-2 assume !(main_~x2~0 > 1); 344#L21-3 main_~x1~0 := 1 + main_~x1~0; 342#L19-2 [2019-11-15 21:29:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-11-15 21:29:44,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012663703] [2019-11-15 21:29:44,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,030 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2019-11-15 21:29:44,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295601108] [2019-11-15 21:29:44,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:44,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295601108] [2019-11-15 21:29:44,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707211974] [2019-11-15 21:29:44,170 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:44,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:29:44,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:29:44,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 21:29:44,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:44,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:44,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-11-15 21:29:44,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112937467] [2019-11-15 21:29:44,224 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:44,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:44,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:29:44,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:29:44,226 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2019-11-15 21:29:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:44,273 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-11-15 21:29:44,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:29:44,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-11-15 21:29:44,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 21:29:44,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-11-15 21:29:44,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:29:44,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:29:44,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-11-15 21:29:44,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:44,276 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 21:29:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-11-15 21:29:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-15 21:29:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-15 21:29:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-11-15 21:29:44,278 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 21:29:44,278 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-11-15 21:29:44,278 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:29:44,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-11-15 21:29:44,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 21:29:44,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:44,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:44,280 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 21:29:44,280 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2019-11-15 21:29:44,280 INFO L791 eck$LassoCheckResult]: Stem: 410#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 411#L19-2 [2019-11-15 21:29:44,280 INFO L793 eck$LassoCheckResult]: Loop: 411#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 412#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 414#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 422#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 421#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 420#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 419#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 418#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 417#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 416#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 415#L21-2 assume !(main_~x2~0 > 1); 413#L21-3 main_~x1~0 := 1 + main_~x1~0; 411#L19-2 [2019-11-15 21:29:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-11-15 21:29:44,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267438848] [2019-11-15 21:29:44,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,287 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2019-11-15 21:29:44,287 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102892160] [2019-11-15 21:29:44,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,288 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,327 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2019-11-15 21:29:44,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301930913] [2019-11-15 21:29:44,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:44,369 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:44,525 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-11-15 21:29:44,559 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:29:44,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:29:44,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:29:44,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:29:44,560 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:29:44,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:44,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:29:44,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:29:44,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-11-15 21:29:44,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:29:44,561 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:29:44,579 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-15 21:29:44,588 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-15 21:29:44,595 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-15 21:29:44,603 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-15 21:29:44,694 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:29:44,695 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:44,709 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:44,709 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:44,718 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:29:44,718 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_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:44,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:44,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:44,738 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:29:44,738 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_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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) [2019-11-15 21:29:44,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:44,754 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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) [2019-11-15 21:29:44,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:29:44,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:44,777 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:29:44,780 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:29:44,780 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:29:44,780 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:29:44,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:29:44,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:29:44,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:44,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:29:44,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:29:44,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration10_Loop [2019-11-15 21:29:44,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:29:44,782 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:29:44,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:44,822 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-15 21:29:44,827 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-15 21:29:44,872 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-15 21:29:44,961 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:29:44,965 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:29:44,967 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-15 21:29:44,969 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:44,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:44,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:44,969 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:44,973 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:29:44,974 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:29:44,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:29:44,979 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-15 21:29:44,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:44,982 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:44,982 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:44,982 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:44,984 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:29:44,984 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:29:44,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:29:44,988 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-15 21:29:44,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:44,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:29:44,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:44,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:44,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:44,990 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:29:44,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:29:44,992 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:29:44,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:29:44,995 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 21:29:44,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:29:44,997 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:29:44,997 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:29:44,998 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0) = -2*ULTIMATE.start_main_~x1~0 + 21 Supporting invariants [] [2019-11-15 21:29:45,000 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:29:45,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:29:45,053 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-15 21:29:45,054 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-11-15 21:29:45,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-11-15 21:29:45,081 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-15 21:29:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:29:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 21:29:45,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2019-11-15 21:29:45,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-15 21:29:45,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2019-11-15 21:29:45,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-11-15 21:29:45,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:29:45,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-11-15 21:29:45,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:29:45,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 21:29:45,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-11-15 21:29:45,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:29:45,087 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-11-15 21:29:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-11-15 21:29:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-11-15 21:29:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:29:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-11-15 21:29:45,089 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 21:29:45,089 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-11-15 21:29:45,089 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:29:45,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-11-15 21:29:45,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:29:45,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:45,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:45,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 21:29:45,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:29:45,091 INFO L791 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 508#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 510#L21-2 [2019-11-15 21:29:45,091 INFO L793 eck$LassoCheckResult]: Loop: 510#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 510#L21-2 [2019-11-15 21:29:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-15 21:29:45,091 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994092198] [2019-11-15 21:29:45,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,097 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,097 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-11-15 21:29:45,097 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999027127] [2019-11-15 21:29:45,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,102 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,102 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-11-15 21:29:45,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74194959] [2019-11-15 21:29:45,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,123 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:45,136 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:29:45,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:29:45,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:29:45,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:29:45,137 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:29:45,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:45,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:29:45,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:29:45,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-11-15 21:29:45,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:29:45,138 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:29:45,139 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-15 21:29:45,142 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-15 21:29:45,146 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-15 21:29:45,194 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:29:45,194 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:45,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:45,205 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-15 21:29:45,210 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:29:45,210 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_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:45,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:45,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:45,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:29:45,220 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:45,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:45,232 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:45,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:29:45,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:45,262 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:29:45,278 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:29:45,278 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:29:45,278 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:29:45,278 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:29:45,279 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:29:45,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:45,279 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:29:45,279 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:29:45,279 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration11_Loop [2019-11-15 21:29:45,279 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:29:45,279 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:29:45,280 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-15 21:29:45,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:45,295 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-15 21:29:45,346 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:29:45,346 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:29:45,347 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-15 21:29:45,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:45,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:45,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:45,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:45,349 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:29:45,349 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:29:45,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:29:45,352 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-15 21:29:45,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:45,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:45,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:45,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:45,354 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:29:45,354 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:29:45,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:29:45,358 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-15 21:29:45,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:45,359 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:29:45,359 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:45,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:45,359 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:45,359 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:29:45,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:29:45,363 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:29:45,366 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:29:45,366 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:29:45,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:29:45,366 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:29:45,367 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:29:45,367 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-11-15 21:29:45,367 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:29:45,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,413 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-15 21:29:45,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:29:45,413 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-11-15 21:29:45,424 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2019-11-15 21:29:45,424 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-15 21:29:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:29:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 21:29:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-11-15 21:29:45,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-11-15 21:29:45,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 21:29:45,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-11-15 21:29:45,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:29:45,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2019-11-15 21:29:45,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-15 21:29:45,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-15 21:29:45,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-11-15 21:29:45,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:29:45,427 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-15 21:29:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-11-15 21:29:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-15 21:29:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-15 21:29:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-15 21:29:45,429 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 21:29:45,429 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-15 21:29:45,429 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:29:45,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-15 21:29:45,430 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-15 21:29:45,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:45,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:45,431 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2019-11-15 21:29:45,431 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-15 21:29:45,431 INFO L791 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~x1~0, main_~x2~0;havoc main_~x1~0;havoc main_~x2~0;main_~x1~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x2~0 := main_#t~nondet1;havoc main_#t~nondet1; 583#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 584#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 588#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 596#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 595#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 594#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 593#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 592#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 591#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 590#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 589#L21-2 assume !(main_~x2~0 > 1); 587#L21-3 main_~x1~0 := 1 + main_~x1~0; 585#L19-2 assume !!(main_~x1~0 <= 10);main_~x2~0 := 10; 586#L21-2 [2019-11-15 21:29:45,431 INFO L793 eck$LassoCheckResult]: Loop: 586#L21-2 assume !!(main_~x2~0 > 1);main_~x2~0 := main_~x2~0 - 1; 586#L21-2 [2019-11-15 21:29:45,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,432 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2019-11-15 21:29:45,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73983070] [2019-11-15 21:29:45,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,487 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,488 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-11-15 21:29:45,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299034344] [2019-11-15 21:29:45,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,492 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:45,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2019-11-15 21:29:45,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568777589] [2019-11-15 21:29:45,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:45,516 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:45,532 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:29:45,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:29:45,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:29:45,532 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:29:45,532 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:29:45,532 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:45,532 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:29:45,532 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:29:45,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-11-15 21:29:45,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:29:45,533 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:29:45,534 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-15 21:29:45,537 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-15 21:29:45,543 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-15 21:29:45,581 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:29:45,582 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:45,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:45,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:45,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:29:45,603 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_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:45,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:29:45,608 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_06ee6565-48b5-4274-98f4-79c7b2a7ebb4/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-15 21:29:45,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:29:45,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:29:45,629 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:29:45,632 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:29:45,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:29:45,632 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:29:45,632 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:29:45,632 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:29:45,632 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:45,632 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:29:45,632 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:29:45,632 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration12_Loop [2019-11-15 21:29:45,633 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:29:45,633 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:29:45,634 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-15 21:29:45,637 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-15 21:29:45,644 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-15 21:29:45,681 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:29:45,681 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:29:45,681 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-15 21:29:45,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:45,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:45,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:45,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:45,683 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:29:45,683 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:29:45,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:29:45,686 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-15 21:29:45,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:29:45,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:29:45,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:29:45,687 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:29:45,687 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:29:45,688 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:29:45,688 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:29:45,691 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:29:45,693 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:29:45,693 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:29:45,694 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:29:45,694 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 21:29:45,694 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:29:45,694 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0) = 1*ULTIMATE.start_main_~x2~0 Supporting invariants [] [2019-11-15 21:29:45,695 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 21:29:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,722 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-15 21:29:45,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:29:45,722 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-15 21:29:45,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-11-15 21:29:45,733 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-15 21:29:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:29:45,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 21:29:45,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-15 21:29:45,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,733 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:29:45,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,757 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-15 21:29:45,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-15 21:29:45,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-15 21:29:45,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-11-15 21:29:45,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-15 21:29:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:29:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-15 21:29:45,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-15 21:29:45,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,770 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:29:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:29:45,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:45,796 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-15 21:29:45,797 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 1 loop predicates [2019-11-15 21:29:45,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-11-15 21:29:45,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2019-11-15 21:29:45,804 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-15 21:29:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-11-15 21:29:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-15 21:29:45,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2019-11-15 21:29:45,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2019-11-15 21:29:45,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-11-15 21:29:45,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:29:45,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-11-15 21:29:45,807 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:29:45,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-11-15 21:29:45,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:29:45,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:29:45,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:29:45,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:45,807 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:29:45,807 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:29:45,807 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:29:45,807 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 21:29:45,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:29:45,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:29:45,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:29:45,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:29:45 BoogieIcfgContainer [2019-11-15 21:29:45,813 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:29:45,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:29:45,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:29:45,813 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:29:45,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:42" (3/4) ... [2019-11-15 21:29:45,816 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:29:45,816 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:29:45,818 INFO L168 Benchmark]: Toolchain (without parser) took 4072.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -200.7 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:45,818 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:45,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:45,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:45,819 INFO L168 Benchmark]: Boogie Preprocessor took 14.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:45,820 INFO L168 Benchmark]: RCFGBuilder took 241.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:45,820 INFO L168 Benchmark]: BuchiAutomizer took 3443.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -32.5 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:29:45,821 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:29:45,823 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3443.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -32.5 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 21 SDslu, 50 SDs, 0 SdLazy, 157 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...