./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.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_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c -s /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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 a5e4c58569d8caa47946d30f6cb501096837aef1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:24:00,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:24:00,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:24:00,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:24:00,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:24:00,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:24:00,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:24:00,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:24:00,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:24:00,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:24:00,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:24:00,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:24:00,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:24:00,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:24:00,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:24:00,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:24:00,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:24:00,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:24:00,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:24:00,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:24:00,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:24:00,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:24:00,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:24:00,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:24:00,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:24:00,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:24:00,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:24:00,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:24:00,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:24:00,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:24:00,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:24:00,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:24:00,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:24:00,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:24:00,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:24:00,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:24:00,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:24:00,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:24:00,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:24:00,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:24:00,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:24:00,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:24:00,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:24:00,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:24:00,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:24:00,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:24:00,883 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:24:00,883 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:24:00,883 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:24:00,884 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:24:00,884 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:24:00,884 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:24:00,884 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:24:00,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:24:00,885 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:24:00,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:24:00,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:24:00,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:24:00,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:24:00,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:24:00,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:24:00,887 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:24:00,887 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:24:00,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:24:00,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:24:00,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:24:00,888 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:24:00,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:24:00,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:24:00,889 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:24:00,889 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:24:00,890 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_40ccc811-74df-4576-aa0c-59461bd6a891/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 -> a5e4c58569d8caa47946d30f6cb501096837aef1 [2019-11-16 00:24:00,913 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:24:00,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:24:00,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:24:00,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:24:00,928 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:24:00,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/../../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-16 00:24:00,986 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/data/635252cd9/8ff80ca605274a9a906aa524140b3032/FLAGa04d1fd0a [2019-11-16 00:24:01,357 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:24:01,358 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2019-11-16 00:24:01,363 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/data/635252cd9/8ff80ca605274a9a906aa524140b3032/FLAGa04d1fd0a [2019-11-16 00:24:01,765 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/data/635252cd9/8ff80ca605274a9a906aa524140b3032 [2019-11-16 00:24:01,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:24:01,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:24:01,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:01,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:24:01,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:24:01,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:01" (1/1) ... [2019-11-16 00:24:01,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563a87e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:01, skipping insertion in model container [2019-11-16 00:24:01,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:24:01" (1/1) ... [2019-11-16 00:24:01,783 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:24:01,796 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:24:01,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:01,922 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:24:01,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:24:02,005 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:24:02,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02 WrapperNode [2019-11-16 00:24:02,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:24:02,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:02,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:24:02,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:24:02,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:24:02,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:24:02,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:24:02,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:24:02,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... [2019-11-16 00:24:02,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:24:02,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:24:02,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:24:02,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:24:02,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:24:02,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:24:02,241 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:24:02,242 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:24:02,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:02 BoogieIcfgContainer [2019-11-16 00:24:02,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:24:02,243 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:24:02,244 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:24:02,247 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:24:02,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:24:02,248 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:24:01" (1/3) ... [2019-11-16 00:24:02,248 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a968ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:24:02, skipping insertion in model container [2019-11-16 00:24:02,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:24:02,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:24:02" (2/3) ... [2019-11-16 00:24:02,249 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a968ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:24:02, skipping insertion in model container [2019-11-16 00:24:02,249 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:24:02,249 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:02" (3/3) ... [2019-11-16 00:24:02,251 INFO L371 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2019-11-16 00:24:02,288 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:24:02,288 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:24:02,288 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:24:02,289 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:24:02,289 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:24:02,289 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:24:02,289 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:24:02,289 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:24:02,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-16 00:24:02,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:24:02,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:02,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:02,320 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:24:02,320 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:24:02,320 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:24:02,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-11-16 00:24:02,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:24:02,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:02,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:02,321 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:24:02,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:24:02,327 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 3#L12-2true [2019-11-16 00:24:02,328 INFO L793 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0 > 0); 6#L12true assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 3#L12-2true [2019-11-16 00:24:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-16 00:24:02,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:02,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441870472] [2019-11-16 00:24:02,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:02,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:02,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:02,416 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:02,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:02,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-11-16 00:24:02,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:02,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505742167] [2019-11-16 00:24:02,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:02,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:02,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:02,432 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-11-16 00:24:02,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:02,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822504494] [2019-11-16 00:24:02,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:02,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:02,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:02,450 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:02,526 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:02,526 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:02,527 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:02,527 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:02,527 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:02,527 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,527 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:02,528 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:02,528 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-16 00:24:02,528 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:02,528 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:02,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,707 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:02,709 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,715 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:02,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:02,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:02,723 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_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:02,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:02,743 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:02,743 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_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:02,752 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) [2019-11-16 00:24:02,774 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:02,774 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,783 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:02,785 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:02,785 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:02,785 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:02,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:02,786 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:02,786 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:02,786 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:02,786 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:02,786 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2019-11-16 00:24:02,786 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:02,787 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:02,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,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-16 00:24:02,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:02,910 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:02,914 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:02,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:02,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:02,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:02,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:02,918 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:02,927 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:02,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:02,949 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:02,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:02,950 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:02,950 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:02,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:02,951 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:02,953 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:02,953 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:02,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:02,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:02,968 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:02,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:02,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:02,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:02,975 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:02,976 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:02,976 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:02,983 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:02,988 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:02,988 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:02,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:02,990 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:02,990 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:02,991 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:24:02,994 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:03,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:24:03,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-11-16 00:24:03,096 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-11-16 00:24:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:24:03,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-16 00:24:03,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-16 00:24:03,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-16 00:24:03,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-11-16 00:24:03,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:24:03,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-11-16 00:24:03,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-16 00:24:03,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-11-16 00:24:03,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-11-16 00:24:03,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:03,110 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:24:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-11-16 00:24:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-16 00:24:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-16 00:24:03,134 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:24:03,134 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:24:03,134 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:24:03,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-11-16 00:24:03,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:24:03,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:03,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:03,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:24:03,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:24:03,136 INFO L791 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 69#L12-2 assume !!(main_~c~0 > 0); 67#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 63#L12-2 [2019-11-16 00:24:03,136 INFO L793 eck$LassoCheckResult]: Loop: 63#L12-2 assume !!(main_~c~0 > 0); 64#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 63#L12-2 [2019-11-16 00:24:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-16 00:24:03,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903001256] [2019-11-16 00:24:03,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,137 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,147 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-11-16 00:24:03,147 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125268519] [2019-11-16 00:24:03,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,148 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,154 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-11-16 00:24:03,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500879019] [2019-11-16 00:24:03,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,167 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:03,192 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:03,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:03,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:03,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:03,192 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:03,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:03,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:03,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:03,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-16 00:24:03,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:03,193 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:03,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,279 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:03,279 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:03,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:03,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:03,288 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:03,288 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_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:03,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:03,294 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:03,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:03,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:03,311 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:03,312 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:03,313 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:03,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:03,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:03,313 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:03,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:03,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:03,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:03,314 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2019-11-16 00:24:03,314 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:03,314 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:03,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,408 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:03,408 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:03,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:03,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:03,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:03,410 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:03,410 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:03,411 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:03,411 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:03,416 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:03,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:03,421 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:03,421 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:03,422 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:03,422 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:03,422 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:03,425 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:03,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:03,441 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:03,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:03,450 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:03,451 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:03,451 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:03,451 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:03,452 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-16 00:24:03,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:03,507 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:24:03,507 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:24:03,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-11-16 00:24:03,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:03,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-16 00:24:03,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-16 00:24:03,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:24:03,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-16 00:24:03,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-11-16 00:24:03,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:24:03,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-11-16 00:24:03,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-16 00:24:03,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:24:03,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-11-16 00:24:03,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:03,529 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:24:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-11-16 00:24:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-16 00:24:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:24:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-11-16 00:24:03,534 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:24:03,534 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-11-16 00:24:03,534 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:24:03,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-11-16 00:24:03,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:24:03,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:03,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:03,535 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-16 00:24:03,536 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:24:03,536 INFO L791 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 123#L12-2 assume !!(main_~c~0 > 0); 121#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 124#L12-2 assume !!(main_~c~0 > 0); 125#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 117#L12-2 [2019-11-16 00:24:03,536 INFO L793 eck$LassoCheckResult]: Loop: 117#L12-2 assume !!(main_~c~0 > 0); 118#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 117#L12-2 [2019-11-16 00:24:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-11-16 00:24:03,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950015264] [2019-11-16 00:24:03,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,551 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:03,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-11-16 00:24:03,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035584679] [2019-11-16 00:24:03,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,558 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-11-16 00:24:03,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:03,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608480118] [2019-11-16 00:24:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,559 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:03,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:03,593 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:03,611 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:03,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:03,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:03,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:03,612 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:03,612 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:03,612 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:03,612 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:03,612 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-16 00:24:03,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:03,613 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:03,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,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-16 00:24:03,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,697 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:03,697 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:03,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:03,706 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:03,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:03,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:03,729 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:03,733 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:03,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:03,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:03,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:03,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:03,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:03,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:03,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:03,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2019-11-16 00:24:03,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:03,735 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:03,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:03,839 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:03,840 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:03,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:03,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:03,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:03,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:03,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:03,841 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:03,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:03,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:03,851 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:03,854 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:03,858 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:03,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:03,859 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:03,860 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:03,860 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:24:03,860 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:03,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:03,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:24:03,895 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:24:03,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-16 00:24:03,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-16 00:24:03,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:24:03,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,909 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:03,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:03,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:03,958 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:24:03,959 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:24:03,968 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-11-16 00:24:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-11-16 00:24:03,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:24:03,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:03,970 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:04,009 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:24:04,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-16 00:24:04,023 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-11-16 00:24:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:24:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:24:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:24:04,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:24:04,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-11-16 00:24:04,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:24:04,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-11-16 00:24:04,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-16 00:24:04,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:24:04,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-11-16 00:24:04,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:04,028 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-16 00:24:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-11-16 00:24:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-11-16 00:24:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:24:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-11-16 00:24:04,033 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-16 00:24:04,033 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-11-16 00:24:04,033 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:24:04,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-11-16 00:24:04,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:24:04,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:04,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:04,036 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-16 00:24:04,036 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:24:04,036 INFO L791 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 261#L12-2 [2019-11-16 00:24:04,036 INFO L793 eck$LassoCheckResult]: Loop: 261#L12-2 assume !!(main_~c~0 > 0); 263#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 261#L12-2 [2019-11-16 00:24:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-11-16 00:24:04,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:04,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188432036] [2019-11-16 00:24:04,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,038 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-11-16 00:24:04,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:04,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156454199] [2019-11-16 00:24:04,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,063 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-11-16 00:24:04,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:04,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073981814] [2019-11-16 00:24:04,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,065 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,090 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:04,126 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:04,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:04,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:04,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:04,126 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:04,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:04,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:04,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-16 00:24:04,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:04,127 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:04,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,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-16 00:24:04,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,212 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:04,212 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:04,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:04,223 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-16 00:24:04,228 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:04,228 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:04,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:04,245 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_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:04,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:04,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:04,274 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [0, 1, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:04,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:04,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:04,282 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:04,288 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:04,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:04,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:04,301 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:04,303 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:04,303 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:04,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:04,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:04,303 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:04,303 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,303 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:04,303 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:04,303 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2019-11-16 00:24:04,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:04,304 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:04,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:04,385 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:04,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:04,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,387 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:04,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:04,390 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:04,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,391 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,393 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:04,394 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:04,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:04,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,401 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:04,401 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:04,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:04,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,404 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:04,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,406 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:04,406 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:04,408 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:04,411 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:04,411 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:24:04,412 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:04,412 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:04,412 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:04,412 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-11-16 00:24:04,413 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:04,466 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-11-16 00:24:04,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-16 00:24:04,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-11-16 00:24:04,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-11-16 00:24:04,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-11-16 00:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-16 00:24:04,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-11-16 00:24:04,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-11-16 00:24:04,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:24:04,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-11-16 00:24:04,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-11-16 00:24:04,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-11-16 00:24:04,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-11-16 00:24:04,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:04,476 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-11-16 00:24:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-11-16 00:24:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-11-16 00:24:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:24:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-11-16 00:24:04,477 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-16 00:24:04,477 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-11-16 00:24:04,477 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:24:04,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-11-16 00:24:04,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:24:04,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:04,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:04,479 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-11-16 00:24:04,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:24:04,480 INFO L791 eck$LassoCheckResult]: Stem: 310#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 306#L12-2 assume !!(main_~c~0 > 0); 307#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 313#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-11-16 00:24:04,480 INFO L793 eck$LassoCheckResult]: Loop: 311#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 312#L12-2 assume !!(main_~c~0 > 0); 311#L12 [2019-11-16 00:24:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-11-16 00:24:04,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:04,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858823107] [2019-11-16 00:24:04,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:04,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858823107] [2019-11-16 00:24:04,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:04,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:24:04,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246249089] [2019-11-16 00:24:04,523 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:24:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-11-16 00:24:04,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:04,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572766135] [2019-11-16 00:24:04,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:04,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:04,528 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:04,556 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:04,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:04,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:04,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:04,557 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:04,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:04,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:04,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-16 00:24:04,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:04,557 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:04,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,646 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:04,646 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:04,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:04,658 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:04,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:04,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:04,698 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 15, 7] Nus: [1, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) [2019-11-16 00:24:04,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:04,713 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) [2019-11-16 00:24:04,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:04,733 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,740 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:04,742 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:04,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:04,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:04,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:04,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:04,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:04,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:04,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:04,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2019-11-16 00:24:04,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:04,743 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:04,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:04,818 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:04,818 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:04,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:04,820 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,820 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:04,820 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:04,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:04,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,823 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,825 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:04,825 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:04,827 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:04,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:04,828 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:04,828 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:04,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:04,829 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:04,829 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:04,829 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:04,829 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:04,832 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:04,834 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:04,834 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:24:04,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:04,834 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:04,834 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:04,834 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 211 Supporting invariants [] [2019-11-16 00:24:04,835 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:04,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,868 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:04,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:24:04,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:24:04,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-11-16 00:24:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-16 00:24:04,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:24:04,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,905 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:04,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:24:04,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:24:04,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-11-16 00:24:04,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:04,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:24:04,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:04,968 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:04,994 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:24:04,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,009 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:24:05,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:24:05,018 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-11-16 00:24:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:24:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-16 00:24:05,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-16 00:24:05,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:24:05,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:24:05,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-11-16 00:24:05,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-16 00:24:05,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-11-16 00:24:05,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-16 00:24:05,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-16 00:24:05,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-16 00:24:05,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:05,023 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:24:05,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-16 00:24:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-11-16 00:24:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-11-16 00:24:05,024 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-11-16 00:24:05,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:05,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:05,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:05,028 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-11-16 00:24:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:05,042 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-11-16 00:24:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:05,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-11-16 00:24:05,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:24:05,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-11-16 00:24:05,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-16 00:24:05,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-16 00:24:05,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-16 00:24:05,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:05,044 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:24:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-16 00:24:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-11-16 00:24:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-16 00:24:05,046 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-16 00:24:05,046 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-11-16 00:24:05,046 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:24:05,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-11-16 00:24:05,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:24:05,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:05,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:05,047 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-11-16 00:24:05,047 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-16 00:24:05,047 INFO L791 eck$LassoCheckResult]: Stem: 460#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 456#L12-2 assume !!(main_~c~0 > 0); 457#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-11-16 00:24:05,047 INFO L793 eck$LassoCheckResult]: Loop: 461#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 458#L12-2 assume !!(main_~c~0 > 0); 459#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 462#L12-2 assume !!(main_~c~0 > 0); 461#L12 [2019-11-16 00:24:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-11-16 00:24:05,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798719611] [2019-11-16 00:24:05,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,056 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-11-16 00:24:05,057 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244342490] [2019-11-16 00:24:05,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,057 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,063 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-11-16 00:24:05,064 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29264217] [2019-11-16 00:24:05,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,074 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:05,123 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:05,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:05,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:05,124 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:05,124 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:05,124 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,124 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:05,124 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:05,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-16 00:24:05,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:05,125 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:05,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,185 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:05,185 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:05,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:05,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:05,204 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:05,204 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:05,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:05,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:05,211 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:05,211 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:05,216 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:05,222 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:05,226 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:05,227 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:05,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:05,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:05,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:05,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:05,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:05,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:05,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2019-11-16 00:24:05,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:05,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:05,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,290 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:05,290 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:05,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:05,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:05,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:05,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:05,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:05,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:05,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:05,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:05,295 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:05,297 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:05,297 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:24:05,297 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:05,297 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:05,297 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:05,298 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 201 Supporting invariants [] [2019-11-16 00:24:05,298 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:05,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,356 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:24:05,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-16 00:24:05,363 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-11-16 00:24:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:24:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-11-16 00:24:05,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:24:05,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,364 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:05,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,422 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-16 00:24:05,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-16 00:24:05,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-11-16 00:24:05,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:24:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:05,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:24:05,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,439 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,480 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-16 00:24:05,480 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-16 00:24:05,489 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-11-16 00:24:05,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:05,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:24:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-11-16 00:24:05,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:24:05,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,490 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:24:05,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-16 00:24:05,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-11-16 00:24:05,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:24:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:24:05,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:24:05,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,579 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:05,620 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:24:05,621 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-11-16 00:24:05,675 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-11-16 00:24:05,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:24:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-11-16 00:24:05,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:24:05,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-16 00:24:05,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-11-16 00:24:05,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:05,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-11-16 00:24:05,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-11-16 00:24:05,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-11-16 00:24:05,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-16 00:24:05,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-16 00:24:05,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-11-16 00:24:05,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:05,685 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-11-16 00:24:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-11-16 00:24:05,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-11-16 00:24:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:24:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-11-16 00:24:05,688 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-16 00:24:05,688 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-11-16 00:24:05,688 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:24:05,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-11-16 00:24:05,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:24:05,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:05,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:05,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-11-16 00:24:05,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-16 00:24:05,690 INFO L791 eck$LassoCheckResult]: Stem: 822#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 823#L12-2 assume !!(main_~c~0 > 0); 826#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-11-16 00:24:05,690 INFO L793 eck$LassoCheckResult]: Loop: 824#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 825#L12-2 assume !!(main_~c~0 > 0); 830#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 829#L12-2 assume !!(main_~c~0 > 0); 828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 827#L12-2 assume !!(main_~c~0 > 0); 824#L12 [2019-11-16 00:24:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,691 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-11-16 00:24:05,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537824961] [2019-11-16 00:24:05,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:05,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537824961] [2019-11-16 00:24:05,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902675035] [2019-11-16 00:24:05,712 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:05,756 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:24:05,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:24:05,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:24:05,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:05,760 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:05,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-11-16 00:24:05,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551682062] [2019-11-16 00:24:05,761 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:24:05,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:05,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-11-16 00:24:05,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:05,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202064726] [2019-11-16 00:24:05,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:05,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:05,769 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:05,832 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:05,832 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:05,832 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:05,832 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:05,833 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:05,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,833 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:05,833 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:05,833 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-16 00:24:05,833 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:05,833 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:05,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,904 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:05,904 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:05,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:05,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:05,912 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:05,912 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_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:05,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:05,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:05,920 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:05,920 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_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:05,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:05,928 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:05,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:05,977 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:05,978 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:05,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:05,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:05,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:05,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:05,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:05,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:05,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:05,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2019-11-16 00:24:05,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:05,979 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:05,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:05,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,047 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:06,047 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:06,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:06,048 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:06,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:06,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:06,048 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:06,049 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:06,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:06,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:06,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:06,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:06,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:06,054 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:06,054 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:06,055 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:06,055 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:06,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:06,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:06,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:06,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:06,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:06,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:06,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:06,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:06,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:06,061 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:06,063 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:06,064 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:06,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:06,064 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:06,064 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:06,065 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-16 00:24:06,065 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:24:06,114 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-16 00:24:06,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-11-16 00:24:06,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 61 states and 87 transitions. Complement of second has 9 states. [2019-11-16 00:24:06,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:24:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-11-16 00:24:06,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-16 00:24:06,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:06,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-16 00:24:06,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:06,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-16 00:24:06,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:06,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2019-11-16 00:24:06,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:24:06,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 52 states and 75 transitions. [2019-11-16 00:24:06,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-16 00:24:06,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-16 00:24:06,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 75 transitions. [2019-11-16 00:24:06,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:06,157 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 75 transitions. [2019-11-16 00:24:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 75 transitions. [2019-11-16 00:24:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2019-11-16 00:24:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-16 00:24:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-11-16 00:24:06,162 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-11-16 00:24:06,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:24:06,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:24:06,175 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 5 states. [2019-11-16 00:24:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:06,192 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-16 00:24:06,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:24:06,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-16 00:24:06,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:24:06,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 27 states and 36 transitions. [2019-11-16 00:24:06,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-11-16 00:24:06,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-11-16 00:24:06,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-16 00:24:06,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:06,194 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-16 00:24:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-16 00:24:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-11-16 00:24:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:24:06,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-16 00:24:06,196 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-16 00:24:06,196 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-16 00:24:06,196 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:24:06,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-16 00:24:06,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-16 00:24:06,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:06,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:06,198 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-11-16 00:24:06,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-11-16 00:24:06,198 INFO L791 eck$LassoCheckResult]: Stem: 1076#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1077#L12-2 assume !!(main_~c~0 > 0); 1093#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1091#L12-2 assume !!(main_~c~0 > 0); 1084#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-11-16 00:24:06,198 INFO L793 eck$LassoCheckResult]: Loop: 1078#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1079#L12-2 assume !!(main_~c~0 > 0); 1085#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1083#L12-2 assume !!(main_~c~0 > 0); 1082#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1081#L12-2 assume !!(main_~c~0 > 0); 1078#L12 [2019-11-16 00:24:06,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-11-16 00:24:06,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:06,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503889270] [2019-11-16 00:24:06,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:06,208 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-11-16 00:24:06,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:06,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432105108] [2019-11-16 00:24:06,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:06,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,217 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-11-16 00:24:06,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:06,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172462969] [2019-11-16 00:24:06,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:06,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:06,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172462969] [2019-11-16 00:24:06,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190979906] [2019-11-16 00:24:06,291 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:24:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:06,423 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:24:06,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 15 [2019-11-16 00:24:06,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604932409] [2019-11-16 00:24:06,481 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:06,481 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:06,481 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:06,481 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:06,481 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:06,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:06,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:06,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:06,482 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-16 00:24:06,482 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:06,482 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:06,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,558 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:06,559 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) [2019-11-16 00:24:06,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:06,570 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:06,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:06,574 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_40ccc811-74df-4576-aa0c-59461bd6a891/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) [2019-11-16 00:24:06,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:06,582 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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) [2019-11-16 00:24:06,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:06,597 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:06,667 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:06,669 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:06,669 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:06,669 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:06,669 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:06,669 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:06,669 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:06,669 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:06,669 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:06,669 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration8_Loop [2019-11-16 00:24:06,669 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:06,669 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:06,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:06,733 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:06,734 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:06,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:06,734 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:06,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:06,735 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:06,735 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:06,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:06,735 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:06,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:06,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:06,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:06,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:06,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:06,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:06,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:06,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:06,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:06,741 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:06,742 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:06,742 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:06,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:06,743 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:06,743 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:06,743 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:24:06,744 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:06,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:06,809 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-16 00:24:06,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-16 00:24:06,833 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-16 00:24:06,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:24:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-16 00:24:06,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:24:06,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:06,839 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:06,903 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-16 00:24:06,903 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-16 00:24:06,928 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-11-16 00:24:06,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:24:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-11-16 00:24:06,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:24:06,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:06,931 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:06,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:24:06,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:06,986 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-16 00:24:06,986 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-16 00:24:07,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-11-16 00:24:07,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-16 00:24:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-16 00:24:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-16 00:24:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-11-16 00:24:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-11-16 00:24:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-11-16 00:24:07,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-11-16 00:24:07,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-11-16 00:24:07,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-16 00:24:07,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-11-16 00:24:07,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-11-16 00:24:07,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:07,024 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-11-16 00:24:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-11-16 00:24:07,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-16 00:24:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:24:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-16 00:24:07,027 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-16 00:24:07,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:07,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:24:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:24:07,028 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 15 states. [2019-11-16 00:24:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:07,184 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2019-11-16 00:24:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:24:07,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 181 transitions. [2019-11-16 00:24:07,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2019-11-16 00:24:07,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 109 states and 145 transitions. [2019-11-16 00:24:07,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-11-16 00:24:07,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-16 00:24:07,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 145 transitions. [2019-11-16 00:24:07,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:07,188 INFO L688 BuchiCegarLoop]: Abstraction has 109 states and 145 transitions. [2019-11-16 00:24:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 145 transitions. [2019-11-16 00:24:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 33. [2019-11-16 00:24:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:24:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-11-16 00:24:07,194 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-16 00:24:07,194 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-11-16 00:24:07,194 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-16 00:24:07,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-11-16 00:24:07,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-16 00:24:07,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:07,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:07,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-16 00:24:07,195 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-11-16 00:24:07,196 INFO L791 eck$LassoCheckResult]: Stem: 1722#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1724#L12-2 assume !!(main_~c~0 > 0); 1738#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1735#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-11-16 00:24:07,196 INFO L793 eck$LassoCheckResult]: Loop: 1718#L12-2 assume !!(main_~c~0 > 0); 1719#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1728#L12-2 assume !!(main_~c~0 > 0); 1734#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1733#L12-2 assume !!(main_~c~0 > 0); 1725#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1726#L12-2 assume !!(main_~c~0 > 0); 1729#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1718#L12-2 [2019-11-16 00:24:07,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,196 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-11-16 00:24:07,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:07,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410686280] [2019-11-16 00:24:07,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,201 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:07,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-11-16 00:24:07,202 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:07,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974893182] [2019-11-16 00:24:07,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-16 00:24:07,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974893182] [2019-11-16 00:24:07,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:24:07,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:24:07,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180413749] [2019-11-16 00:24:07,226 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:24:07,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:24:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:24:07,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:24:07,226 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-16 00:24:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:24:07,234 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-11-16 00:24:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:24:07,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-11-16 00:24:07,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-16 00:24:07,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-11-16 00:24:07,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:24:07,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-16 00:24:07,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-11-16 00:24:07,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:07,237 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-16 00:24:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-11-16 00:24:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-11-16 00:24:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-16 00:24:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-11-16 00:24:07,239 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-16 00:24:07,239 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-16 00:24:07,240 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-16 00:24:07,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-11-16 00:24:07,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-16 00:24:07,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:07,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:07,240 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-16 00:24:07,241 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-11-16 00:24:07,241 INFO L791 eck$LassoCheckResult]: Stem: 1813#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 1815#L12-2 assume !!(main_~c~0 > 0); 1829#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1828#L12-2 assume !!(main_~c~0 > 0); 1821#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-11-16 00:24:07,241 INFO L793 eck$LassoCheckResult]: Loop: 1809#L12-2 assume !!(main_~c~0 > 0); 1810#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1819#L12-2 assume !!(main_~c~0 > 0); 1826#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1823#L12-2 assume !!(main_~c~0 > 0); 1816#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1817#L12-2 assume !!(main_~c~0 > 0); 1827#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 1824#L12-2 assume !!(main_~c~0 > 0); 1820#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 1809#L12-2 [2019-11-16 00:24:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-11-16 00:24:07,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:07,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982178479] [2019-11-16 00:24:07,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,248 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-11-16 00:24:07,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:07,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851283998] [2019-11-16 00:24:07,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,257 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-11-16 00:24:07,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:07,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584948317] [2019-11-16 00:24:07,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:07,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:07,268 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:07,367 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:07,367 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:07,367 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:07,367 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:07,367 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:07,367 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:07,367 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:07,367 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:07,368 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-16 00:24:07,368 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:07,368 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:07,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,419 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:07,419 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:07,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:07,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:07,425 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:24:07,425 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_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:07,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:07,430 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/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-16 00:24:07,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:07,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:07,449 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:07,451 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:07,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:07,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:07,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:07,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:07,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:07,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:07,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:07,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration10_Loop [2019-11-16 00:24:07,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:07,452 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:07,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:07,536 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:07,536 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:07,536 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:07,537 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:07,537 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:07,537 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:07,537 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:07,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:24:07,538 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:24:07,540 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:24:07,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:07,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:07,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:07,541 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:07,541 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:07,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:07,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:07,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:07,543 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:07,544 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:07,544 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:07,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:07,546 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:07,546 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:07,546 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:24:07,546 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:07,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:07,632 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:24:07,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:24:07,638 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-16 00:24:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:07,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:24:07,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,639 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:07,699 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:24:07,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:24:07,706 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-11-16 00:24:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:07,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:24:07,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,707 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:07,782 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 5 loop predicates [2019-11-16 00:24:07,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:24:07,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-11-16 00:24:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:24:07,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:24:07,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,794 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:07,862 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:24:07,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:24:07,900 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-11-16 00:24:07,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-16 00:24:07,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:24:07,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:07,902 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:07,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:07,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:24:07,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:07,967 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:24:07,967 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-16 00:24:08,024 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,024 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,025 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,025 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,026 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:08,074 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-11-16 00:24:08,075 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-16 00:24:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:24:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-11-16 00:24:08,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-11-16 00:24:08,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-11-16 00:24:08,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-11-16 00:24:08,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-11-16 00:24:08,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-11-16 00:24:08,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-11-16 00:24:08,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-11-16 00:24:08,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:24:08,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-11-16 00:24:08,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:08,090 INFO L688 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-11-16 00:24:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-11-16 00:24:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-11-16 00:24:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-16 00:24:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-16 00:24:08,096 INFO L711 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-16 00:24:08,097 INFO L591 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-16 00:24:08,097 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-16 00:24:08,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-11-16 00:24:08,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-11-16 00:24:08,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:08,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:08,099 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-16 00:24:08,099 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-11-16 00:24:08,099 INFO L791 eck$LassoCheckResult]: Stem: 2806#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 2809#L12-2 assume !!(main_~c~0 > 0); 2833#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2829#L12-2 assume !!(main_~c~0 > 0); 2815#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-11-16 00:24:08,099 INFO L793 eck$LassoCheckResult]: Loop: 2802#L12-2 assume !!(main_~c~0 > 0); 2803#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2864#L12-2 assume !!(main_~c~0 > 0); 2857#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2855#L12-2 assume !!(main_~c~0 > 0); 2849#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2848#L12-2 assume !!(main_~c~0 > 0); 2847#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2839#L12-2 assume !!(main_~c~0 > 0); 2818#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2830#L12-2 assume !!(main_~c~0 > 0); 2828#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 2826#L12-2 assume !!(main_~c~0 > 0); 2814#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 2802#L12-2 [2019-11-16 00:24:08,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,100 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-11-16 00:24:08,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:08,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659037664] [2019-11-16 00:24:08,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:08,101 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:08,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:08,107 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:08,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,107 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-11-16 00:24:08,108 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:08,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671681466] [2019-11-16 00:24:08,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:08,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:08,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:08,117 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:08,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,118 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-11-16 00:24:08,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:08,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252180770] [2019-11-16 00:24:08,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:08,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:08,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:08,129 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:08,246 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-16 00:24:08,260 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:08,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:08,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:08,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:08,260 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:08,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:08,261 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:08,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:08,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-16 00:24:08,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:08,261 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:08,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,321 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:08,321 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:08,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:08,324 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:08,330 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:08,330 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:24:08,333 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:08,334 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:08,334 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:08,334 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:08,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:08,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:08,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:08,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:08,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:08,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration11_Loop [2019-11-16 00:24:08,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:08,335 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:08,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,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-16 00:24:08,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:08,384 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:08,384 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:08,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:08,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:08,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:08,385 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:08,385 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:08,385 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:08,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:08,386 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:08,387 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:08,389 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:08,389 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:08,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:08,389 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:08,390 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:08,390 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-11-16 00:24:08,390 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-16 00:24:08,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-16 00:24:08,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-16 00:24:08,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:24:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:08,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-16 00:24:08,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,500 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:08,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,596 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-16 00:24:08,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-16 00:24:08,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-11-16 00:24:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:24:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:08,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-16 00:24:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:08,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,703 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 7 loop predicates [2019-11-16 00:24:08,703 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-16 00:24:08,708 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-11-16 00:24:08,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:24:08,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-11-16 00:24:08,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-16 00:24:08,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,710 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,808 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-16 00:24:08,808 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-16 00:24:08,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-11-16 00:24:08,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:08,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:24:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-16 00:24:08,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-16 00:24:08,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:08,842 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:08,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-16 00:24:08,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:24:08,957 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-16 00:24:08,957 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-11-16 00:24:09,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,015 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,015 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,016 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,016 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,016 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,016 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,018 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,018 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,019 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,019 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,080 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,082 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,083 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,083 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,083 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,083 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,084 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,131 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,132 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,132 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,132 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,133 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,133 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,135 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,136 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,136 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,136 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,136 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,137 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,137 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,137 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,137 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,138 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,138 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,138 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,138 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,139 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,139 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,139 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,139 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,140 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,140 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,141 WARN L278 uchiComplementFKVNwa]: big8 [2019-11-16 00:24:09,169 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-11-16 00:24:09,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-16 00:24:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-11-16 00:24:09,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-11-16 00:24:09,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:09,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-11-16 00:24:09,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:09,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-11-16 00:24:09,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:09,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-11-16 00:24:09,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-11-16 00:24:09,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-11-16 00:24:09,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-11-16 00:24:09,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:24:09,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-11-16 00:24:09,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:24:09,208 INFO L688 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-11-16 00:24:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-11-16 00:24:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-11-16 00:24:09,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-16 00:24:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-11-16 00:24:09,240 INFO L711 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-16 00:24:09,240 INFO L591 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-11-16 00:24:09,240 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-16 00:24:09,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-11-16 00:24:09,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-16 00:24:09,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:24:09,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:24:09,243 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-11-16 00:24:09,243 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-11-16 00:24:09,243 INFO L791 eck$LassoCheckResult]: Stem: 5719#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~c~0;havoc main_~x~0;havoc main_~c~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~c~0 := 1; 5724#L12-2 assume !!(main_~c~0 > 0); 5765#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5737#L12-2 assume !!(main_~c~0 > 0); 5733#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-11-16 00:24:09,243 INFO L793 eck$LassoCheckResult]: Loop: 5715#L12-2 assume !!(main_~c~0 > 0); 5716#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5934#L12-2 assume !!(main_~c~0 > 0); 5861#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5859#L12-2 assume !!(main_~c~0 > 0); 5857#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5855#L12-2 assume !!(main_~c~0 > 0); 5852#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5841#L12-2 assume !!(main_~c~0 > 0); 5842#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5824#L12-2 assume !!(main_~c~0 > 0); 5825#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5816#L12-2 assume !!(main_~c~0 > 0); 5736#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5759#L12-2 assume !!(main_~c~0 > 0); 5738#L12 assume main_~x~0 > 100;main_~x~0 := main_~x~0 - 10;main_~c~0 := main_~c~0 - 1; 5735#L12-2 assume !!(main_~c~0 > 0); 5732#L12 assume !(main_~x~0 > 100);main_~x~0 := 11 + main_~x~0;main_~c~0 := 1 + main_~c~0; 5715#L12-2 [2019-11-16 00:24:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-11-16 00:24:09,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:09,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513113174] [2019-11-16 00:24:09,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:09,255 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:09,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-11-16 00:24:09,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:09,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408338277] [2019-11-16 00:24:09,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:09,278 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,280 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-11-16 00:24:09,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:24:09,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463203183] [2019-11-16 00:24:09,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:24:09,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:24:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:24:09,305 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:24:09,490 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-16 00:24:09,507 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:09,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:09,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:09,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:09,508 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:24:09,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:09,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:09,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:09,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-16 00:24:09,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:09,508 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:09,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,579 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:09,579 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:24:09,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:24:09,583 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_40ccc811-74df-4576-aa0c-59461bd6a891/bin/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:24:09,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:24:09,593 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:09,653 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:24:09,655 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:24:09,655 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:24:09,655 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:24:09,655 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:24:09,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:24:09,656 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:24:09,656 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:24:09,656 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:24:09,656 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration12_Loop [2019-11-16 00:24:09,656 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:24:09,656 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:24:09,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-16 00:24:09,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:24:09,728 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:24:09,728 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:24:09,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:24:09,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:24:09,729 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:24:09,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:24:09,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:24:09,730 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:24:09,730 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:24:09,730 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:24:09,731 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:24:09,732 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:24:09,733 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:24:09,733 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:24:09,733 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:24:09,733 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:24:09,733 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-11-16 00:24:09,734 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:24:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:09,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:24:09,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:24:09,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:24:09,827 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-16 00:24:09,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-16 00:24:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:24:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:09,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-16 00:24:09,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:09,840 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:09,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:24:09,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:24:09,924 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:24:09,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-16 00:24:09,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-11-16 00:24:09,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:24:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-11-16 00:24:09,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-16 00:24:09,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:09,938 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:09,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:09,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:24:09,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:24:10,025 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 6 loop predicates [2019-11-16 00:24:10,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-16 00:24:10,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 392 states and 547 transitions. Complement of second has 7 states. [2019-11-16 00:24:10,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:24:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-16 00:24:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-16 00:24:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:10,068 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:24:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:24:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:24:10,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:10,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:24:10,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:24:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:24:10,162 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-16 00:24:10,163 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 8 states. [2019-11-16 00:24:10,225 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 8 states. Result 511 states and 724 transitions. Complement of second has 12 states. [2019-11-16 00:24:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-11-16 00:24:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:24:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-11-16 00:24:10,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 18 letters. [2019-11-16 00:24:10,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:10,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 23 letters. Loop has 18 letters. [2019-11-16 00:24:10,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:10,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 36 letters. [2019-11-16 00:24:10,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:24:10,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 724 transitions. [2019-11-16 00:24:10,231 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:24:10,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 0 states and 0 transitions. [2019-11-16 00:24:10,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:24:10,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:24:10,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:24:10,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:24:10,232 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:24:10,232 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:24:10,232 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:24:10,232 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-16 00:24:10,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:24:10,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:24:10,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:24:10,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:24:10 BoogieIcfgContainer [2019-11-16 00:24:10,240 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:24:10,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:24:10,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:24:10,241 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:24:10,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:24:02" (3/4) ... [2019-11-16 00:24:10,244 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:24:10,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:24:10,246 INFO L168 Benchmark]: Toolchain (without parser) took 8477.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.1 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -250.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:10,250 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:10,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:10,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.08 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-16 00:24:10,252 INFO L168 Benchmark]: Boogie Preprocessor took 16.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:24:10,254 INFO L168 Benchmark]: RCFGBuilder took 186.34 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:10,255 INFO L168 Benchmark]: BuchiAutomizer took 7996.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:24:10,258 INFO L168 Benchmark]: Witness Printer took 4.32 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-16 00:24:10,265 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 236.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -193.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.08 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 16.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.34 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7996.64 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -76.4 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.32 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 15 terminating modules (4 trivial, 4 deterministic, 7 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One deterministic module has affine ranking function c and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 201 and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 5 locations. One nondeterministic module has affine ranking function x and consists of 7 locations. One nondeterministic module has affine ranking function x and consists of 9 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.9s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 4.3s. Construction of modules took 0.4s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 393 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 260 states and ocurred in iteration 11. Nontrivial modules had stage [4, 0, 3, 1, 3]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 105/148 HoareTripleCheckerStatistics: 154 SDtfs, 161 SDslu, 64 SDs, 0 SdLazy, 353 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax160 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp96 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...