./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-5842f4b [2018-11-18 14:14:14,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:14:14,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:14:14,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:14:14,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:14:14,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:14:14,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:14:14,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:14:14,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:14:14,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:14:14,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:14:14,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:14:14,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:14:14,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:14:14,804 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:14:14,805 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:14:14,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:14:14,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:14:14,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:14:14,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:14:14,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:14:14,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:14:14,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:14:14,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:14:14,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:14:14,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:14:14,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:14:14,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:14:14,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:14:14,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:14:14,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:14:14,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:14:14,819 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:14:14,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:14:14,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:14:14,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:14:14,821 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 14:14:14,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:14:14,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:14:14,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:14:14,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:14:14,834 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:14:14,835 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 14:14:14,835 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 14:14:14,835 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 14:14:14,835 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 14:14:14,835 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 14:14:14,835 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 14:14:14,835 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:14:14,835 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:14:14,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 14:14:14,837 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:14:14,837 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 14:14:14,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:14:14,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:14:14,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 14:14:14,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:14:14,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:14:14,838 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 14:14:14,838 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 14:14:14,838 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:14,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:14:14,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:14:14,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:14:14,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:14:14,875 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:14:14,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 14:14:14,917 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/data/5f7ba5669/f3154d5d4a01442bb965d06865900813/FLAG60350111d [2018-11-18 14:14:15,320 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:14:15,320 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/sv-benchmarks/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 14:14:15,324 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/data/5f7ba5669/f3154d5d4a01442bb965d06865900813/FLAG60350111d [2018-11-18 14:14:15,335 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/bin-2019/uautomizer/data/5f7ba5669/f3154d5d4a01442bb965d06865900813 [2018-11-18 14:14:15,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:14:15,338 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:14:15,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:14:15,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:14:15,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:14:15,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4546e68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15, skipping insertion in model container [2018-11-18 14:14:15,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:14:15,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:14:15,481 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:14:15,484 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:14:15,492 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:14:15,500 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:14:15,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15 WrapperNode [2018-11-18 14:14:15,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:14:15,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:14:15,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:14:15,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:14:15,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:14:15,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:14:15,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:14:15,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:14:15,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... [2018-11-18 14:14:15,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:14:15,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:14:15,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:14:15,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:14:15,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:14:15,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:14:15,844 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:14:15,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:14:15 BoogieIcfgContainer [2018-11-18 14:14:15,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:14:15,845 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 14:14:15,845 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 14:14:15,848 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 14:14:15,849 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:14:15,849 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 02:14:15" (1/3) ... [2018-11-18 14:14:15,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25bbbee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:14:15, skipping insertion in model container [2018-11-18 14:14:15,850 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:14:15,850 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:14:15" (2/3) ... [2018-11-18 14:14:15,850 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25bbbee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 02:14:15, skipping insertion in model container [2018-11-18 14:14:15,850 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 14:14:15,851 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:14:15" (3/3) ... [2018-11-18 14:14:15,852 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-18 14:14:15,908 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:14:15,909 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 14:14:15,909 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 14:14:15,909 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 14:14:15,909 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:14:15,909 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:14:15,909 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 14:14:15,909 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:14:15,909 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 14:14:15,923 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-18 14:14:15,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:15,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:15,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:15,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:14:15,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:15,957 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 14:14:15,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-18 14:14:15,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:15,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:15,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:15,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:14:15,959 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:15,968 INFO L794 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-18 14:14:15,969 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 9#L15-2true [2018-11-18 14:14:15,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:15,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 14:14:15,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:15,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:16,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:16,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 1 times [2018-11-18 14:14:16,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:16,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:16,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:16,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:16,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 28694888, now seen corresponding path program 1 times [2018-11-18 14:14:16,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:16,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:16,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:16,245 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-18 14:14:16,311 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:16,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:16,312 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:16,312 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:16,312 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:16,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:16,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:16,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:16,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-18 14:14:16,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:16,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:16,347 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-18 14:14:16,363 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-18 14:14:16,373 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-18 14:14:16,407 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-18 14:14:16,561 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:16,561 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:16,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:16,565 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:16,593 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:16,593 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:16,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:16,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:16,625 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:16,625 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:16,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:16,633 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:16,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:16,662 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:16,679 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:16,680 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:16,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:16,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:16,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:16,680 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:16,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:16,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:16,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:16,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-18 14:14:16,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:16,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:16,682 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-18 14:14:16,719 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-18 14:14:16,723 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-18 14:14:16,731 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-18 14:14:16,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:16,828 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:16,829 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-18 14:14:16,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:16,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:16,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:16,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:16,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:16,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:16,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:16,837 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:16,842 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:16,842 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:14:16,844 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:16,844 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:16,844 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:16,845 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-18 14:14:16,845 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:16,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:16,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:16,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:16,912 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-18 14:14:16,927 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-18 14:14:16,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states. Second operand 3 states. [2018-11-18 14:14:16,960 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-18 14:14:16,961 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-18 14:14:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 14:14:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-18 14:14:16,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-18 14:14:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:16,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 14:14:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 14:14:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:16,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2018-11-18 14:14:16,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:16,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2018-11-18 14:14:16,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 14:14:16,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 14:14:16,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-11-18 14:14:16,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:16,974 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 14:14:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-11-18 14:14:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-18 14:14:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 14:14:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-11-18 14:14:16,994 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 14:14:16,994 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-11-18 14:14:16,994 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 14:14:16,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2018-11-18 14:14:16,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:16,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:16,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:16,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 14:14:16,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:16,995 INFO L794 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-18 14:14:16,995 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 76#L15-2 [2018-11-18 14:14:16,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-18 14:14:16,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:16,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:17,002 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 2 times [2018-11-18 14:14:17,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:17,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:17,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:17,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash 150863077, now seen corresponding path program 1 times [2018-11-18 14:14:17,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:17,046 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-18 14:14:17,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:14:17,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:14:17,128 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:17,128 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:17,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:17,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:17,128 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:17,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:17,129 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:17,129 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:17,129 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-18 14:14:17,129 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:17,129 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:17,130 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-18 14:14:17,132 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-18 14:14:17,134 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-18 14:14:17,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-18 14:14:17,190 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:17,190 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:17,192 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:17,192 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:17,208 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:17,208 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:17,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:17,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:17,227 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:17,227 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:17,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:17,230 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:17,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:17,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:17,263 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:17,264 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:17,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:17,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:17,265 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:17,265 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:17,265 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:17,265 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:17,265 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:17,265 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-18 14:14:17,265 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:17,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:17,266 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-18 14:14:17,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-18 14:14:17,290 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-18 14:14:17,299 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-18 14:14:17,634 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:17,634 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:17,634 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-18 14:14:17,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:17,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:17,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:17,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:17,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:17,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:17,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:17,640 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-18 14:14:17,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:17,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:17,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:17,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:17,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:17,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:17,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:17,646 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:17,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:17,651 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:14:17,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:17,651 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:17,651 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:17,652 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-18 14:14:17,652 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:17,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:17,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:17,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:17,725 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-18 14:14:17,725 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-18 14:14:17,726 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-18 14:14:17,738 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-18 14:14:17,739 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-18 14:14:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 14:14:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 14:14:17,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-18 14:14:17,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:17,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-18 14:14:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:17,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-18 14:14:17,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:17,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-18 14:14:17,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:17,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 22 transitions. [2018-11-18 14:14:17,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 14:14:17,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 14:14:17,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2018-11-18 14:14:17,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:17,743 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 14:14:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2018-11-18 14:14:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-18 14:14:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 14:14:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-11-18 14:14:17,745 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-11-18 14:14:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:14:17,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:14:17,747 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-11-18 14:14:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:14:17,762 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-18 14:14:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:14:17,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-18 14:14:17,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:17,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 23 transitions. [2018-11-18 14:14:17,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 14:14:17,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 14:14:17,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-18 14:14:17,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:17,764 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 14:14:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-18 14:14:17,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-18 14:14:17,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 14:14:17,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-11-18 14:14:17,765 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 14:14:17,765 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-18 14:14:17,766 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 14:14:17,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2018-11-18 14:14:17,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 14:14:17,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:17,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:17,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2018-11-18 14:14:17,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:17,767 INFO L794 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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-18 14:14:17,768 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 200#L15-2 [2018-11-18 14:14:17,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:17,768 INFO L82 PathProgramCache]: Analyzing trace with hash -693878072, now seen corresponding path program 2 times [2018-11-18 14:14:17,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:17,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:17,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash 35946, now seen corresponding path program 3 times [2018-11-18 14:14:17,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:17,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:17,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:17,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:17,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash 355958851, now seen corresponding path program 3 times [2018-11-18 14:14:17,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:17,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:17,823 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-18 14:14:17,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:14:17,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:17,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 14:14:17,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 14:14:17,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:14:17,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:17,847 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-18 14:14:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:14:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-18 14:14:17,884 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:17,884 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:17,884 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:17,885 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:17,885 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:17,885 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:17,885 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:17,885 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:17,885 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-18 14:14:17,885 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:17,885 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:17,886 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-18 14:14:17,902 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-18 14:14:17,911 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-18 14:14:17,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-18 14:14:17,995 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:17,995 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:17,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:17,998 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:18,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:18,033 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:18,035 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:18,035 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:18,035 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:18,035 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:18,035 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:18,035 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:18,035 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:18,036 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:18,036 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-18 14:14:18,036 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:18,036 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:18,037 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-18 14:14:18,046 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-18 14:14:18,050 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-18 14:14:18,066 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-18 14:14:18,121 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:18,121 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:18,122 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-18 14:14:18,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:18,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:18,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:18,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:18,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:18,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:18,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:18,126 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:18,130 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:18,130 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:14:18,130 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:18,130 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:18,130 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:18,130 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-18 14:14:18,131 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:18,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,178 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-18 14:14:18,179 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-18 14:14:18,179 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 14:14:18,184 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-18 14:14:18,185 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-18 14:14:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 14:14:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 14:14:18,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 14:14:18,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,185 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:18,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,203 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-18 14:14:18,203 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-18 14:14:18,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 14:14:18,223 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-18 14:14:18,224 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-18 14:14:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 14:14:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-18 14:14:18,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 14:14:18,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,225 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:18,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,266 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-18 14:14:18,267 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-18 14:14:18,267 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 14:14:18,277 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-18 14:14:18,278 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-18 14:14:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 14:14:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-18 14:14:18,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-18 14:14:18,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-18 14:14:18,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 14:14:18,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-18 14:14:18,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 14:14:18,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2018-11-18 14:14:18,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 14:14:18,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-18 14:14:18,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2018-11-18 14:14:18,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:18,282 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-18 14:14:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2018-11-18 14:14:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 9. [2018-11-18 14:14:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 14:14:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-18 14:14:18,283 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-18 14:14:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:14:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:14:18,284 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-11-18 14:14:18,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:14:18,318 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-18 14:14:18,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:14:18,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2018-11-18 14:14:18,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 14:14:18,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 20 transitions. [2018-11-18 14:14:18,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 14:14:18,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 14:14:18,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-18 14:14:18,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:18,321 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-18 14:14:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-18 14:14:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-11-18 14:14:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 14:14:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 14:14:18,322 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 14:14:18,323 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 14:14:18,323 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 14:14:18,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 14:14:18,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-18 14:14:18,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:18,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:18,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 14:14:18,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-18 14:14:18,324 INFO L794 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-18 14:14:18,324 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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-18 14:14:18,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,324 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 14:14:18,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:18,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:18,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1070873439, now seen corresponding path program 1 times [2018-11-18 14:14:18,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:18,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:18,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:18,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 150922657, now seen corresponding path program 4 times [2018-11-18 14:14:18,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:18,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:18,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,396 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:18,396 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:18,396 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:18,396 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:18,396 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:18,396 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:18,396 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:18,396 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:18,397 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-18 14:14:18,397 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:18,397 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:18,398 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-18 14:14:18,401 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-18 14:14:18,403 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-18 14:14:18,406 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-18 14:14:18,438 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:18,438 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:18,441 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:18,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:18,457 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:18,460 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:18,476 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:18,476 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,480 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:18,480 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:18,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:18,499 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:18,505 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:18,523 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:18,526 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:18,540 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:18,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:18,541 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:18,541 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:18,541 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:18,541 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:18,541 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:18,541 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:18,541 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-18 14:14:18,541 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:18,541 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:18,542 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-18 14:14:18,545 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-18 14:14:18,547 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-18 14:14:18,548 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-18 14:14:18,589 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:18,590 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:18,590 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-18 14:14:18,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:18,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:18,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:18,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:18,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:18,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:18,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:18,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:18,595 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-18 14:14:18,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:18,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:18,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:18,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:18,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:18,597 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:18,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:18,601 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-18 14:14:18,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:18,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:18,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:18,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:18,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:18,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:18,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:18,606 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-18 14:14:18,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:18,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:18,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:18,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:18,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:18,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:18,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:18,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:18,613 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:18,613 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:14:18,613 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:18,613 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:18,613 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:18,614 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2018-11-18 14:14:18,614 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:18,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,688 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-18 14:14:18,689 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-18 14:14:18,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 14:14:18,702 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-18 14:14:18,702 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-18 14:14:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-18 14:14:18,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 14:14:18,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,703 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:18,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:18,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:18,744 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-18 14:14:18,745 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-18 14:14:18,745 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2018-11-18 14:14:18,762 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-18 14:14:18,763 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-18 14:14:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-18 14:14:18,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-18 14:14:18,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-18 14:14:18,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-18 14:14:18,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:18,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-18 14:14:18,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 14:14:18,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 25 states and 30 transitions. [2018-11-18 14:14:18,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 14:14:18,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-18 14:14:18,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 30 transitions. [2018-11-18 14:14:18,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:18,766 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-18 14:14:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 30 transitions. [2018-11-18 14:14:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-18 14:14:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 14:14:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-18 14:14:18,768 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-18 14:14:18,768 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-18 14:14:18,768 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 14:14:18,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2018-11-18 14:14:18,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 14:14:18,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:18,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:18,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-18 14:14:18,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 14:14:18,770 INFO L794 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 684#L15-2 assume true; 677#L14-1 assume !!(main_~c~0 > 0); 683#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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-18 14:14:18,770 INFO L796 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-18 14:14:18,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 5 times [2018-11-18 14:14:18,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 41794, now seen corresponding path program 1 times [2018-11-18 14:14:18,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:18,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:18,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1635443107, now seen corresponding path program 6 times [2018-11-18 14:14:18,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:18,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:18,814 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:18,814 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:18,814 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:18,814 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:18,814 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:18,814 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:18,814 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:18,814 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:18,815 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-18 14:14:18,815 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:18,815 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:18,817 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-18 14:14:18,823 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-18 14:14:18,825 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-18 14:14:18,827 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-18 14:14:18,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:18,902 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:18,926 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:18,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:18,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:18,967 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:18,968 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:18,968 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:18,968 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:18,968 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:18,968 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:18,968 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:18,968 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:18,968 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:18,968 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-18 14:14:18,968 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:18,969 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:18,970 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-18 14:14:18,975 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-18 14:14:18,982 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-18 14:14:18,984 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-18 14:14:19,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:19,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:19,017 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-18 14:14:19,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:19,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:19,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:19,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:19,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:19,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:19,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:19,022 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-18 14:14:19,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:19,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:19,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:19,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:19,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:19,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:19,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:19,025 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:19,026 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:19,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:14:19,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:19,027 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:19,027 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:19,027 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-18 14:14:19,027 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:19,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,128 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-18 14:14:19,128 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-18 14:14:19,128 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 14:14:19,136 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-18 14:14:19,139 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-18 14:14:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 14:14:19,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 14:14:19,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,139 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:19,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,165 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-18 14:14:19,166 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-18 14:14:19,166 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 14:14:19,170 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-18 14:14:19,171 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-18 14:14:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 14:14:19,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 14:14:19,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,172 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:19,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,222 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-18 14:14:19,222 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-18 14:14:19,223 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-18 14:14:19,229 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-18 14:14:19,229 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-18 14:14:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 14:14:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 14:14:19,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 14:14:19,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-18 14:14:19,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 14:14:19,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 47 transitions. [2018-11-18 14:14:19,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 14:14:19,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 26 states and 31 transitions. [2018-11-18 14:14:19,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-18 14:14:19,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-18 14:14:19,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-18 14:14:19,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:19,232 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-18 14:14:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-18 14:14:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-18 14:14:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 14:14:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2018-11-18 14:14:19,234 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-18 14:14:19,234 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-18 14:14:19,235 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 14:14:19,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2018-11-18 14:14:19,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 14:14:19,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:19,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:19,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1] [2018-11-18 14:14:19,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-18 14:14:19,236 INFO L794 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 966#L15-2 assume true; 956#L14-1 assume !!(main_~c~0 > 0); 963#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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-18 14:14:19,236 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 958#L15-2 assume true; 952#L14-1 [2018-11-18 14:14:19,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,236 INFO L82 PathProgramCache]: Analyzing trace with hash -33536704, now seen corresponding path program 7 times [2018-11-18 14:14:19,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:19,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1245097119, now seen corresponding path program 2 times [2018-11-18 14:14:19,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:14:19,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,259 INFO L82 PathProgramCache]: Analyzing trace with hash -623393122, now seen corresponding path program 8 times [2018-11-18 14:14:19,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:19,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:19,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:19,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,359 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:19,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:19,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:19,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:19,359 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:19,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:19,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:19,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:19,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-18 14:14:19,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:19,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:19,361 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-18 14:14:19,366 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-18 14:14:19,372 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-18 14:14:19,381 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-18 14:14:19,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:19,461 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:19,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:19,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:19,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:19,480 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:19,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:19,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:19,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:19,499 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:19,502 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:19,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:19,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 14:14:19,523 INFO L448 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_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:19,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:19,527 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:19,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:19,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:19,550 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:19,573 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:19,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:19,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:19,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:19,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:19,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:19,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:19,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:19,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-18 14:14:19,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:19,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:19,575 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-18 14:14:19,577 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-18 14:14:19,587 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-18 14:14:19,593 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-18 14:14:19,649 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:19,650 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:19,650 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-18 14:14:19,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:19,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:19,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:19,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:19,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 14:14:19,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 14:14:19,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:19,654 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-18 14:14:19,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:19,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:19,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:19,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:19,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:19,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:19,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:19,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 14:14:19,657 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-18 14:14:19,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:19,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:19,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:19,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:19,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:19,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:19,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:19,660 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:19,661 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:19,661 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 14:14:19,662 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:19,662 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:19,662 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:19,662 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 221 Supporting invariants [] [2018-11-18 14:14:19,662 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:19,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,719 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-18 14:14:19,719 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-18 14:14:19,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 14:14:19,734 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-18 14:14:19,735 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-18 14:14:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:14:19,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-18 14:14:19,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 14:14:19,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,735 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:19,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,803 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-18 14:14:19,803 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-18 14:14:19,803 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 14:14:19,826 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-18 14:14:19,827 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-18 14:14:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:14:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-18 14:14:19,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 14:14:19,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,827 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:19,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:19,893 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-18 14:14:19,894 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-18 14:14:19,894 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-18 14:14:19,912 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-18 14:14:19,913 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-18 14:14:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 14:14:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-18 14:14:19,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-18 14:14:19,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 6 letters. [2018-11-18 14:14:19,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 12 letters. [2018-11-18 14:14:19,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:19,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 82 transitions. [2018-11-18 14:14:19,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-18 14:14:19,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 47 states and 56 transitions. [2018-11-18 14:14:19,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-18 14:14:19,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 14:14:19,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2018-11-18 14:14:19,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:19,917 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2018-11-18 14:14:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2018-11-18 14:14:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2018-11-18 14:14:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 14:14:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-11-18 14:14:19,923 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-18 14:14:19,923 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-18 14:14:19,923 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 14:14:19,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-11-18 14:14:19,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-18 14:14:19,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:19,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:19,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 3, 3, 1, 1] [2018-11-18 14:14:19,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-18 14:14:19,929 INFO L794 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1358#L15-2 assume true; 1354#L14-1 assume !!(main_~c~0 > 0); 1355#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1364#L15-2 assume true; 1348#L14-1 [2018-11-18 14:14:19,929 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1364#L15-2 assume true; 1348#L14-1 [2018-11-18 14:14:19,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash -67744575, now seen corresponding path program 9 times [2018-11-18 14:14:19,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:19,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:19,963 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-18 14:14:19,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:14:19,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:14:19,964 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:14:19,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1348868896, now seen corresponding path program 3 times [2018-11-18 14:14:19,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:14:20,033 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:20,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:20,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:20,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:20,034 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 14:14:20,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:20,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:20,034 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:20,034 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-18 14:14:20,034 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:20,034 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:20,035 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-18 14:14:20,047 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-18 14:14:20,051 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-18 14:14:20,055 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-18 14:14:20,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:20,083 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:20,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 14:14:20,086 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cfbc6e3f-5134-4ef7-b621-f542ee857a2f/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-18 14:14:20,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 14:14:20,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 14:14:20,121 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 14:14:20,122 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 14:14:20,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 14:14:20,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 14:14:20,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 14:14:20,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 14:14:20,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 14:14:20,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 14:14:20,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 14:14:20,123 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-18 14:14:20,123 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 14:14:20,123 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 14:14:20,124 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-18 14:14:20,128 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-18 14:14:20,132 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-18 14:14:20,134 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-18 14:14:20,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 14:14:20,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 14:14:20,239 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-18 14:14:20,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 14:14:20,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 14:14:20,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 14:14:20,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 14:14:20,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 14:14:20,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 14:14:20,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 14:14:20,241 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 14:14:20,243 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 14:14:20,243 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 14:14:20,243 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 14:14:20,243 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 14:14:20,243 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 14:14:20,243 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-18 14:14:20,244 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-18 14:14:20,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,587 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-18 14:14:20,587 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-18 14:14:20,587 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 14:14:20,592 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-18 14:14:20,593 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-18 14:14:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 14:14:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 14:14:20,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 14:14:20,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:20,593 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:20,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,631 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-18 14:14:20,632 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-18 14:14:20,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 14:14:20,637 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-18 14:14:20,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-18 14:14:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 14:14:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-18 14:14:20,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 14:14:20,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:20,639 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:20,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,696 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-18 14:14:20,696 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-18 14:14:20,697 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 14:14:20,730 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-18 14:14:20,732 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-18 14:14:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 14:14:20,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-18 14:14:20,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 14:14:20,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:20,734 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 14:14:20,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:14:20,823 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-18 14:14:20,823 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-18 14:14:20,823 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 45 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-18 14:14:20,882 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-18 14:14:20,882 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-18 14:14:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 14:14:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2018-11-18 14:14:20,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-18 14:14:20,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:20,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-18 14:14:20,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:20,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 21 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-18 14:14:20,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 14:14:20,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 343 transitions. [2018-11-18 14:14:20,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 114 [2018-11-18 14:14:20,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 158 states and 200 transitions. [2018-11-18 14:14:20,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 14:14:20,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-18 14:14:20,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 200 transitions. [2018-11-18 14:14:20,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:20,889 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 200 transitions. [2018-11-18 14:14:20,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 200 transitions. [2018-11-18 14:14:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2018-11-18 14:14:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 14:14:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2018-11-18 14:14:20,896 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 130 transitions. [2018-11-18 14:14:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:14:20,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:14:20,896 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand 5 states. [2018-11-18 14:14:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:14:20,930 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-18 14:14:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:14:20,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2018-11-18 14:14:20,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-18 14:14:20,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 75 states and 94 transitions. [2018-11-18 14:14:20,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-18 14:14:20,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-18 14:14:20,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 94 transitions. [2018-11-18 14:14:20,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 14:14:20,933 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-11-18 14:14:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 94 transitions. [2018-11-18 14:14:20,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-11-18 14:14:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 14:14:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-11-18 14:14:20,939 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-18 14:14:20,939 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-18 14:14:20,939 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 14:14:20,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 90 transitions. [2018-11-18 14:14:20,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-18 14:14:20,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 14:14:20,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 14:14:20,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 5, 4, 1, 1] [2018-11-18 14:14:20,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3] [2018-11-18 14:14:20,941 INFO L794 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2484#L15-2 assume true; 2472#L14-1 assume !!(main_~c~0 > 0); 2470#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2518#L15-2 assume true; 2517#L14-1 assume !!(main_~c~0 > 0); 2512#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2473#L15-2 assume true; 2474#L14-1 [2018-11-18 14:14:20,941 INFO L796 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 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 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2488#L15-2 assume true; 2475#L14-1 assume !!(main_~c~0 > 0); 2483#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2473#L15-2 assume true; 2474#L14-1 [2018-11-18 14:14:20,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash 831895966, now seen corresponding path program 10 times [2018-11-18 14:14:20,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:20,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:20,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:20,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:20,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,963 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-18 14:14:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:14:20,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:14:20,963 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 14:14:20,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:14:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash 10579871, now seen corresponding path program 4 times [2018-11-18 14:14:20,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:14:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:14:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:20,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:14:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:14:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:14:20,983 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-18 14:14:20,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:14:20,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:14:20,983 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 14:14:20,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:14:20,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:14:20,984 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. cyclomatic complexity: 22 Second operand 4 states. [2018-11-18 14:14:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:14:21,008 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-18 14:14:21,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:14:21,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2018-11-18 14:14:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:14:21,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-11-18 14:14:21,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 14:14:21,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 14:14:21,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 14:14:21,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 14:14:21,010 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:14:21,010 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:14:21,010 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:14:21,010 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 14:14:21,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:14:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 14:14:21,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 14:14:21,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 02:14:21 BoogieIcfgContainer [2018-11-18 14:14:21,016 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 14:14:21,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:14:21,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:14:21,017 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:14:21,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:14:15" (3/4) ... [2018-11-18 14:14:21,020 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:14:21,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:14:21,021 INFO L168 Benchmark]: Toolchain (without parser) took 5683.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 952.7 MB in the beginning and 938.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 247.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:21,022 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:14:21,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:21,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.58 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:21,023 INFO L168 Benchmark]: Boogie Preprocessor took 15.98 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:14:21,023 INFO L168 Benchmark]: RCFGBuilder took 300.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -209.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:21,024 INFO L168 Benchmark]: BuchiAutomizer took 5171.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 210.0 MB). Peak memory consumption was 278.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:14:21,024 INFO L168 Benchmark]: Witness Printer took 3.92 ms. Allocated memory is still 1.3 GB. Free memory is still 938.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:14:21,027 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 26.58 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.98 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 300.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -209.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5171.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 210.0 MB). Peak memory consumption was 278.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.92 ms. Allocated memory is still 1.3 GB. Free memory is still 938.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 5.1s and 9 iterations. TraceHistogramMax:10. Analysis of lassos took 3.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. 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.2s 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: 6ms 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...