./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.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_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 687269bb6882b72a3d48999f1e5c55a1d5283a94 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:36:37,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:36:37,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:36:37,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:36:37,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:36:37,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:36:37,034 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:36:37,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:36:37,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:36:37,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:36:37,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:36:37,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:36:37,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:36:37,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:36:37,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:36:37,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:36:37,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:36:37,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:36:37,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:36:37,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:36:37,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:36:37,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:36:37,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:36:37,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:36:37,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:36:37,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:36:37,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:36:37,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:36:37,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:36:37,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:36:37,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:36:37,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:36:37,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:36:37,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:36:37,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:36:37,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:36:37,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:36:37,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:36:37,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:36:37,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:36:37,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:36:37,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 23:36:37,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:36:37,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:36:37,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:36:37,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:36:37,109 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:36:37,109 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 23:36:37,109 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 23:36:37,109 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 23:36:37,110 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 23:36:37,110 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 23:36:37,110 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 23:36:37,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:36:37,110 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:36:37,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:36:37,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:36:37,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 23:36:37,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 23:36:37,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 23:36:37,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:36:37,112 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 23:36:37,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:36:37,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 23:36:37,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:36:37,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:36:37,113 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 23:36:37,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:36:37,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:36:37,113 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 23:36:37,114 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 23:36:37,114 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_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 -> 687269bb6882b72a3d48999f1e5c55a1d5283a94 [2019-11-15 23:36:37,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:36:37,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:36:37,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:36:37,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:36:37,162 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:36:37,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c [2019-11-15 23:36:37,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/data/e41b0049a/14ae397b855341ff8dff92eed15b943a/FLAGf50c2afcf [2019-11-15 23:36:37,622 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:36:37,623 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum.c [2019-11-15 23:36:37,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/data/e41b0049a/14ae397b855341ff8dff92eed15b943a/FLAGf50c2afcf [2019-11-15 23:36:37,645 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/data/e41b0049a/14ae397b855341ff8dff92eed15b943a [2019-11-15 23:36:37,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:36:37,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:36:37,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:37,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:36:37,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:36:37,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69750992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37, skipping insertion in model container [2019-11-15 23:36:37,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,671 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:36:37,687 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:36:37,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:37,925 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:36:37,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:36:37,950 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:36:37,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37 WrapperNode [2019-11-15 23:36:37,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:36:37,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:37,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:36:37,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:36:37,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:36:37,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:36:37,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:36:37,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:36:37,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... [2019-11-15 23:36:37,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:36:37,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:36:37,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:36:37,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:36:37,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:38,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:36:38,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:36:38,216 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:36:38,216 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 23:36:38,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:38 BoogieIcfgContainer [2019-11-15 23:36:38,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:36:38,218 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 23:36:38,218 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 23:36:38,222 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 23:36:38,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:36:38,231 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 11:36:37" (1/3) ... [2019-11-15 23:36:38,232 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24239b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:36:38, skipping insertion in model container [2019-11-15 23:36:38,232 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:36:38,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:37" (2/3) ... [2019-11-15 23:36:38,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24239b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 11:36:38, skipping insertion in model container [2019-11-15 23:36:38,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 23:36:38,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:38" (3/3) ... [2019-11-15 23:36:38,234 INFO L371 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum.c [2019-11-15 23:36:38,331 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 23:36:38,332 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 23:36:38,332 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 23:36:38,332 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:36:38,332 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:36:38,332 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 23:36:38,332 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:36:38,333 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 23:36:38,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:36:38,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:36:38,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:38,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:38,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:36:38,368 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:38,368 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 23:36:38,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-15 23:36:38,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:36:38,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:38,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:38,370 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-15 23:36:38,370 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:38,376 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L25-2true [2019-11-15 23:36:38,377 INFO L793 eck$LassoCheckResult]: Loop: 8#L25-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 12#L25true assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4#L26true assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 10#L26-2true main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8#L25-2true [2019-11-15 23:36:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:38,384 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-15 23:36:38,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:38,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062761014] [2019-11-15 23:36:38,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:38,460 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:38,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1234440, now seen corresponding path program 1 times [2019-11-15 23:36:38,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:38,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707208433] [2019-11-15 23:36:38,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:38,477 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash 29863591, now seen corresponding path program 1 times [2019-11-15 23:36:38,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:38,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013810952] [2019-11-15 23:36:38,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:38,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:38,500 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:38,577 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:38,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:38,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:38,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:38,579 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:38,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:38,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:38,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration1_Loop [2019-11-15 23:36:38,580 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:38,580 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:38,598 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 23:36:38,608 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 23:36:38,611 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 23:36:38,620 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 23:36:38,759 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:38,771 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:36:38,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:38,792 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:38,800 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_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:36:38,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:38,815 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,819 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:38,820 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_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,832 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:38,832 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:38,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:38,837 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:38,847 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:38,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:38,904 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:38,906 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:38,906 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:38,906 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:38,906 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:38,906 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:38,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:38,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:38,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:38,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration1_Loop [2019-11-15 23:36:38,907 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:38,907 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:38,909 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 23:36:38,913 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 23:36:38,917 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 23:36:38,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:36:39,036 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:39,041 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:39,042 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 23:36:39,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:39,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:39,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:39,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:39,052 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:39,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:39,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:39,073 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 23:36:39,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:39,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:39,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:39,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:39,076 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:39,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:39,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:39,090 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 23:36:39,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:39,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:39,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:39,092 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:36:39,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:39,094 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:36:39,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:39,116 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:39,117 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 23:36:39,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:39,117 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:39,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:39,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:39,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:39,119 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:39,119 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:39,136 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:39,145 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:39,145 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:39,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:39,147 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:39,147 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:39,148 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:39,150 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:39,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:39,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:39,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:36:39,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:39,242 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 23:36:39,257 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:39,258 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-11-15 23:36:39,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 40 states and 55 transitions. Complement of second has 8 states. [2019-11-15 23:36:39,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-15 23:36:39,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-15 23:36:39,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-15 23:36:39,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 8 letters. [2019-11-15 23:36:39,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:39,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 55 transitions. [2019-11-15 23:36:39,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:36:39,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 21 states and 30 transitions. [2019-11-15 23:36:39,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 23:36:39,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-15 23:36:39,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-11-15 23:36:39,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:39,358 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 23:36:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-11-15 23:36:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2019-11-15 23:36:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-15 23:36:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-11-15 23:36:39,385 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 23:36:39,385 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-11-15 23:36:39,386 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 23:36:39,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2019-11-15 23:36:39,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:36:39,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:39,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:39,389 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 23:36:39,389 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:39,389 INFO L791 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 103#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 106#L25 [2019-11-15 23:36:39,389 INFO L793 eck$LassoCheckResult]: Loop: 106#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 97#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 98#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 105#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 106#L25 [2019-11-15 23:36:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-11-15 23:36:39,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:39,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220905724] [2019-11-15 23:36:39,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,408 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1328732, now seen corresponding path program 1 times [2019-11-15 23:36:39,409 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:39,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972109713] [2019-11-15 23:36:39,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,433 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:39,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash 925773253, now seen corresponding path program 1 times [2019-11-15 23:36:39,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:39,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699087419] [2019-11-15 23:36:39,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,452 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:39,485 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:39,485 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:39,485 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:39,485 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:39,485 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:39,486 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:39,486 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:39,486 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:39,486 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration2_Loop [2019-11-15 23:36:39,486 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:39,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:39,487 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 23:36:39,493 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 23:36:39,506 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 23:36:39,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:36:39,592 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:39,593 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:39,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:39,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:39,609 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:39,609 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_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:36:39,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:39,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:39,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:39,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:39,729 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:39,731 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:39,731 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:39,731 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:39,731 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:39,731 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:39,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:39,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:39,732 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:39,732 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration2_Loop [2019-11-15 23:36:39,732 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:39,732 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:39,734 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 23:36:39,747 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 23:36:39,765 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 23:36:39,768 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 23:36:39,846 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:39,846 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:39,846 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 23:36:39,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:39,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:39,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:39,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:39,849 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:39,849 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:39,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:39,852 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 23:36:39,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:39,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:39,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:39,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:39,853 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:39,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:39,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:39,872 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:39,877 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:39,877 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:39,877 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:39,878 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:39,878 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:39,878 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:39,878 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:39,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:39,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:39,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:39,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:39,928 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 23:36:39,929 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 23:36:39,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-11-15 23:36:39,964 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 30 states and 44 transitions. Complement of second has 7 states. [2019-11-15 23:36:39,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-15 23:36:39,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 23:36:39,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:39,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 23:36:39,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:39,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 23:36:39,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:39,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2019-11-15 23:36:39,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:36:39,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 21 states and 30 transitions. [2019-11-15 23:36:39,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 23:36:39,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 23:36:39,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2019-11-15 23:36:39,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:39,970 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-15 23:36:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2019-11-15 23:36:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-15 23:36:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 23:36:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-11-15 23:36:39,973 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:36:39,973 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-11-15 23:36:39,973 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 23:36:39,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-11-15 23:36:39,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:36:39,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:39,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:39,976 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 23:36:39,976 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:39,976 INFO L791 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 191#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 198#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 192#L33 [2019-11-15 23:36:39,976 INFO L793 eck$LassoCheckResult]: Loop: 192#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 184#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 185#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 199#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 192#L33 [2019-11-15 23:36:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:39,977 INFO L82 PathProgramCache]: Analyzing trace with hash 31084, now seen corresponding path program 1 times [2019-11-15 23:36:39,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:39,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985578559] [2019-11-15 23:36:39,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:39,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:39,999 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 1 times [2019-11-15 23:36:40,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:40,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123800155] [2019-11-15 23:36:40,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,000 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,006 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1357271332, now seen corresponding path program 1 times [2019-11-15 23:36:40,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:40,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060807857] [2019-11-15 23:36:40,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:40,053 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:40,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:40,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:40,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:40,054 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:40,054 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:40,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:40,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:40,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration3_Loop [2019-11-15 23:36:40,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:40,054 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:40,056 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 23:36:40,059 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 23:36:40,062 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 23:36:40,079 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 23:36:40,159 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:40,159 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:40,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:40,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:40,181 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:40,181 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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) [2019-11-15 23:36:40,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:40,196 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:40,200 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:40,201 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_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:40,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:40,215 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_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:40,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:40,236 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:40,339 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:40,341 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:40,341 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:40,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:40,342 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:40,342 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:40,342 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:40,342 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:40,342 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:40,342 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration3_Loop [2019-11-15 23:36:40,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:40,343 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:40,344 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 23:36:40,347 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 23:36:40,350 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 23:36:40,362 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 23:36:40,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:40,428 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:40,429 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 23:36:40,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:40,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:40,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:40,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:40,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:40,431 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:40,431 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:40,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:40,432 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 23:36:40,433 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:40,433 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:40,433 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:40,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:40,435 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:40,435 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:40,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:40,439 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 23:36:40,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:40,439 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:40,440 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:40,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:40,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:40,441 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:40,441 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:40,447 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:40,452 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:40,454 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:40,455 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:40,455 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:40,456 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:40,456 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-15 23:36:40,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:40,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:40,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:40,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:40,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:40,513 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 23:36:40,513 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:40,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 23:36:40,555 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 32 states and 48 transitions. Complement of second has 7 states. [2019-11-15 23:36:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 23:36:40,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 23:36:40,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:40,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 23:36:40,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:40,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 8 letters. [2019-11-15 23:36:40,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:40,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 48 transitions. [2019-11-15 23:36:40,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:36:40,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 38 transitions. [2019-11-15 23:36:40,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 23:36:40,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 23:36:40,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 38 transitions. [2019-11-15 23:36:40,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:40,562 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-11-15 23:36:40,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 38 transitions. [2019-11-15 23:36:40,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-15 23:36:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 23:36:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-11-15 23:36:40,574 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-15 23:36:40,574 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-11-15 23:36:40,574 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 23:36:40,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2019-11-15 23:36:40,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 23:36:40,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:40,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:40,578 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 23:36:40,578 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:40,578 INFO L791 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 291#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 298#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 292#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 283#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 284#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 302#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 285#L26 [2019-11-15 23:36:40,579 INFO L793 eck$LassoCheckResult]: Loop: 285#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 286#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 282#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 301#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 285#L26 [2019-11-15 23:36:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:40,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1357211759, now seen corresponding path program 1 times [2019-11-15 23:36:40,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:40,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478704440] [2019-11-15 23:36:40,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,580 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,596 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:40,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:40,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1419720, now seen corresponding path program 2 times [2019-11-15 23:36:40,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:40,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231769080] [2019-11-15 23:36:40,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,607 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash -369493672, now seen corresponding path program 1 times [2019-11-15 23:36:40,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:40,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689591993] [2019-11-15 23:36:40,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:40,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:40,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:40,640 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:40,640 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:40,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:40,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:40,640 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:40,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:40,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:40,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:40,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration4_Loop [2019-11-15 23:36:40,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:40,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:40,642 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 23:36:40,645 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 23:36:40,655 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 23:36:40,657 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 23:36:40,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:40,715 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:40,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:40,720 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 23:36:40,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:40,728 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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) [2019-11-15 23:36:40,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:40,743 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:40,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:40,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:40,919 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:40,922 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:40,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:40,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:40,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:40,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:40,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:40,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:40,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:40,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration4_Loop [2019-11-15 23:36:40,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:40,923 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:40,924 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 23:36:40,930 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 23:36:40,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:36:40,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:36:41,038 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:41,038 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:41,039 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 23:36:41,039 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:41,040 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:41,040 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:41,040 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:36:41,040 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:41,041 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:36:41,041 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:41,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:41,044 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 23:36:41,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:41,045 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:41,045 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:41,045 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:41,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:41,046 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:41,046 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:41,051 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:41,053 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:41,054 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:41,054 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:41,054 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:41,054 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:41,055 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:41,055 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,104 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 23:36:41,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:41,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-15 23:36:41,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 78 states and 116 transitions. Complement of second has 7 states. [2019-11-15 23:36:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-15 23:36:41,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 23:36:41,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 23:36:41,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 23:36:41,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 116 transitions. [2019-11-15 23:36:41,151 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:36:41,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 55 states and 80 transitions. [2019-11-15 23:36:41,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 23:36:41,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-15 23:36:41,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 80 transitions. [2019-11-15 23:36:41,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:41,153 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-15 23:36:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 80 transitions. [2019-11-15 23:36:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-15 23:36:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 23:36:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2019-11-15 23:36:41,159 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2019-11-15 23:36:41,159 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 63 transitions. [2019-11-15 23:36:41,159 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 23:36:41,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 63 transitions. [2019-11-15 23:36:41,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2019-11-15 23:36:41,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:41,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:41,161 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:41,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:41,161 INFO L791 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 451#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 459#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 460#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 476#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 475#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 472#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 470#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 446#L26-2 [2019-11-15 23:36:41,162 INFO L793 eck$LassoCheckResult]: Loop: 446#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 482#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 465#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 445#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 446#L26-2 [2019-11-15 23:36:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash 876108449, now seen corresponding path program 1 times [2019-11-15 23:36:41,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250540879] [2019-11-15 23:36:41,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,171 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:41,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1529372, now seen corresponding path program 2 times [2019-11-15 23:36:41,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672409096] [2019-11-15 23:36:41,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,177 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1432445116, now seen corresponding path program 1 times [2019-11-15 23:36:41,178 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005268395] [2019-11-15 23:36:41,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,188 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:41,243 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:41,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:41,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:41,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:41,244 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:41,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:41,244 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:41,244 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:41,244 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration5_Loop [2019-11-15 23:36:41,244 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:41,244 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:41,245 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 23:36:41,257 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 23:36:41,261 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 23:36:41,263 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 23:36:41,340 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:41,340 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:41,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:41,347 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:41,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:41,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:41,374 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:41,376 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:41,376 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:41,376 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:41,377 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:41,377 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:41,377 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:41,377 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:41,377 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:41,377 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration5_Loop [2019-11-15 23:36:41,377 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:41,377 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:41,378 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 23:36:41,387 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 23:36:41,398 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 23:36:41,400 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 23:36:41,462 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:41,462 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:41,463 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 23:36:41,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:41,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:41,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:41,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:41,464 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:41,464 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:41,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:41,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 23:36:41,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:41,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:41,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:41,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:41,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:41,467 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:41,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:41,470 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:41,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:41,474 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:41,475 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:41,475 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:41,475 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:41,475 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:41,475 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,516 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 23:36:41,516 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 23:36:41,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28 Second operand 4 states. [2019-11-15 23:36:41,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 63 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 106 states and 158 transitions. Complement of second has 7 states. [2019-11-15 23:36:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 23:36:41,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 23:36:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 4 letters. [2019-11-15 23:36:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 8 letters. Loop has 8 letters. [2019-11-15 23:36:41,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 158 transitions. [2019-11-15 23:36:41,552 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 23:36:41,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 90 states and 129 transitions. [2019-11-15 23:36:41,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 23:36:41,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 23:36:41,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 129 transitions. [2019-11-15 23:36:41,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:41,554 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 129 transitions. [2019-11-15 23:36:41,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 129 transitions. [2019-11-15 23:36:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-11-15 23:36:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 23:36:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2019-11-15 23:36:41,568 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2019-11-15 23:36:41,568 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 111 transitions. [2019-11-15 23:36:41,568 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 23:36:41,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 111 transitions. [2019-11-15 23:36:41,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-15 23:36:41,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:41,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:41,570 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:41,570 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:41,571 INFO L791 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 658#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 666#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 667#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 682#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 681#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 679#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 677#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 676#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 675#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 671#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 672#L33 [2019-11-15 23:36:41,571 INFO L793 eck$LassoCheckResult]: Loop: 672#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 721#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 719#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 718#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 672#L33 [2019-11-15 23:36:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 2 times [2019-11-15 23:36:41,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551548583] [2019-11-15 23:36:41,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,584 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1696497, now seen corresponding path program 2 times [2019-11-15 23:36:41,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959009793] [2019-11-15 23:36:41,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,590 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash -4707247, now seen corresponding path program 1 times [2019-11-15 23:36:41,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:41,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858609095] [2019-11-15 23:36:41,591 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:41,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:41,601 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:41,628 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:41,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:41,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:41,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:41,629 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:41,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:41,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:41,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:41,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration6_Loop [2019-11-15 23:36:41,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:41,629 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:41,630 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 23:36:41,641 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 23:36:41,643 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 23:36:41,646 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 23:36:41,698 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:41,698 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:41,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:41,705 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/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 23:36:41,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:41,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:41,789 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:41,791 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:41,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:41,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:41,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:41,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:41,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:41,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:41,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:41,792 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration6_Loop [2019-11-15 23:36:41,792 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:41,792 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:41,793 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 23:36:41,805 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 23:36:41,815 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 23:36:41,820 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 23:36:41,875 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:41,875 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:41,875 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 23:36:41,876 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:41,876 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:41,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:41,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:41,876 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:41,877 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:41,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:41,879 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:41,881 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:41,881 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:41,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:41,882 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:41,882 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:41,882 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-15 23:36:41,882 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:41,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,929 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 23:36:41,929 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:41,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-11-15 23:36:41,958 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 112 states and 173 transitions. Complement of second has 7 states. [2019-11-15 23:36:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:41,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 23:36:41,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 23:36:41,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:41,962 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:36:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:41,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:41,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:42,001 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 23:36:42,001 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:42,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-11-15 23:36:42,027 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 107 states and 160 transitions. Complement of second has 7 states. [2019-11-15 23:36:42,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 23:36:42,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 23:36:42,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,031 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:36:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:42,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:42,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:42,073 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 23:36:42,073 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:42,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48 Second operand 4 states. [2019-11-15 23:36:42,098 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 111 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 128 states and 203 transitions. Complement of second has 8 states. [2019-11-15 23:36:42,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-15 23:36:42,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 23:36:42,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:36:42,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-15 23:36:42,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 203 transitions. [2019-11-15 23:36:42,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2019-11-15 23:36:42,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 97 states and 147 transitions. [2019-11-15 23:36:42,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-15 23:36:42,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-15 23:36:42,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 147 transitions. [2019-11-15 23:36:42,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:42,105 INFO L688 BuchiCegarLoop]: Abstraction has 97 states and 147 transitions. [2019-11-15 23:36:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 147 transitions. [2019-11-15 23:36:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 66. [2019-11-15 23:36:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 23:36:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2019-11-15 23:36:42,113 INFO L711 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2019-11-15 23:36:42,113 INFO L591 BuchiCegarLoop]: Abstraction has 66 states and 100 transitions. [2019-11-15 23:36:42,113 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 23:36:42,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 100 transitions. [2019-11-15 23:36:42,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-15 23:36:42,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:42,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:42,117 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 23:36:42,117 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:42,117 INFO L791 eck$LassoCheckResult]: Stem: 1259#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1260#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1282#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1283#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 1286#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1285#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1268#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1261#L33 [2019-11-15 23:36:42,117 INFO L793 eck$LassoCheckResult]: Loop: 1261#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1252#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1253#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1265#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1254#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1255#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1266#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1316#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1261#L33 [2019-11-15 23:36:42,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 1 times [2019-11-15 23:36:42,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137738340] [2019-11-15 23:36:42,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,124 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 1 times [2019-11-15 23:36:42,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929096008] [2019-11-15 23:36:42,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,131 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,131 INFO L82 PathProgramCache]: Analyzing trace with hash -725918680, now seen corresponding path program 1 times [2019-11-15 23:36:42,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564988611] [2019-11-15 23:36:42,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,141 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:42,194 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:42,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:42,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:42,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:42,195 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:42,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:42,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:42,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration7_Loop [2019-11-15 23:36:42,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:42,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:42,196 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 23:36:42,200 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 23:36:42,202 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 23:36:42,204 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 23:36:42,269 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:42,269 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:42,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:42,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:42,278 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:42,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:42,285 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:42,285 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:36:42,297 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:42,297 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,301 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:42,301 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:36:42,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:42,311 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:42,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:42,474 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:42,475 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:42,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:42,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:42,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:42,475 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:42,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:42,475 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:42,476 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration7_Loop [2019-11-15 23:36:42,476 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:42,476 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:42,476 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 23:36:42,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 23:36:42,481 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 23:36:42,484 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 23:36:42,539 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:42,539 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:42,539 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 23:36:42,539 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:42,539 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:42,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:42,540 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:36:42,540 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:42,540 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:36:42,540 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:42,542 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:42,542 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 23:36:42,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:42,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:42,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:42,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:42,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:42,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:42,545 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:42,545 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 23:36:42,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:42,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:42,546 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:42,546 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:42,547 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:42,547 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:42,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:42,548 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 23:36:42,549 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:42,549 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:42,549 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:42,549 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:42,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:42,550 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:42,550 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:42,553 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:42,555 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:42,555 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:42,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:42,556 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:42,556 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:42,556 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:42,556 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:42,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:42,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:42,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:36:42,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:42,620 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:36:42,620 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43 Second operand 5 states. [2019-11-15 23:36:42,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 100 transitions. cyclomatic complexity: 43. Second operand 5 states. Result 246 states and 366 transitions. Complement of second has 13 states. [2019-11-15 23:36:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:36:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2019-11-15 23:36:42,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 23:36:42,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-15 23:36:42,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2019-11-15 23:36:42,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:42,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 366 transitions. [2019-11-15 23:36:42,715 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2019-11-15 23:36:42,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 208 states and 314 transitions. [2019-11-15 23:36:42,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-15 23:36:42,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-15 23:36:42,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 314 transitions. [2019-11-15 23:36:42,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:42,719 INFO L688 BuchiCegarLoop]: Abstraction has 208 states and 314 transitions. [2019-11-15 23:36:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 314 transitions. [2019-11-15 23:36:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 188. [2019-11-15 23:36:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 23:36:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2019-11-15 23:36:42,732 INFO L711 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2019-11-15 23:36:42,732 INFO L591 BuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2019-11-15 23:36:42,733 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 23:36:42,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. [2019-11-15 23:36:42,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2019-11-15 23:36:42,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:42,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:42,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:42,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:42,735 INFO L791 eck$LassoCheckResult]: Stem: 1652#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1653#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1687#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1685#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 1683#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1682#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1680#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1675#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1676#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1782#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1778#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1771#L33 [2019-11-15 23:36:42,736 INFO L793 eck$LassoCheckResult]: Loop: 1771#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1761#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1762#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1746#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 1672#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1673#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1784#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1781#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 1771#L33 [2019-11-15 23:36:42,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,736 INFO L82 PathProgramCache]: Analyzing trace with hash -369493663, now seen corresponding path program 3 times [2019-11-15 23:36:42,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039865680] [2019-11-15 23:36:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,749 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash -920272584, now seen corresponding path program 2 times [2019-11-15 23:36:42,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497132379] [2019-11-15 23:36:42,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,756 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:42,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -742368616, now seen corresponding path program 2 times [2019-11-15 23:36:42,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:42,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534580749] [2019-11-15 23:36:42,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:42,787 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:42,873 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:42,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:42,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:42,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:42,873 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:42,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:42,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:42,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration8_Loop [2019-11-15 23:36:42,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:42,874 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:42,875 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 23:36:42,878 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 23:36:42,890 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 23:36:42,898 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 23:36:42,967 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:42,967 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:42,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:42,975 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:42,975 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:42,979 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:42,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:42,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:43,120 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:43,121 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:43,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:43,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:43,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:43,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:43,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:43,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:43,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration8_Loop [2019-11-15 23:36:43,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:43,122 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:43,123 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 23:36:43,125 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 23:36:43,135 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 23:36:43,137 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 23:36:43,226 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:43,226 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:43,227 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 23:36:43,227 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:43,227 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:43,227 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:43,227 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:43,228 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:43,229 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:43,231 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:43,231 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 23:36:43,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:43,232 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:43,232 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:43,232 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:43,232 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:43,233 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:43,233 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:43,236 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:43,249 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:43,249 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:43,250 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:43,250 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:43,250 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:43,250 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:43,251 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:43,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:36:43,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:43,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:36:43,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-11-15 23:36:43,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 330 states and 503 transitions. Complement of second has 13 states. [2019-11-15 23:36:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:36:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2019-11-15 23:36:43,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-15 23:36:43,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:43,394 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:36:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:43,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:36:43,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:43,454 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:36:43,455 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-11-15 23:36:43,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 326 states and 483 transitions. Complement of second has 15 states. [2019-11-15 23:36:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:36:43,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2019-11-15 23:36:43,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-15 23:36:43,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:43,543 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:36:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:43,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:43,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:36:43,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:43,593 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 4 loop predicates [2019-11-15 23:36:43,593 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124 Second operand 5 states. [2019-11-15 23:36:43,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 188 states and 287 transitions. cyclomatic complexity: 124. Second operand 5 states. Result 525 states and 786 transitions. Complement of second has 23 states. [2019-11-15 23:36:43,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:36:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2019-11-15 23:36:43,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 8 letters. [2019-11-15 23:36:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:43,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 19 letters. Loop has 8 letters. [2019-11-15 23:36:43,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:43,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 34 transitions. Stem has 11 letters. Loop has 16 letters. [2019-11-15 23:36:43,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:43,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 525 states and 786 transitions. [2019-11-15 23:36:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 86 [2019-11-15 23:36:43,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 525 states to 342 states and 512 transitions. [2019-11-15 23:36:43,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2019-11-15 23:36:43,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2019-11-15 23:36:43,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 512 transitions. [2019-11-15 23:36:43,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:43,688 INFO L688 BuchiCegarLoop]: Abstraction has 342 states and 512 transitions. [2019-11-15 23:36:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 512 transitions. [2019-11-15 23:36:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 205. [2019-11-15 23:36:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 23:36:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 317 transitions. [2019-11-15 23:36:43,701 INFO L711 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2019-11-15 23:36:43,701 INFO L591 BuchiCegarLoop]: Abstraction has 205 states and 317 transitions. [2019-11-15 23:36:43,701 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 23:36:43,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 317 transitions. [2019-11-15 23:36:43,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2019-11-15 23:36:43,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:43,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:43,704 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2019-11-15 23:36:43,704 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-15 23:36:43,704 INFO L791 eck$LassoCheckResult]: Stem: 3285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 3286#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3327#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 3328#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 3362#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3335#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3299#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 3300#L33 [2019-11-15 23:36:43,704 INFO L793 eck$LassoCheckResult]: Loop: 3300#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 3421#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3422#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3412#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 3414#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 3470#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3469#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3415#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 3300#L33 [2019-11-15 23:36:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1365800207, now seen corresponding path program 2 times [2019-11-15 23:36:43,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419133370] [2019-11-15 23:36:43,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:43,712 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1729619210, now seen corresponding path program 1 times [2019-11-15 23:36:43,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824955325] [2019-11-15 23:36:43,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:43,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1535265306, now seen corresponding path program 1 times [2019-11-15 23:36:43,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:43,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230597688] [2019-11-15 23:36:43,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:43,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:43,731 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:43,778 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:43,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:43,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:43,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:43,778 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:43,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:43,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:43,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration9_Loop [2019-11-15 23:36:43,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:43,779 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:43,780 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 23:36:43,782 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 23:36:43,784 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 23:36:43,795 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 23:36:43,882 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:43,882 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 23:36:43,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:43,886 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,889 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:43,889 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:43,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:43,896 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:43,897 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:43,901 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:43,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:43,987 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:43,988 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:43,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:43,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:43,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:43,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:43,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:43,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:43,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:43,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration9_Loop [2019-11-15 23:36:43,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:43,989 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:43,989 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 23:36:44,004 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 23:36:44,006 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 23:36:44,037 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 23:36:44,084 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:44,085 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:44,085 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 23:36:44,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:44,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:44,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:44,085 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:44,086 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:44,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:44,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:44,088 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 23:36:44,088 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:44,088 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:44,089 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:44,089 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 23:36:44,089 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:44,089 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 23:36:44,089 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:44,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:44,091 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 23:36:44,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:44,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:44,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:44,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:44,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:44,092 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:44,092 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:44,096 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:44,098 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:44,098 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:44,099 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:44,099 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:44,099 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:44,099 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:44,099 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:36:44,173 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-15 23:36:44,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133 Second operand 5 states. [2019-11-15 23:36:44,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 205 states and 317 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 490 states and 759 transitions. Complement of second has 12 states. [2019-11-15 23:36:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 23:36:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2019-11-15 23:36:44,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 8 letters. [2019-11-15 23:36:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-15 23:36:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 30 transitions. Stem has 7 letters. Loop has 16 letters. [2019-11-15 23:36:44,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 490 states and 759 transitions. [2019-11-15 23:36:44,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 23:36:44,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 490 states to 285 states and 426 transitions. [2019-11-15 23:36:44,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 23:36:44,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-15 23:36:44,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 426 transitions. [2019-11-15 23:36:44,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 23:36:44,281 INFO L688 BuchiCegarLoop]: Abstraction has 285 states and 426 transitions. [2019-11-15 23:36:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 426 transitions. [2019-11-15 23:36:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2019-11-15 23:36:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-15 23:36:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2019-11-15 23:36:44,289 INFO L711 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2019-11-15 23:36:44,289 INFO L591 BuchiCegarLoop]: Abstraction has 193 states and 295 transitions. [2019-11-15 23:36:44,289 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 23:36:44,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 295 transitions. [2019-11-15 23:36:44,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-15 23:36:44,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 23:36:44,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 23:36:44,291 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 1, 1, 1, 1] [2019-11-15 23:36:44,291 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 23:36:44,292 INFO L791 eck$LassoCheckResult]: Stem: 4063#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 4064#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4084#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4088#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4085#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4087#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4081#L25 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; 4082#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 4134#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 4131#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4128#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4130#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4141#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4140#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4137#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4079#L26 [2019-11-15 23:36:44,292 INFO L793 eck$LassoCheckResult]: Loop: 4079#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 4074#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 4075#L25-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 4078#L25 assume 0 != main_#t~nondet2;havoc main_#t~nondet2; 4079#L26 [2019-11-15 23:36:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,292 INFO L82 PathProgramCache]: Analyzing trace with hash -725859107, now seen corresponding path program 1 times [2019-11-15 23:36:44,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:44,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803419482] [2019-11-15 23:36:44,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:44,300 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:44,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1479302, now seen corresponding path program 3 times [2019-11-15 23:36:44,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:44,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975617661] [2019-11-15 23:36:44,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:44,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:44,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,306 INFO L82 PathProgramCache]: Analyzing trace with hash -517142174, now seen corresponding path program 2 times [2019-11-15 23:36:44,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:36:44,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931565033] [2019-11-15 23:36:44,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:36:44,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:36:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:36:44,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:36:44,333 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:44,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:44,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:44,333 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:44,333 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 23:36:44,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:44,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:44,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:44,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration10_Loop [2019-11-15 23:36:44,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:44,334 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:44,334 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 23:36:44,340 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 23:36:44,342 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 23:36:44,350 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 23:36:44,399 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:44,399 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:44,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:44,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:44,405 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:44,405 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:44,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:44,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:44,412 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 23:36:44,412 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:44,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 23:36:44,416 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e3c6c865-64d7-467e-a421-f6f34a207b6b/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:44,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 23:36:44,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 23:36:44,505 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 23:36:44,506 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 23:36:44,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 23:36:44,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 23:36:44,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 23:36:44,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 23:36:44,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 23:36:44,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 23:36:44,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 23:36:44,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum.c_Iteration10_Loop [2019-11-15 23:36:44,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 23:36:44,507 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 23:36:44,508 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 23:36:44,512 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 23:36:44,516 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 23:36:44,524 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 23:36:44,564 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 23:36:44,564 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 23:36:44,564 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 23:36:44,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:44,565 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:44,565 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:44,565 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:44,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:44,566 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:44,566 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:44,567 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 23:36:44,567 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:44,567 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:44,567 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:44,567 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:44,568 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 23:36:44,568 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 23:36:44,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 23:36:44,570 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 23:36:44,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 23:36:44,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 23:36:44,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 23:36:44,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 23:36:44,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 23:36:44,571 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 23:36:44,571 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 23:36:44,573 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 23:36:44,574 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 23:36:44,574 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 23:36:44,575 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 23:36:44,575 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 23:36:44,575 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 23:36:44,575 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-11-15 23:36:44,575 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 23:36:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,646 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 23:36:44,646 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:44,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2019-11-15 23:36:44,669 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 302 states and 452 transitions. Complement of second has 7 states. [2019-11-15 23:36:44,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 23:36:44,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:36:44,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,673 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:36:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,709 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 23:36:44,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 23:36:44,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2019-11-15 23:36:44,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 313 states and 443 transitions. Complement of second has 7 states. [2019-11-15 23:36:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:44,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 23:36:44,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:36:44,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,743 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 23:36:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:36:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:36:44,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:36:44,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:36:44,797 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 23:36:44,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 3 loop predicates [2019-11-15 23:36:44,797 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126 Second operand 4 states. [2019-11-15 23:36:44,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 193 states and 295 transitions. cyclomatic complexity: 126. Second operand 4 states. Result 423 states and 703 transitions. Complement of second has 8 states. [2019-11-15 23:36:44,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 23:36:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 23:36:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-11-15 23:36:44,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-15 23:36:44,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 23:36:44,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 15 letters. Loop has 8 letters. [2019-11-15 23:36:44,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 23:36:44,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 703 transitions. [2019-11-15 23:36:44,829 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:36:44,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 0 states and 0 transitions. [2019-11-15 23:36:44,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 23:36:44,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 23:36:44,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 23:36:44,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 23:36:44,829 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:36:44,829 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:36:44,830 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:36:44,830 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 23:36:44,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:36:44,830 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 23:36:44,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 23:36:44,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 11:36:44 BoogieIcfgContainer [2019-11-15 23:36:44,836 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 23:36:44,836 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:36:44,836 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:36:44,836 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:36:44,837 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:38" (3/4) ... [2019-11-15 23:36:44,839 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:36:44,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:36:44,841 INFO L168 Benchmark]: Toolchain (without parser) took 7191.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -202.3 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,841 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:36:44,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.39 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 23:36:44,843 INFO L168 Benchmark]: Boogie Preprocessor took 15.38 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 23:36:44,843 INFO L168 Benchmark]: RCFGBuilder took 222.95 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,844 INFO L168 Benchmark]: BuchiAutomizer took 6618.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -45.6 MB). Peak memory consumption was 135.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:36:44,844 INFO L168 Benchmark]: Witness Printer took 3.45 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:36:44,846 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.39 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 15.38 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 222.95 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6618.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -45.6 MB). Peak memory consumption was 135.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.45 ms. Allocated memory is still 1.3 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 10 terminating modules (0 trivial, 7 deterministic, 3 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 7 locations. One deterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 316 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 205 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 191 SDtfs, 249 SDslu, 111 SDs, 0 SdLazy, 311 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT10 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax150 hnf98 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf93 smp100 dnf100 smp100 tf107 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...