./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f36e762e796a59800b85d8514c20c7f73c19b5c1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:30:36,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:30:36,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:30:36,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:30:36,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:30:36,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:30:36,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:30:36,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:30:36,947 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:30:36,947 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:30:36,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:30:36,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:30:36,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:30:36,949 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:30:36,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:30:36,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:30:36,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:30:36,952 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:30:36,953 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:30:36,954 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:30:36,955 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:30:36,956 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:30:36,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:30:36,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:30:36,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:30:36,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:30:36,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:30:36,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:30:36,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:30:36,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:30:36,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:30:36,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:30:36,961 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:30:36,961 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:30:36,962 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:30:36,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:30:36,962 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:30:36,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:30:36,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:30:36,973 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:30:36,973 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:30:36,973 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:30:36,973 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:30:36,974 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:30:36,974 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:30:36,974 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:30:36,974 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:30:36,974 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:30:36,974 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:30:36,974 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:30:36,975 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:30:36,975 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:30:36,976 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:30:36,976 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:30:36,976 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:30:36,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:30:36,976 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:30:36,977 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:30:36,977 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f36e762e796a59800b85d8514c20c7f73c19b5c1 [2018-11-10 12:30:36,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:30:37,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:30:37,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:30:37,009 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:30:37,009 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:30:37,010 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 12:30:37,043 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/data/7e45d174f/afb781dea24b4a72aa8a2be755d9fef9/FLAG1110f570b [2018-11-10 12:30:37,434 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:30:37,434 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 12:30:37,438 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/data/7e45d174f/afb781dea24b4a72aa8a2be755d9fef9/FLAG1110f570b [2018-11-10 12:30:37,448 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/data/7e45d174f/afb781dea24b4a72aa8a2be755d9fef9 [2018-11-10 12:30:37,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:30:37,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:30:37,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:30:37,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:30:37,455 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:30:37,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac897aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37, skipping insertion in model container [2018-11-10 12:30:37,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:30:37,473 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:30:37,566 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:30:37,567 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:30:37,575 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:30:37,583 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:30:37,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37 WrapperNode [2018-11-10 12:30:37,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:30:37,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:30:37,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:30:37,584 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:30:37,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:30:37,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:30:37,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:30:37,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:30:37,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... [2018-11-10 12:30:37,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:30:37,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:30:37,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:30:37,613 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:30:37,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:30:37,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:30:37,761 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:30:37,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:30:37 BoogieIcfgContainer [2018-11-10 12:30:37,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:30:37,762 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:30:37,762 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:30:37,764 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:30:37,765 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:30:37,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:30:37" (1/3) ... [2018-11-10 12:30:37,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c34f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:30:37, skipping insertion in model container [2018-11-10 12:30:37,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:30:37,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:30:37" (2/3) ... [2018-11-10 12:30:37,766 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c34f18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:30:37, skipping insertion in model container [2018-11-10 12:30:37,766 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:30:37,766 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:30:37" (3/3) ... [2018-11-10 12:30:37,767 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 12:30:37,803 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:30:37,803 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:30:37,803 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:30:37,803 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:30:37,803 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:30:37,803 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:30:37,804 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:30:37,804 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:30:37,804 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:30:37,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-10 12:30:37,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:37,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:37,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:37,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:30:37,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:30:37,828 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:30:37,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-10 12:30:37,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:37,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:37,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:37,829 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:30:37,829 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:30:37,835 INFO L793 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 9#L15-2true [2018-11-10 12:30:37,835 INFO L795 eck$LassoCheckResult]: Loop: 9#L15-2true assume true; 10#L14-1true assume !!(main_~c~0 > 0); 4#L15true assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 9#L15-2true [2018-11-10 12:30:37,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:37,839 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 12:30:37,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:37,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:37,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:37,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 1 times [2018-11-10 12:30:37,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:37,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:37,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:37,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:37,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:37,902 INFO L82 PathProgramCache]: Analyzing trace with hash 28694888, now seen corresponding path program 1 times [2018-11-10 12:30:37,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:37,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:37,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:37,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:37,960 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:37,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:37,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:37,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:37,961 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:37,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:37,962 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:37,962 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:37,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-10 12:30:37,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:37,962 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:37,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:37,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:37,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,080 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:38,080 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,105 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:38,105 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,124 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:38,124 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,127 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:38,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,162 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:38,163 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:38,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:38,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:38,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:38,163 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:38,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:38,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:38,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-10 12:30:38,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:38,163 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:38,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,237 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:38,240 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:38,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:38,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:38,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:38,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:38,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:38,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:38,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:38,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:38,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:38,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:38,255 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:30:38,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:38,256 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:38,257 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:38,257 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-10 12:30:38,259 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:38,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:38,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:38,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:38,305 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 [2018-11-10 12:30:38,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2018-11-10 12:30:38,333 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states.. Second operand 3 states. Result 27 states and 32 transitions. Complement of second has 6 states. [2018-11-10 12:30:38,334 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 [2018-11-10 12:30:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:30:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-10 12:30:38,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-10 12:30:38,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 12:30:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:38,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:30:38,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:38,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-10 12:30:38,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:38,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-10 12:30:38,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 12:30:38,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 12:30:38,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-10 12:30:38,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:38,345 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 12:30:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-10 12:30:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-10 12:30:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 12:30:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-10 12:30:38,362 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 12:30:38,362 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-10 12:30:38,363 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:30:38,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-10 12:30:38,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:38,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:38,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:38,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 12:30:38,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:30:38,364 INFO L793 eck$LassoCheckResult]: Stem: 81#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 79#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 80#L15-2 assume true; 82#L14-1 assume !!(main_~c~0 > 0); 75#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 76#L15-2 [2018-11-10 12:30:38,364 INFO L795 eck$LassoCheckResult]: Loop: 76#L15-2 assume true; 84#L14-1 assume !!(main_~c~0 > 0); 85#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 76#L15-2 [2018-11-10 12:30:38,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,364 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-10 12:30:38,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:38,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:38,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 2 times [2018-11-10 12:30:38,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:38,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:38,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,377 INFO L82 PathProgramCache]: Analyzing trace with hash 150863077, now seen corresponding path program 1 times [2018-11-10 12:30:38,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:38,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:38,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:30:38,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:30:38,438 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:38,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:38,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:38,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:38,438 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:38,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:38,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:38,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-10 12:30:38,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:38,439 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:38,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,486 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:38,486 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,504 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:38,504 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,523 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:38,523 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,525 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:38,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:38,542 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,559 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:38,560 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:38,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:38,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:38,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:38,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:38,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:38,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:38,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-10 12:30:38,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:38,561 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:38,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,604 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:38,604 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:38,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:38,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:38,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:38,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:38,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:38,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:30:38,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:30:38,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:38,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:38,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:38,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:38,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:38,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:38,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:38,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:38,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:38,618 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:38,621 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:38,621 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:30:38,621 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:38,621 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:38,622 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:38,622 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-10 12:30:38,622 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:38,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:38,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:38,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:38,647 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 [2018-11-10 12:30:38,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 12:30:38,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 5 states. [2018-11-10 12:30:38,654 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 [2018-11-10 12:30:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:30:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 12:30:38,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-10 12:30:38,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:38,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-10 12:30:38,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:38,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-10 12:30:38,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:38,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-10 12:30:38,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:38,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-10 12:30:38,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 12:30:38,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 12:30:38,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-10 12:30:38,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:38,658 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 12:30:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-10 12:30:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-10 12:30:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 12:30:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-10 12:30:38,660 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-10 12:30:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:30:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:30:38,663 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-11-10 12:30:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:30:38,680 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-10 12:30:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:30:38,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-10 12:30:38,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:38,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2018-11-10 12:30:38,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-10 12:30:38,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 12:30:38,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-10 12:30:38,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:38,682 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-10 12:30:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-10 12:30:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-10 12:30:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-10 12:30:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-10 12:30:38,683 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-10 12:30:38,683 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-10 12:30:38,683 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:30:38,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-10 12:30:38,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-10 12:30:38,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:38,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:38,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2018-11-10 12:30:38,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:30:38,684 INFO L793 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 191#L15-2 assume true; 197#L14-1 assume !!(main_~c~0 > 0); 194#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 195#L15-2 assume true; 198#L14-1 assume !!(main_~c~0 > 0); 192#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 193#L15-2 assume true; 203#L14-1 assume !!(main_~c~0 > 0); 202#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 200#L15-2 [2018-11-10 12:30:38,684 INFO L795 eck$LassoCheckResult]: Loop: 200#L15-2 assume true; 201#L14-1 assume !!(main_~c~0 > 0); 199#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 200#L15-2 [2018-11-10 12:30:38,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash -693878072, now seen corresponding path program 2 times [2018-11-10 12:30:38,685 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:38,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:38,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 3 times [2018-11-10 12:30:38,694 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:38,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:38,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:38,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:38,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash 355958851, now seen corresponding path program 3 times [2018-11-10 12:30:38,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:38,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:38,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:38,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:30:38,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:30:38,737 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:30:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:30:38,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 12:30:38,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:30:38,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 12:30:38,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:30:38,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 12:30:38,813 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:38,813 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:38,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:38,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:38,814 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:38,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:38,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:38,814 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-10 12:30:38,814 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:38,814 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:38,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,867 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:38,867 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:38,869 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:38,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:38,924 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:38,925 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:38,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:38,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:38,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:38,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:38,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:38,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:38,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:38,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-10 12:30:38,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:38,925 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:38,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:38,974 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:38,974 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:38,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:38,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:38,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:38,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:38,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:38,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:38,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:38,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:38,978 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:38,979 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:38,979 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:30:38,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:38,980 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:38,980 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:38,980 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-10 12:30:38,980 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:38,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,005 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 [2018-11-10 12:30:39,005 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:30:39,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2018-11-10 12:30:39,012 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 [2018-11-10 12:30:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:30:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 12:30:39,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 12:30:39,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,012 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:39,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,030 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 [2018-11-10 12:30:39,030 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:30:39,035 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 21 states and 27 transitions. Complement of second has 5 states. [2018-11-10 12:30:39,035 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 [2018-11-10 12:30:39,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:30:39,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-10 12:30:39,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 12:30:39,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,036 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:39,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,058 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 [2018-11-10 12:30:39,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-10 12:30:39,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 24 states and 31 transitions. Complement of second has 4 states. [2018-11-10 12:30:39,064 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 [2018-11-10 12:30:39,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 12:30:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-10 12:30:39,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-10 12:30:39,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-10 12:30:39,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-10 12:30:39,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-10 12:30:39,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 12:30:39,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2018-11-10 12:30:39,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 12:30:39,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-10 12:30:39,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-10 12:30:39,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:39,068 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-10 12:30:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-10 12:30:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2018-11-10 12:30:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 12:30:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-10 12:30:39,070 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-10 12:30:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:30:39,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:30:39,070 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-11-10 12:30:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:30:39,082 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-10 12:30:39,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:30:39,082 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-10 12:30:39,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 12:30:39,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 20 transitions. [2018-11-10 12:30:39,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-10 12:30:39,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 12:30:39,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-10 12:30:39,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:39,084 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-10 12:30:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-10 12:30:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-11-10 12:30:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 12:30:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-10 12:30:39,085 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 12:30:39,085 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-10 12:30:39,085 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:30:39,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-10 12:30:39,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 12:30:39,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:39,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:39,086 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 12:30:39,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 12:30:39,087 INFO L793 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 501#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 502#L15-2 [2018-11-10 12:30:39,087 INFO L795 eck$LassoCheckResult]: Loop: 502#L15-2 assume true; 507#L14-1 assume !!(main_~c~0 > 0); 514#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 513#L15-2 assume true; 512#L14-1 assume !!(main_~c~0 > 0); 503#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 502#L15-2 [2018-11-10 12:30:39,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,087 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 12:30:39,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:39,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1070873439, now seen corresponding path program 1 times [2018-11-10 12:30:39,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,097 INFO L82 PathProgramCache]: Analyzing trace with hash 150922657, now seen corresponding path program 4 times [2018-11-10 12:30:39,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,135 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:39,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:39,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:39,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:39,135 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:39,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:39,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:39,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-10 12:30:39,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:39,136 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:39,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,183 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:39,183 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,202 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:39,202 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,220 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:39,220 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,222 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,237 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:39,237 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,240 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,240 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:39,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,259 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:39,274 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:39,274 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:39,274 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:39,274 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:39,274 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:39,274 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,274 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:39,274 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:39,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-10 12:30:39,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:39,275 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:39,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,310 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:39,310 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:39,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:39,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:39,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:39,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:39,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:30:39,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:30:39,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:39,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:30:39,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:30:39,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:39,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:39,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:39,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:39,325 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:39,327 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:39,327 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:30:39,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:39,327 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:39,328 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:39,328 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2018-11-10 12:30:39,328 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:39,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,365 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 [2018-11-10 12:30:39,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 12:30:39,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 33 states and 39 transitions. Complement of second has 5 states. [2018-11-10 12:30:39,371 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 [2018-11-10 12:30:39,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:30:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-10 12:30:39,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:30:39,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,372 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:39,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,401 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 [2018-11-10 12:30:39,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-10 12:30:39,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 39 states and 47 transitions. Complement of second has 7 states. [2018-11-10 12:30:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:30:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-10 12:30:39,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-10 12:30:39,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-10 12:30:39,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-10 12:30:39,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-10 12:30:39,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 12:30:39,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 25 states and 30 transitions. [2018-11-10 12:30:39,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-10 12:30:39,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-10 12:30:39,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-10 12:30:39,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:39,422 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-10 12:30:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-10 12:30:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-10 12:30:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 12:30:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-10 12:30:39,423 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 12:30:39,423 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-10 12:30:39,423 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:30:39,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-10 12:30:39,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-10 12:30:39,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:39,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:39,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-10 12:30:39,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 12:30:39,425 INFO L793 eck$LassoCheckResult]: Stem: 671#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 669#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 670#L15-2 assume true; 672#L14-1 assume !!(main_~c~0 > 0); 685#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 684#L15-2 assume true; 677#L14-1 assume !!(main_~c~0 > 0); 683#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 682#L15-2 assume true; 681#L14-1 assume !!(main_~c~0 > 0); 680#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 676#L15-2 assume true; 673#L14-1 [2018-11-10 12:30:39,425 INFO L795 eck$LassoCheckResult]: Loop: 673#L14-1 assume !!(main_~c~0 > 0); 665#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 666#L15-2 assume true; 673#L14-1 [2018-11-10 12:30:39,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 5 times [2018-11-10 12:30:39,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:39,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 1 times [2018-11-10 12:30:39,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1635443107, now seen corresponding path program 6 times [2018-11-10 12:30:39,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,450 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:39,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:39,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:39,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:39,451 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:39,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:39,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:39,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-10 12:30:39,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:39,451 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:39,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,505 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:39,505 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,518 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:39,539 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,556 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:39,558 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:39,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:39,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:39,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:39,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:39,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:39,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:39,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-10 12:30:39,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:39,558 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:39,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,592 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:39,592 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:39,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:30:39,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:30:39,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:39,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:39,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:39,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:39,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:39,602 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:39,602 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:30:39,602 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:39,607 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:39,607 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:39,607 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-10 12:30:39,607 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:39,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,641 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:30:39,641 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:30:39,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 5 states. [2018-11-10 12:30:39,647 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 [2018-11-10 12:30:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:30:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:30:39,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 12:30:39,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,648 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:39,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:30:39,679 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:30:39,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 5 states. [2018-11-10 12:30:39,683 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 [2018-11-10 12:30:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:30:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:30:39,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 12:30:39,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,684 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:39,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,709 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:30:39,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-10 12:30:39,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 39 states and 47 transitions. Complement of second has 6 states. [2018-11-10 12:30:39,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:30:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 12:30:39,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 12:30:39,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 12:30:39,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:30:39,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:39,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-10 12:30:39,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 12:30:39,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2018-11-10 12:30:39,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-10 12:30:39,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-10 12:30:39,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-10 12:30:39,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:39,718 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-10 12:30:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-10 12:30:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-10 12:30:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 12:30:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-10 12:30:39,719 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 12:30:39,720 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-10 12:30:39,720 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:30:39,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-10 12:30:39,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:30:39,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:39,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:39,720 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-10 12:30:39,720 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-10 12:30:39,720 INFO L793 eck$LassoCheckResult]: Stem: 950#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 946#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 947#L15-2 assume true; 951#L14-1 assume !!(main_~c~0 > 0); 954#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 966#L15-2 assume true; 956#L14-1 assume !!(main_~c~0 > 0); 963#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 962#L15-2 assume true; 961#L14-1 assume !!(main_~c~0 > 0); 959#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 955#L15-2 assume true; 952#L14-1 [2018-11-10 12:30:39,720 INFO L795 eck$LassoCheckResult]: Loop: 952#L14-1 assume !!(main_~c~0 > 0); 953#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 964#L15-2 assume true; 960#L14-1 assume !!(main_~c~0 > 0); 957#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 958#L15-2 assume true; 952#L14-1 [2018-11-10 12:30:39,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,720 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 7 times [2018-11-10 12:30:39,721 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:39,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 2 times [2018-11-10 12:30:39,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:30:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash -623393122, now seen corresponding path program 8 times [2018-11-10 12:30:39,732 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:39,778 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:39,778 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:39,778 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:39,778 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:39,778 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:39,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:39,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:39,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-10 12:30:39,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:39,778 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:39,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,813 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:39,813 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,830 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:39,830 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,849 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:39,849 INFO L446 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/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,868 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 12:30:39,868 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=2} Honda state: {ULTIMATE.start_main_~c~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:39,871 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:39,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:39,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:39,897 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:39,911 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:39,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:39,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:39,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:39,912 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:39,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:39,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:39,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:39,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-10 12:30:39,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:39,912 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:39,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:39,941 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:39,941 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:39,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:30:39,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:30:39,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:39,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:39,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:39,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:39,948 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:30:39,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:39,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:39,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:39,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:39,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:39,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:39,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:39,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:39,951 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:39,952 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:39,952 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 12:30:39,952 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:39,952 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:39,953 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:39,953 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 221 Supporting invariants [] [2018-11-10 12:30:39,953 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:39,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:39,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:39,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:30:39,995 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 12:30:40,005 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 43 states and 49 transitions. Complement of second has 7 states. [2018-11-10 12:30:40,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:30:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-10 12:30:40,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:30:40,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,006 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:40,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:40,045 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:30:40,045 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 12:30:40,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 42 states and 49 transitions. Complement of second has 9 states. [2018-11-10 12:30:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:30:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-10 12:30:40,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:30:40,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,066 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:40,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:40,098 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 12:30:40,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-10 12:30:40,122 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 70 states and 82 transitions. Complement of second has 13 states. [2018-11-10 12:30:40,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 12:30:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-10 12:30:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 12:30:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-10 12:30:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-10 12:30:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 82 transitions. [2018-11-10 12:30:40,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 12:30:40,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 56 transitions. [2018-11-10 12:30:40,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-10 12:30:40,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 12:30:40,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2018-11-10 12:30:40,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:40,128 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-10 12:30:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2018-11-10 12:30:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-11-10 12:30:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:30:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-11-10 12:30:40,129 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-10 12:30:40,129 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-10 12:30:40,129 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:30:40,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-11-10 12:30:40,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 12:30:40,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:40,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:40,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 3, 3, 1, 1] [2018-11-10 12:30:40,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-10 12:30:40,131 INFO L793 eck$LassoCheckResult]: Stem: 1345#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1344#L15-2 assume true; 1360#L14-1 assume !!(main_~c~0 > 0); 1357#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 1358#L15-2 assume true; 1354#L14-1 assume !!(main_~c~0 > 0); 1355#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 1352#L15-2 assume true; 1351#L14-1 assume !!(main_~c~0 > 0); 1339#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1340#L15-2 assume true; 1346#L14-1 assume !!(main_~c~0 > 0); 1349#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1371#L15-2 assume true; 1370#L14-1 assume !!(main_~c~0 > 0); 1369#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1368#L15-2 assume true; 1365#L14-1 assume !!(main_~c~0 > 0); 1367#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 1364#L15-2 assume true; 1348#L14-1 [2018-11-10 12:30:40,131 INFO L795 eck$LassoCheckResult]: Loop: 1348#L14-1 assume !!(main_~c~0 > 0); 1349#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1371#L15-2 assume true; 1370#L14-1 assume !!(main_~c~0 > 0); 1369#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1368#L15-2 assume true; 1365#L14-1 assume !!(main_~c~0 > 0); 1367#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 1364#L15-2 assume true; 1348#L14-1 [2018-11-10 12:30:40,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,131 INFO L82 PathProgramCache]: Analyzing trace with hash -67744575, now seen corresponding path program 9 times [2018-11-10 12:30:40,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:40,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:40,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:40,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:30:40,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:30:40,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:30:40,150 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:30:40,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1348868896, now seen corresponding path program 3 times [2018-11-10 12:30:40,150 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:40,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:40,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:40,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:30:40,182 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:40,182 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:40,182 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:40,182 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:40,183 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 12:30:40,183 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:40,183 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:40,183 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:40,183 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-10 12:30:40,183 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:40,183 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:40,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,215 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:40,216 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:40,222 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 12:30:40,222 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f92c608-e664-46d3-a039-f4a1211405aa/bin-2019/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 [2018-11-10 12:30:40,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 12:30:40,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 12:30:40,270 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 12:30:40,271 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:30:40,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:30:40,272 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:30:40,272 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:30:40,272 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:30:40,272 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:30:40,272 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:30:40,272 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:30:40,272 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-10 12:30:40,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:30:40,272 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:30:40,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:30:40,313 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:30:40,313 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:30:40,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:30:40,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:30:40,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:30:40,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:30:40,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:30:40,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:30:40,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:30:40,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:30:40,317 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:30:40,318 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:30:40,318 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:30:40,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:30:40,318 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:30:40,318 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:30:40,318 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-10 12:30:40,319 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 12:30:40,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:40,367 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 [2018-11-10 12:30:40,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 12:30:40,373 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 39 states and 48 transitions. Complement of second has 5 states. [2018-11-10 12:30:40,373 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 [2018-11-10 12:30:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:30:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:30:40,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:30:40,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,374 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:40,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:40,418 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 [2018-11-10 12:30:40,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 12:30:40,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 39 states and 48 transitions. Complement of second has 5 states. [2018-11-10 12:30:40,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:30:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-10 12:30:40,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:30:40,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,424 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:40,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:40,505 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 [2018-11-10 12:30:40,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 12:30:40,526 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 86 states and 106 transitions. Complement of second has 9 states. [2018-11-10 12:30:40,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:30:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-10 12:30:40,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:30:40,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,527 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:30:40,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:30:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:30:40,577 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 [2018-11-10 12:30:40,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-10 12:30:40,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 264 states and 343 transitions. Complement of second has 53 states. [2018-11-10 12:30:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 12:30:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 12:30:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-10 12:30:40,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-10 12:30:40,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-10 12:30:40,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-10 12:30:40,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:30:40,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 343 transitions. [2018-11-10 12:30:40,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2018-11-10 12:30:40,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 158 states and 200 transitions. [2018-11-10 12:30:40,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 12:30:40,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 12:30:40,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 200 transitions. [2018-11-10 12:30:40,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:40,665 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 200 transitions. [2018-11-10 12:30:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 200 transitions. [2018-11-10 12:30:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-11-10 12:30:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 12:30:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-10 12:30:40,675 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-10 12:30:40,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 12:30:40,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 12:30:40,676 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand 5 states. [2018-11-10 12:30:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:30:40,693 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-10 12:30:40,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 12:30:40,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2018-11-10 12:30:40,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-10 12:30:40,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 75 states and 94 transitions. [2018-11-10 12:30:40,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-10 12:30:40,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-10 12:30:40,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 94 transitions. [2018-11-10 12:30:40,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:30:40,695 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-10 12:30:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 94 transitions. [2018-11-10 12:30:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-11-10 12:30:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-10 12:30:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-11-10 12:30:40,697 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-10 12:30:40,697 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-10 12:30:40,697 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 12:30:40,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 90 transitions. [2018-11-10 12:30:40,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 12:30:40,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:30:40,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:30:40,700 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 5, 4, 1, 1] [2018-11-10 12:30:40,700 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3] [2018-11-10 12:30:40,700 INFO L793 eck$LassoCheckResult]: Stem: 2461#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2459#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 2460#L15-2 assume true; 2462#L14-1 assume !!(main_~c~0 > 0); 2486#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2484#L15-2 assume true; 2472#L14-1 assume !!(main_~c~0 > 0); 2470#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2471#L15-2 assume true; 2465#L14-1 assume !!(main_~c~0 > 0); 2466#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2526#L15-2 assume true; 2525#L14-1 assume !!(main_~c~0 > 0); 2524#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2523#L15-2 assume true; 2522#L14-1 assume !!(main_~c~0 > 0); 2521#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2518#L15-2 assume true; 2517#L14-1 assume !!(main_~c~0 > 0); 2512#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2513#L15-2 assume true; 2497#L14-1 assume !!(main_~c~0 > 0); 2495#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2493#L15-2 assume true; 2491#L14-1 assume !!(main_~c~0 > 0); 2489#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2477#L15-2 assume true; 2475#L14-1 assume !!(main_~c~0 > 0); 2483#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2473#L15-2 assume true; 2474#L14-1 [2018-11-10 12:30:40,701 INFO L795 eck$LassoCheckResult]: Loop: 2474#L14-1 assume !!(main_~c~0 > 0); 2510#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2509#L15-2 assume true; 2506#L14-1 assume !!(main_~c~0 > 0); 2505#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2502#L15-2 assume true; 2501#L14-1 assume !!(main_~c~0 > 0); 2500#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2498#L15-2 assume true; 2496#L14-1 assume !!(main_~c~0 > 0); 2494#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2492#L15-2 assume true; 2490#L14-1 assume !!(main_~c~0 > 0); 2487#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2488#L15-2 assume true; 2475#L14-1 assume !!(main_~c~0 > 0); 2483#L15 assume !(main_~n~0 > 100);main_~n~0 := main_~n~0 + 11;main_~c~0 := main_~c~0 + 1; 2473#L15-2 assume true; 2474#L14-1 [2018-11-10 12:30:40,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash 831895966, now seen corresponding path program 10 times [2018-11-10 12:30:40,701 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:40,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:40,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 12:30:40,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:30:40,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:30:40,717 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:30:40,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:30:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 10579871, now seen corresponding path program 4 times [2018-11-10 12:30:40,717 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:30:40,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:30:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:30:40,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:30:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:30:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 12:30:40,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:30:40,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 12:30:40,731 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 12:30:40,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 12:30:40,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 12:30:40,731 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-10 12:30:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:30:40,736 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-10 12:30:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 12:30:40,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2018-11-10 12:30:40,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:30:40,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-10 12:30:40,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:30:40,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:30:40,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:30:40,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:30:40,738 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:30:40,738 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:30:40,738 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:30:40,738 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 12:30:40,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:30:40,738 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:30:40,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:30:40,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:30:40 BoogieIcfgContainer [2018-11-10 12:30:40,743 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:30:40,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:30:40,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:30:40,743 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:30:40,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:30:37" (3/4) ... [2018-11-10 12:30:40,746 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:30:40,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:30:40,747 INFO L168 Benchmark]: Toolchain (without parser) took 3295.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 206.6 MB). Free memory was 960.2 MB in the beginning and 919.7 MB in the end (delta: 40.5 MB). Peak memory consumption was 247.1 MB. Max. memory is 11.5 GB. [2018-11-10 12:30:40,748 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:30:40,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:30:40,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.00 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:30:40,748 INFO L168 Benchmark]: Boogie Preprocessor took 11.46 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:30:40,749 INFO L168 Benchmark]: RCFGBuilder took 149.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:30:40,749 INFO L168 Benchmark]: BuchiAutomizer took 2980.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 200.5 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:30:40,750 INFO L168 Benchmark]: Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 919.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:30:40,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.91 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.00 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.46 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 149.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2980.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.1 GB in the beginning and 919.7 MB in the end (delta: 200.5 MB). Peak memory consumption was 276.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 ms. Allocated memory is still 1.2 GB. Free memory is still 919.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (4 trivial, 3 deterministic, 4 nondeterministic). One deterministic module has affine ranking function -2 * n + 211 and consists of 4 locations. One deterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One deterministic module has affine ranking function -2 * n + 201 and consists of 4 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function c and consists of 4 locations. One nondeterministic module has affine ranking function -2 * n + 221 and consists of 4 locations. One nondeterministic module has affine ranking function c and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 98 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 71 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 3, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/15 HoareTripleCheckerStatistics: 132 SDtfs, 106 SDslu, 56 SDs, 0 SdLazy, 149 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT2 SILN0 SILU0 SILI1 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax162 hnf98 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...