./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:27:54,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:27:54,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:27:54,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:27:54,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:27:54,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:27:54,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:27:54,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:27:54,354 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:27:54,355 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:27:54,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:27:54,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:27:54,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:27:54,356 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:27:54,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:27:54,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:27:54,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:27:54,358 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:27:54,359 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:27:54,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:27:54,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:27:54,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:27:54,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:27:54,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:27:54,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:27:54,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:27:54,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:27:54,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:27:54,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:27:54,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:27:54,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:27:54,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:27:54,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:27:54,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:27:54,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:27:54,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:27:54,366 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 15:27:54,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:27:54,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:27:54,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:27:54,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:27:54,374 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:27:54,374 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 15:27:54,374 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 15:27:54,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 15:27:54,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 15:27:54,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 15:27:54,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:27:54,376 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 15:27:54,377 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 15:27:54,377 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_f14efb2c-70b9-44ba-a527-317291620ed3/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 -> 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 [2018-12-02 15:27:54,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:27:54,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:27:54,402 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:27:54,403 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:27:54,403 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:27:54,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2018-12-02 15:27:54,437 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/data/ddd42ca43/b52c7108648346c891e8b0fcc0334763/FLAG03f76b781 [2018-12-02 15:27:54,734 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:27:54,734 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2018-12-02 15:27:54,738 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/data/ddd42ca43/b52c7108648346c891e8b0fcc0334763/FLAG03f76b781 [2018-12-02 15:27:54,747 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/data/ddd42ca43/b52c7108648346c891e8b0fcc0334763 [2018-12-02 15:27:54,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:27:54,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:27:54,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:27:54,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:27:54,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:27:54,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b10c34e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54, skipping insertion in model container [2018-12-02 15:27:54,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:27:54,767 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:27:54,847 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:27:54,849 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:27:54,858 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:27:54,865 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:27:54,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54 WrapperNode [2018-12-02 15:27:54,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:27:54,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:27:54,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:27:54,866 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:27:54,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:27:54,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:27:54,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:27:54,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:27:54,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... [2018-12-02 15:27:54,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:27:54,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:27:54,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:27:54,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:27:54,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:54,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:27:54,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:27:55,022 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:27:55,023 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-02 15:27:55,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:27:55 BoogieIcfgContainer [2018-12-02 15:27:55,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:27:55,023 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 15:27:55,023 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 15:27:55,025 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 15:27:55,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:27:55,026 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:27:54" (1/3) ... [2018-12-02 15:27:55,026 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48f9af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:27:55, skipping insertion in model container [2018-12-02 15:27:55,026 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:27:55,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:27:54" (2/3) ... [2018-12-02 15:27:55,027 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48f9af2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:27:55, skipping insertion in model container [2018-12-02 15:27:55,027 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 15:27:55,027 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:27:55" (3/3) ... [2018-12-02 15:27:55,028 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq_false-termination_true-no-overflow.c [2018-12-02 15:27:55,058 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:27:55,059 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 15:27:55,059 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 15:27:55,059 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 15:27:55,059 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:27:55,059 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:27:55,059 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 15:27:55,059 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:27:55,059 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 15:27:55,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-02 15:27:55,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 15:27:55,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:55,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:55,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-02 15:27:55,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:55,083 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 15:27:55,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-02 15:27:55,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-02 15:27:55,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:55,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:55,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-02 15:27:55,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:55,089 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2018-12-02 15:27:55,089 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume main_~i~0 >= 10;main_~up~0 := 0; 3#L12-2true assume main_~i~0 <= 0;main_~up~0 := 1; 9#L15-1true assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2018-12-02 15:27:55,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,092 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-02 15:27:55,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2018-12-02 15:27:55,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:55,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:27:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:27:55,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:55,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:27:55,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:27:55,195 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-02 15:27:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:55,222 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-02 15:27:55,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:27:55,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-02 15:27:55,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:27:55,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 13 transitions. [2018-12-02 15:27:55,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 15:27:55,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 15:27:55,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-12-02 15:27:55,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 15:27:55,229 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-12-02 15:27:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-12-02 15:27:55,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-02 15:27:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 15:27:55,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-12-02 15:27:55,246 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-12-02 15:27:55,246 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-12-02 15:27:55,246 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 15:27:55,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2018-12-02 15:27:55,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:27:55,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:55,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:55,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-02 15:27:55,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:55,247 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 38#L18-1 [2018-12-02 15:27:55,247 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 35#L12-2 assume !(main_~i~0 <= 0); 36#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2018-12-02 15:27:55,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,247 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-02 15:27:55,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2018-12-02 15:27:55,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:55,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,257 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2018-12-02 15:27:55,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,308 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:55,308 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:55,308 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:55,308 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:55,308 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:55,308 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:55,309 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:55,309 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:55,309 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2018-12-02 15:27:55,309 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:55,309 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:55,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,393 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:55,394 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,417 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:55,417 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_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:55,435 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_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:55,441 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,455 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:55,472 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,474 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:55,487 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:55,487 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:55,487 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:55,487 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:55,488 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:55,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:55,488 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:55,488 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:55,488 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2018-12-02 15:27:55,488 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:55,488 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:55,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:55,527 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:55,528 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-12-02 15:27:55,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,531 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:55,531 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:55,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:55,535 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-12-02 15:27:55,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:55,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:55,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:55,542 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-12-02 15:27:55,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:55,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,543 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:55,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:55,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:55,545 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-12-02 15:27:55,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:55,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:55,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:55,549 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:55,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:55,551 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:27:55,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:55,553 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:55,553 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:55,553 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 15:27:55,554 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:55,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:55,609 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-12-02 15:27:55,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 15:27:55,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 31 transitions. Complement of second has 5 states. [2018-12-02 15:27:55,634 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-12-02 15:27:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 15:27:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-02 15:27:55,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-02 15:27:55,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:55,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 15:27:55,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:55,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2018-12-02 15:27:55,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:55,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. [2018-12-02 15:27:55,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:27:55,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 31 transitions. [2018-12-02 15:27:55,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-02 15:27:55,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 15:27:55,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2018-12-02 15:27:55,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:55,638 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-12-02 15:27:55,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2018-12-02 15:27:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-02 15:27:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 15:27:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-12-02 15:27:55,640 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-12-02 15:27:55,640 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-12-02 15:27:55,640 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 15:27:55,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2018-12-02 15:27:55,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-02 15:27:55,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:55,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:55,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:27:55,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:55,641 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 112#L12-2 assume !(main_~i~0 <= 0); 120#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-12-02 15:27:55,641 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 117#L12-2 assume !(main_~i~0 <= 0); 118#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-12-02 15:27:55,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2018-12-02 15:27:55,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:55,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:27:55,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:27:55,650 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:55,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2018-12-02 15:27:55,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:55,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:27:55,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:27:55,657 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:55,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:27:55,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:27:55,657 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-02 15:27:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:55,661 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2018-12-02 15:27:55,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:27:55,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2018-12-02 15:27:55,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-02 15:27:55,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2018-12-02 15:27:55,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 15:27:55,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 15:27:55,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2018-12-02 15:27:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:55,663 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-12-02 15:27:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2018-12-02 15:27:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-02 15:27:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 15:27:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-12-02 15:27:55,664 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-02 15:27:55,664 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-12-02 15:27:55,664 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 15:27:55,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-12-02 15:27:55,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-02 15:27:55,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:55,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:55,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:27:55,665 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:55,665 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 157#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 161#L12 assume !(main_~i~0 >= 10); 169#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 165#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2018-12-02 15:27:55,665 INFO L796 eck$LassoCheckResult]: Loop: 166#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 170#L12 assume !(main_~i~0 >= 10); 168#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 167#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2018-12-02 15:27:55,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2018-12-02 15:27:55,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2018-12-02 15:27:55,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,674 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2018-12-02 15:27:55,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:55,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:27:55,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:27:55,702 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:55,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:55,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:55,703 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:55,703 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:55,703 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:55,703 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:55,703 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:55,703 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration4_Loop [2018-12-02 15:27:55,703 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:55,703 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:55,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:55,745 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,762 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:55,762 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_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:55,779 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_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,784 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:55,785 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:55,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:55,808 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:55,825 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:55,825 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:55,828 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:55,841 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:55,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:55,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:55,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:55,841 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:55,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:55,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:55,841 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:55,841 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration4_Loop [2018-12-02 15:27:55,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:55,842 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:55,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:55,878 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:55,878 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:55,878 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-12-02 15:27:55,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:55,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:55,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:55,883 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-12-02 15:27:55,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:55,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:55,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:55,887 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-12-02 15:27:55,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:55,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:55,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:55,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:55,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:55,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:55,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:55,890 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:55,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:55,891 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:27:55,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:55,892 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:55,892 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:55,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-12-02 15:27:55,892 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:55,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:55,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:55,924 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-12-02 15:27:55,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-12-02 15:27:55,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 36 states and 52 transitions. Complement of second has 7 states. [2018-12-02 15:27:55,946 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-12-02 15:27:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:27:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 15:27:55,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 15:27:55,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:55,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 15:27:55,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:55,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 15:27:55,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:55,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 52 transitions. [2018-12-02 15:27:55,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-02 15:27:55,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 50 transitions. [2018-12-02 15:27:55,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-02 15:27:55,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 15:27:55,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2018-12-02 15:27:55,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:55,950 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-12-02 15:27:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2018-12-02 15:27:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-02 15:27:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 15:27:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2018-12-02 15:27:55,953 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-12-02 15:27:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:27:55,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:27:55,954 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 4 states. [2018-12-02 15:27:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:55,969 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-12-02 15:27:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:27:55,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2018-12-02 15:27:55,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-12-02 15:27:55,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 40 transitions. [2018-12-02 15:27:55,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-02 15:27:55,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-02 15:27:55,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2018-12-02 15:27:55,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:55,971 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-12-02 15:27:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2018-12-02 15:27:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-02 15:27:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 15:27:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-12-02 15:27:55,973 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-12-02 15:27:55,973 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-12-02 15:27:55,973 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 15:27:55,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2018-12-02 15:27:55,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-02 15:27:55,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:55,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:55,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 15:27:55,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:55,975 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 331#L12 assume !(main_~i~0 >= 10); 338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 337#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2018-12-02 15:27:55,975 INFO L796 eck$LassoCheckResult]: Loop: 328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 329#L12 assume !(main_~i~0 >= 10); 322#L12-2 assume !(main_~i~0 <= 0); 323#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2018-12-02 15:27:55,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2018-12-02 15:27:55,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2018-12-02 15:27:55,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:55,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2018-12-02 15:27:55,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:55,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:55,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:55,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,006 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:56,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:56,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:56,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:56,006 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:56,006 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:56,006 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:56,006 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:56,006 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration5_Loop [2018-12-02 15:27:56,006 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:56,007 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:56,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:56,039 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,055 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,056 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,058 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,073 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,089 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,090 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,093 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:56,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,111 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:56,124 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:56,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:56,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:56,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:56,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:56,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:56,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:56,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:56,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration5_Loop [2018-12-02 15:27:56,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:56,125 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:56,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,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-12-02 15:27:56,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:56,168 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:56,169 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-12-02 15:27:56,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:56,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:56,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:56,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:56,171 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-12-02 15:27:56,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:56,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:56,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:56,175 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-12-02 15:27:56,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:56,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:56,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:56,179 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:56,182 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:56,182 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:27:56,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:56,182 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:56,182 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:56,183 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-12-02 15:27:56,183 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:56,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,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-12-02 15:27:56,203 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-12-02 15:27:56,203 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-12-02 15:27:56,229 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-12-02 15:27:56,230 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-12-02 15:27:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 15:27:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 15:27:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 15:27:56,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-02 15:27:56,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-02 15:27:56,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-12-02 15:27:56,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-02 15:27:56,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 40 transitions. [2018-12-02 15:27:56,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 15:27:56,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 15:27:56,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2018-12-02 15:27:56,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:56,232 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-12-02 15:27:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2018-12-02 15:27:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-12-02 15:27:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 15:27:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2018-12-02 15:27:56,233 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2018-12-02 15:27:56,233 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2018-12-02 15:27:56,233 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 15:27:56,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2018-12-02 15:27:56,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-02 15:27:56,234 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:56,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:56,234 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-12-02 15:27:56,234 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:56,234 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 440#L12 assume !(main_~i~0 >= 10); 443#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 442#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 441#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 433#L12 assume !(main_~i~0 >= 10); 423#L12-2 [2018-12-02 15:27:56,234 INFO L796 eck$LassoCheckResult]: Loop: 423#L12-2 assume !(main_~i~0 <= 0); 424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 434#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 447#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 423#L12-2 [2018-12-02 15:27:56,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918576, now seen corresponding path program 4 times [2018-12-02 15:27:56,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:56,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:56,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2018-12-02 15:27:56,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:56,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:56,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash -912839815, now seen corresponding path program 1 times [2018-12-02 15:27:56,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:56,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:27:56,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:27:56,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:27:56,277 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:56,277 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:56,277 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:56,277 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:56,277 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:56,277 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:56,277 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:56,277 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:56,277 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2018-12-02 15:27:56,277 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:56,278 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:56,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,316 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:56,317 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,320 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,349 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,349 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_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,352 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:56,369 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,458 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:56,459 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:56,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:56,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:56,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:56,460 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:56,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:56,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:56,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:56,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2018-12-02 15:27:56,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:56,460 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:56,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,502 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:56,502 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:56,502 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-12-02 15:27:56,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:56,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:56,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:56,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:56,504 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-12-02 15:27:56,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:56,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:56,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:56,508 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:56,509 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:56,509 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:27:56,510 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:56,510 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:56,510 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:56,510 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 15:27:56,510 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:56,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:56,544 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-12-02 15:27:56,544 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 15:27:56,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2018-12-02 15:27:56,563 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-12-02 15:27:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:56,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-02 15:27:56,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 15:27:56,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,564 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:27:56,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:56,590 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-12-02 15:27:56,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 15:27:56,613 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 77 states and 108 transitions. Complement of second has 9 states. [2018-12-02 15:27:56,613 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-12-02 15:27:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-02 15:27:56,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 15:27:56,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,613 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:27:56,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:56,637 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-12-02 15:27:56,637 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-12-02 15:27:56,655 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 53 states and 81 transitions. Complement of second has 8 states. [2018-12-02 15:27:56,656 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-12-02 15:27:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-02 15:27:56,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 15:27:56,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 15:27:56,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-02 15:27:56,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2018-12-02 15:27:56,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-02 15:27:56,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 42 states and 60 transitions. [2018-12-02 15:27:56,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-12-02 15:27:56,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-02 15:27:56,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2018-12-02 15:27:56,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:56,659 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-12-02 15:27:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2018-12-02 15:27:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-12-02 15:27:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 15:27:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2018-12-02 15:27:56,660 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2018-12-02 15:27:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:27:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:27:56,660 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 3 states. [2018-12-02 15:27:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:56,665 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2018-12-02 15:27:56,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:27:56,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2018-12-02 15:27:56,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 15:27:56,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 41 transitions. [2018-12-02 15:27:56,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 15:27:56,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 15:27:56,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2018-12-02 15:27:56,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:56,666 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-12-02 15:27:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2018-12-02 15:27:56,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-02 15:27:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 15:27:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-12-02 15:27:56,667 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-12-02 15:27:56,667 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-12-02 15:27:56,667 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 15:27:56,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2018-12-02 15:27:56,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 15:27:56,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:56,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:56,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-02 15:27:56,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:56,668 INFO L794 eck$LassoCheckResult]: Stem: 836#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 842#L12 assume !(main_~i~0 >= 10); 843#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 856#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 851#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2018-12-02 15:27:56,668 INFO L796 eck$LassoCheckResult]: Loop: 848#L12-2 assume !(main_~i~0 <= 0); 850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 847#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2018-12-02 15:27:56,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2018-12-02 15:27:56,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:56,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:56,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:27:56,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 15:27:56,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:56,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2018-12-02 15:27:56,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:56,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:56,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:56,693 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:56,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:56,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:56,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:56,694 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:56,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:56,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:56,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:56,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2018-12-02 15:27:56,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:56,694 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:56,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,722 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:56,722 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,724 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,724 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,726 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,726 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,741 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,741 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,756 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,773 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:56,773 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:56,776 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/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-12-02 15:27:56,791 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:56,791 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:56,877 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:56,878 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:56,878 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:56,878 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:56,878 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:56,878 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:56,878 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:56,878 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:56,878 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:56,879 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2018-12-02 15:27:56,879 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:56,879 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:56,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:56,916 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:56,916 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:56,917 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-12-02 15:27:56,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:56,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:56,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:56,919 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-12-02 15:27:56,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:56,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:56,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:56,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:56,921 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-12-02 15:27:56,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:56,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:56,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:56,924 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-12-02 15:27:56,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:56,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:56,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:56,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:56,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:56,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:56,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:56,926 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:56,927 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:56,927 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:27:56,927 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:56,927 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:56,927 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:56,927 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 15:27:56,927 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:56,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:56,950 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-12-02 15:27:56,950 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-02 15:27:56,965 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 70 states and 94 transitions. Complement of second has 7 states. [2018-12-02 15:27:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 15:27:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-02 15:27:56,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 15:27:56,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-02 15:27:56,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-02 15:27:56,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:56,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2018-12-02 15:27:56,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-02 15:27:56,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 74 transitions. [2018-12-02 15:27:56,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 15:27:56,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 15:27:56,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2018-12-02 15:27:56,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:56,968 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2018-12-02 15:27:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2018-12-02 15:27:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2018-12-02 15:27:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 15:27:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2018-12-02 15:27:56,970 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2018-12-02 15:27:56,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:27:56,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:27:56,970 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 4 states. [2018-12-02 15:27:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:56,981 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-12-02 15:27:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:27:56,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2018-12-02 15:27:56,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-12-02 15:27:56,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 66 transitions. [2018-12-02 15:27:56,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 15:27:56,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 15:27:56,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2018-12-02 15:27:56,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:56,983 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-12-02 15:27:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2018-12-02 15:27:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-12-02 15:27:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 15:27:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-12-02 15:27:56,985 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-02 15:27:56,985 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-02 15:27:56,985 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 15:27:56,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-12-02 15:27:56,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-02 15:27:56,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:56,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:56,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-12-02 15:27:56,986 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 15:27:56,986 INFO L794 eck$LassoCheckResult]: Stem: 1092#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1093#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1112#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1113#L12-2 assume !(main_~i~0 <= 0); 1103#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1104#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1098#L12 assume !(main_~i~0 >= 10); 1099#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1106#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1094#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1095#L12 assume !(main_~i~0 >= 10); 1100#L12-2 assume !(main_~i~0 <= 0); 1105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1096#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1097#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2018-12-02 15:27:56,987 INFO L796 eck$LassoCheckResult]: Loop: 1107#L12-2 assume !(main_~i~0 <= 0); 1108#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1129#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1127#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2018-12-02 15:27:56,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 2 times [2018-12-02 15:27:56,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:56,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:56,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:56,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:27:56,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:56,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:27:57,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:27:57,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:27:57,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-02 15:27:57,032 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:57,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 4 times [2018-12-02 15:27:57,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:57,056 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:57,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:57,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:57,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:57,056 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:57,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:57,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:57,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2018-12-02 15:27:57,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:57,056 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:57,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,090 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:57,090 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:57,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:57,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:57,106 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_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:57,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:57,123 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:57,123 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_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:57,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:57,128 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:57,128 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:57,142 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:57,159 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:57,245 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:57,246 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:57,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:57,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:57,246 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:57,246 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:57,246 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:57,246 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:57,246 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:57,246 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2018-12-02 15:27:57,246 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:57,246 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:57,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:57,276 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:57,276 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:57,277 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-12-02 15:27:57,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:57,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:57,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:57,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:57,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:57,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:57,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:57,281 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-12-02 15:27:57,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:57,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:57,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:57,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:57,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:57,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:57,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:57,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:57,283 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-12-02 15:27:57,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:57,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:57,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:57,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:57,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:57,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:57,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:57,286 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-12-02 15:27:57,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:57,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:57,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:57,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:57,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:57,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:57,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:57,289 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:57,290 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:57,291 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 15:27:57,291 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:57,291 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:57,291 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:57,291 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-12-02 15:27:57,292 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:57,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,317 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-12-02 15:27:57,317 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-12-02 15:27:57,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 64 states and 82 transitions. Complement of second has 7 states. [2018-12-02 15:27:57,330 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-12-02 15:27:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-02 15:27:57,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-02 15:27:57,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:57,331 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:27:57,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,354 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-12-02 15:27:57,354 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-12-02 15:27:57,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 86 states and 103 transitions. Complement of second has 9 states. [2018-12-02 15:27:57,378 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-12-02 15:27:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-02 15:27:57,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-02 15:27:57,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:57,378 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-02 15:27:57,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,401 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-12-02 15:27:57,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-12-02 15:27:57,417 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2018-12-02 15:27:57,417 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-12-02 15:27:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 15:27:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-02 15:27:57,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-02 15:27:57,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:57,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-02 15:27:57,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:57,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2018-12-02 15:27:57,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:57,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2018-12-02 15:27:57,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-12-02 15:27:57,419 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2018-12-02 15:27:57,419 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 15:27:57,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 15:27:57,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-12-02 15:27:57,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:57,419 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-12-02 15:27:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-12-02 15:27:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-12-02 15:27:57,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 15:27:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-02 15:27:57,420 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-02 15:27:57,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:27:57,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:27:57,421 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2018-12-02 15:27:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:57,433 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-02 15:27:57,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:27:57,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-12-02 15:27:57,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-12-02 15:27:57,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2018-12-02 15:27:57,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 15:27:57,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 15:27:57,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-12-02 15:27:57,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:57,434 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-12-02 15:27:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-12-02 15:27:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-12-02 15:27:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 15:27:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-12-02 15:27:57,436 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-02 15:27:57,436 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-02 15:27:57,436 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 15:27:57,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-12-02 15:27:57,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-02 15:27:57,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:57,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:57,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-02 15:27:57,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2018-12-02 15:27:57,437 INFO L794 eck$LassoCheckResult]: Stem: 1689#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1691#L12 assume !(main_~i~0 >= 10); 1694#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1696#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1697#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1713#L12 assume !(main_~i~0 >= 10); 1716#L12-2 assume !(main_~i~0 <= 0); 1715#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1702#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2018-12-02 15:27:57,437 INFO L796 eck$LassoCheckResult]: Loop: 1685#L12-2 assume !(main_~i~0 <= 0); 1686#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1698#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1719#L12 assume !(main_~i~0 >= 10); 1706#L12-2 assume !(main_~i~0 <= 0); 1711#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1704#L12 assume !(main_~i~0 >= 10); 1707#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1708#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1701#L12 assume !(main_~i~0 >= 10); 1699#L12-2 assume !(main_~i~0 <= 0); 1700#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1714#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2018-12-02 15:27:57,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,438 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2018-12-02 15:27:57,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-02 15:27:57,473 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:57,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2018-12-02 15:27:57,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:57,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-02 15:27:57,509 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:27:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:27:57,509 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-02 15:27:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:57,532 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-12-02 15:27:57,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:27:57,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-12-02 15:27:57,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 15:27:57,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2018-12-02 15:27:57,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-02 15:27:57,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-02 15:27:57,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2018-12-02 15:27:57,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:57,533 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-02 15:27:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2018-12-02 15:27:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-12-02 15:27:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 15:27:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-12-02 15:27:57,535 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-12-02 15:27:57,535 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-12-02 15:27:57,535 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 15:27:57,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2018-12-02 15:27:57,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-02 15:27:57,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:57,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:57,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2018-12-02 15:27:57,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2018-12-02 15:27:57,536 INFO L794 eck$LassoCheckResult]: Stem: 1859#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1876#L12 assume !(main_~i~0 >= 10); 1877#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1892#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1890#L12 assume !(main_~i~0 >= 10); 1896#L12-2 assume !(main_~i~0 <= 0); 1895#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1863#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1864#L12 assume !(main_~i~0 >= 10); 1857#L12-2 assume !(main_~i~0 <= 0); 1858#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1869#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1891#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2018-12-02 15:27:57,536 INFO L796 eck$LassoCheckResult]: Loop: 1855#L12-2 assume !(main_~i~0 <= 0); 1856#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1886#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1884#L12 assume !(main_~i~0 >= 10); 1875#L12-2 assume !(main_~i~0 <= 0); 1881#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1873#L12 assume !(main_~i~0 >= 10); 1870#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1871#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1862#L12 assume !(main_~i~0 >= 10); 1897#L12-2 assume !(main_~i~0 <= 0); 1867#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1865#L12 assume !(main_~i~0 >= 10); 1866#L12-2 assume !(main_~i~0 <= 0); 1872#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1894#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2018-12-02 15:27:57,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,536 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2018-12-02 15:27:57,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:57,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:27:57,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:27:57,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 15:27:57,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:57,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2018-12-02 15:27:57,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:27:57,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:27:57,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-02 15:27:57,630 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:57,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:27:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:27:57,630 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-12-02 15:27:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:57,645 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-12-02 15:27:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:27:57,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2018-12-02 15:27:57,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-02 15:27:57,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2018-12-02 15:27:57,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-02 15:27:57,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-02 15:27:57,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2018-12-02 15:27:57,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:57,646 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-02 15:27:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2018-12-02 15:27:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-12-02 15:27:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 15:27:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-12-02 15:27:57,647 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-12-02 15:27:57,647 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-12-02 15:27:57,647 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 15:27:57,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2018-12-02 15:27:57,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-02 15:27:57,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:57,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:57,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2018-12-02 15:27:57,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2018-12-02 15:27:57,648 INFO L794 eck$LassoCheckResult]: Stem: 2071#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2072#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2085#L12 assume !(main_~i~0 >= 10); 2086#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2101#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2098#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2099#L12 assume !(main_~i~0 >= 10); 2106#L12-2 assume !(main_~i~0 <= 0); 2107#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2111#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2109#L12 assume !(main_~i~0 >= 10); 2110#L12-2 assume !(main_~i~0 <= 0); 2079#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2076#L12 assume !(main_~i~0 >= 10); 2069#L12-2 assume !(main_~i~0 <= 0); 2070#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2102#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2100#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2018-12-02 15:27:57,648 INFO L796 eck$LassoCheckResult]: Loop: 2067#L12-2 assume !(main_~i~0 <= 0); 2068#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2093#L12 assume !(main_~i~0 >= 10); 2084#L12-2 assume !(main_~i~0 <= 0); 2090#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2082#L12 assume !(main_~i~0 >= 10); 2080#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2078#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2073#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2074#L12 assume !(main_~i~0 >= 10); 2077#L12-2 assume !(main_~i~0 <= 0); 2081#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2117#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2116#L12 assume !(main_~i~0 >= 10); 2115#L12-2 assume !(main_~i~0 <= 0); 2114#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2113#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2112#L12 assume !(main_~i~0 >= 10); 2108#L12-2 assume !(main_~i~0 <= 0); 2105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2103#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2104#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2018-12-02 15:27:57,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2018-12-02 15:27:57,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,677 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:27:57,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 15:27:57,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 15:27:57,706 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:57,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2018-12-02 15:27:57,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:27:57,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 15:27:57,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 15:27:57,766 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:57,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:27:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:27:57,767 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-12-02 15:27:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:57,794 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-12-02 15:27:57,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:27:57,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-12-02 15:27:57,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-12-02 15:27:57,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2018-12-02 15:27:57,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-02 15:27:57,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-02 15:27:57,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2018-12-02 15:27:57,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:57,796 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-12-02 15:27:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2018-12-02 15:27:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-12-02 15:27:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 15:27:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-12-02 15:27:57,798 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-12-02 15:27:57,798 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-12-02 15:27:57,799 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 15:27:57,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2018-12-02 15:27:57,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-12-02 15:27:57,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:57,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:57,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2018-12-02 15:27:57,800 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2018-12-02 15:27:57,800 INFO L794 eck$LassoCheckResult]: Stem: 2325#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2337#L12 assume !(main_~i~0 >= 10); 2338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2356#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2354#L12 assume !(main_~i~0 >= 10); 2379#L12-2 assume !(main_~i~0 <= 0); 2378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2330#L12 assume !(main_~i~0 >= 10); 2323#L12-2 assume !(main_~i~0 <= 0); 2324#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2377#L12 assume !(main_~i~0 >= 10); 2376#L12-2 assume !(main_~i~0 <= 0); 2375#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2358#L12 assume !(main_~i~0 >= 10); 2363#L12-2 assume !(main_~i~0 <= 0); 2361#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2355#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2018-12-02 15:27:57,800 INFO L796 eck$LassoCheckResult]: Loop: 2321#L12-2 assume !(main_~i~0 <= 0); 2322#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2351#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2349#L12 assume !(main_~i~0 >= 10); 2341#L12-2 assume !(main_~i~0 <= 0); 2346#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2344#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2339#L12 assume !(main_~i~0 >= 10); 2335#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2336#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2328#L12 assume !(main_~i~0 >= 10); 2331#L12-2 assume !(main_~i~0 <= 0); 2332#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2373#L12 assume !(main_~i~0 >= 10); 2372#L12-2 assume !(main_~i~0 <= 0); 2371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2369#L12 assume !(main_~i~0 >= 10); 2368#L12-2 assume !(main_~i~0 <= 0); 2367#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2365#L12 assume !(main_~i~0 >= 10); 2364#L12-2 assume !(main_~i~0 <= 0); 2362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2360#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2018-12-02 15:27:57,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2018-12-02 15:27:57,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:27:57,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:27:57,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:57,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 15:27:57,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:57,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2018-12-02 15:27:57,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:57,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:57,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:27:57,921 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:27:57,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:57,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:57,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:57,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 15:27:57,942 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:27:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:27:57,942 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-12-02 15:27:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:57,984 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-12-02 15:27:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:27:57,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-12-02 15:27:57,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-12-02 15:27:57,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2018-12-02 15:27:57,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-02 15:27:57,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-02 15:27:57,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-12-02 15:27:57,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:57,986 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-12-02 15:27:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-12-02 15:27:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-12-02 15:27:57,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 15:27:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-12-02 15:27:57,987 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-12-02 15:27:57,987 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-12-02 15:27:57,987 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 15:27:57,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2018-12-02 15:27:57,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-02 15:27:57,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:57,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:57,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2018-12-02 15:27:57,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2018-12-02 15:27:57,989 INFO L794 eck$LassoCheckResult]: Stem: 2621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2622#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2633#L12 assume !(main_~i~0 >= 10); 2634#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2651#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2628#L12 assume !(main_~i~0 >= 10); 2619#L12-2 assume !(main_~i~0 <= 0); 2620#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2625#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2626#L12 assume !(main_~i~0 >= 10); 2683#L12-2 assume !(main_~i~0 <= 0); 2682#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2681#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2680#L12 assume !(main_~i~0 >= 10); 2679#L12-2 assume !(main_~i~0 <= 0); 2678#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2677#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2676#L12 assume !(main_~i~0 >= 10); 2675#L12-2 assume !(main_~i~0 <= 0); 2674#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2673#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2653#L12 assume !(main_~i~0 >= 10); 2658#L12-2 assume !(main_~i~0 <= 0); 2656#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2650#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2018-12-02 15:27:57,989 INFO L796 eck$LassoCheckResult]: Loop: 2617#L12-2 assume !(main_~i~0 <= 0); 2618#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2647#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2645#L12 assume !(main_~i~0 >= 10); 2637#L12-2 assume !(main_~i~0 <= 0); 2642#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2640#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2635#L12 assume !(main_~i~0 >= 10); 2631#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2632#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2624#L12 assume !(main_~i~0 >= 10); 2627#L12-2 assume !(main_~i~0 <= 0); 2629#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2672#L12 assume !(main_~i~0 >= 10); 2671#L12-2 assume !(main_~i~0 <= 0); 2670#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2669#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2668#L12 assume !(main_~i~0 >= 10); 2667#L12-2 assume !(main_~i~0 <= 0); 2666#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2665#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2664#L12 assume !(main_~i~0 >= 10); 2663#L12-2 assume !(main_~i~0 <= 0); 2662#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2661#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2660#L12 assume !(main_~i~0 >= 10); 2659#L12-2 assume !(main_~i~0 <= 0); 2657#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2654#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2655#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2018-12-02 15:27:57,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2018-12-02 15:27:57,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:57,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:57,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,030 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,040 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 15:27:58,048 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-02 15:27:58,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 15:27:58,069 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:58,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2018-12-02 15:27:58,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,123 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 15:27:58,129 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-02 15:27:58,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 15:27:58,150 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:27:58,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:27:58,150 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-12-02 15:27:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:58,191 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-12-02 15:27:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:27:58,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-12-02 15:27:58,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-12-02 15:27:58,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2018-12-02 15:27:58,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-02 15:27:58,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-02 15:27:58,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-12-02 15:27:58,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:58,192 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-12-02 15:27:58,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-12-02 15:27:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-12-02 15:27:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 15:27:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-12-02 15:27:58,193 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-12-02 15:27:58,194 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-12-02 15:27:58,194 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 15:27:58,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2018-12-02 15:27:58,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-12-02 15:27:58,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:58,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:58,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2018-12-02 15:27:58,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2018-12-02 15:27:58,195 INFO L794 eck$LassoCheckResult]: Stem: 2959#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2960#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2975#L12 assume !(main_~i~0 >= 10); 2976#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2991#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2988#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2989#L12 assume !(main_~i~0 >= 10); 3029#L12-2 assume !(main_~i~0 <= 0); 3028#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2963#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2964#L12 assume !(main_~i~0 >= 10); 2957#L12-2 assume !(main_~i~0 <= 0); 2958#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2968#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3027#L12 assume !(main_~i~0 >= 10); 3026#L12-2 assume !(main_~i~0 <= 0); 3025#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3024#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3023#L12 assume !(main_~i~0 >= 10); 3022#L12-2 assume !(main_~i~0 <= 0); 3021#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3019#L12 assume !(main_~i~0 >= 10); 3018#L12-2 assume !(main_~i~0 <= 0); 3017#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3016#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2999#L12-2 assume !(main_~i~0 <= 0); 2997#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2994#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2990#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2018-12-02 15:27:58,195 INFO L796 eck$LassoCheckResult]: Loop: 2955#L12-2 assume !(main_~i~0 <= 0); 2956#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2985#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2983#L12 assume !(main_~i~0 >= 10); 2974#L12-2 assume !(main_~i~0 <= 0); 2980#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2977#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2972#L12 assume !(main_~i~0 >= 10); 2969#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2966#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2967#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3015#L12 assume !(main_~i~0 >= 10); 2970#L12-2 assume !(main_~i~0 <= 0); 2971#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2962#L12 assume !(main_~i~0 >= 10); 2965#L12-2 assume !(main_~i~0 <= 0); 3014#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3012#L12 assume !(main_~i~0 >= 10); 3011#L12-2 assume !(main_~i~0 <= 0); 3010#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3009#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3008#L12 assume !(main_~i~0 >= 10); 3007#L12-2 assume !(main_~i~0 <= 0); 3006#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3004#L12 assume !(main_~i~0 >= 10); 3003#L12-2 assume !(main_~i~0 <= 0); 3002#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3001#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3000#L12 assume !(main_~i~0 >= 10); 2998#L12-2 assume !(main_~i~0 <= 0); 2996#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2993#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2018-12-02 15:27:58,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2018-12-02 15:27:58,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,236 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 15:27:58,243 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-02 15:27:58,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,248 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 15:27:58,264 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:58,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,264 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2018-12-02 15:27:58,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 15:27:58,329 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-12-02 15:27:58,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 15:27:58,359 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:58,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 15:27:58,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:27:58,359 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2018-12-02 15:27:58,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:58,391 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-02 15:27:58,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:27:58,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2018-12-02 15:27:58,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-12-02 15:27:58,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2018-12-02 15:27:58,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-02 15:27:58,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-02 15:27:58,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2018-12-02 15:27:58,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:58,392 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-12-02 15:27:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2018-12-02 15:27:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-12-02 15:27:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-02 15:27:58,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-12-02 15:27:58,393 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-12-02 15:27:58,393 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-12-02 15:27:58,393 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 15:27:58,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2018-12-02 15:27:58,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-12-02 15:27:58,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:58,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:58,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2018-12-02 15:27:58,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2018-12-02 15:27:58,395 INFO L794 eck$LassoCheckResult]: Stem: 3339#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3340#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3352#L12 assume !(main_~i~0 >= 10); 3353#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3368#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3369#L12 assume !(main_~i~0 >= 10); 3417#L12-2 assume !(main_~i~0 <= 0); 3416#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3343#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3344#L12 assume !(main_~i~0 >= 10); 3337#L12-2 assume !(main_~i~0 <= 0); 3338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3348#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3415#L12 assume !(main_~i~0 >= 10); 3414#L12-2 assume !(main_~i~0 <= 0); 3413#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3411#L12 assume !(main_~i~0 >= 10); 3410#L12-2 assume !(main_~i~0 <= 0); 3409#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3407#L12 assume !(main_~i~0 >= 10); 3406#L12-2 assume !(main_~i~0 <= 0); 3405#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3403#L12 assume !(main_~i~0 >= 10); 3402#L12-2 assume !(main_~i~0 <= 0); 3401#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3400#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3375#L12 assume !(main_~i~0 >= 10); 3379#L12-2 assume !(main_~i~0 <= 0); 3377#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3370#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2018-12-02 15:27:58,395 INFO L796 eck$LassoCheckResult]: Loop: 3335#L12-2 assume !(main_~i~0 <= 0); 3336#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3364#L12 assume !(main_~i~0 >= 10); 3356#L12-2 assume !(main_~i~0 <= 0); 3361#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3354#L12 assume !(main_~i~0 >= 10); 3349#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3347#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3399#L12 assume !(main_~i~0 >= 10); 3350#L12-2 assume !(main_~i~0 <= 0); 3351#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3341#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3342#L12 assume !(main_~i~0 >= 10); 3345#L12-2 assume !(main_~i~0 <= 0); 3398#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3397#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3396#L12 assume !(main_~i~0 >= 10); 3395#L12-2 assume !(main_~i~0 <= 0); 3394#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3393#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3392#L12 assume !(main_~i~0 >= 10); 3391#L12-2 assume !(main_~i~0 <= 0); 3390#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3388#L12 assume !(main_~i~0 >= 10); 3387#L12-2 assume !(main_~i~0 <= 0); 3386#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3385#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3384#L12 assume !(main_~i~0 >= 10); 3383#L12-2 assume !(main_~i~0 <= 0); 3382#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3380#L12 assume !(main_~i~0 >= 10); 3378#L12-2 assume !(main_~i~0 <= 0); 3376#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3372#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3373#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2018-12-02 15:27:58,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,395 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2018-12-02 15:27:58,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-02 15:27:58,484 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:58,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2018-12-02 15:27:58,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:58,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-02 15:27:58,563 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:58,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:27:58,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:27:58,563 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-12-02 15:27:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:58,595 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-02 15:27:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:27:58,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2018-12-02 15:27:58,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-02 15:27:58,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2018-12-02 15:27:58,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-12-02 15:27:58,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-12-02 15:27:58,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2018-12-02 15:27:58,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:58,597 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-02 15:27:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2018-12-02 15:27:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-12-02 15:27:58,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-02 15:27:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-12-02 15:27:58,599 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-12-02 15:27:58,599 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-12-02 15:27:58,599 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 15:27:58,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2018-12-02 15:27:58,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-12-02 15:27:58,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:58,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:58,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2018-12-02 15:27:58,600 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2018-12-02 15:27:58,600 INFO L794 eck$LassoCheckResult]: Stem: 3761#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3776#L12 assume !(main_~i~0 >= 10); 3777#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3791#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3768#L12 assume !(main_~i~0 >= 10); 3759#L12-2 assume !(main_~i~0 <= 0); 3760#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3766#L12 assume !(main_~i~0 >= 10); 3847#L12-2 assume !(main_~i~0 <= 0); 3846#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3844#L12 assume !(main_~i~0 >= 10); 3843#L12-2 assume !(main_~i~0 <= 0); 3842#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3840#L12 assume !(main_~i~0 >= 10); 3839#L12-2 assume !(main_~i~0 <= 0); 3838#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3836#L12 assume !(main_~i~0 >= 10); 3835#L12-2 assume !(main_~i~0 <= 0); 3834#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3833#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3832#L12 assume !(main_~i~0 >= 10); 3831#L12-2 assume !(main_~i~0 <= 0); 3830#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3829#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3828#L12 assume !(main_~i~0 >= 10); 3827#L12-2 assume !(main_~i~0 <= 0); 3826#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3825#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3793#L12 assume !(main_~i~0 >= 10); 3798#L12-2 assume !(main_~i~0 <= 0); 3796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3792#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3790#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2018-12-02 15:27:58,601 INFO L796 eck$LassoCheckResult]: Loop: 3757#L12-2 assume !(main_~i~0 <= 0); 3758#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3784#L12 assume !(main_~i~0 >= 10); 3775#L12-2 assume !(main_~i~0 <= 0); 3781#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3773#L12 assume !(main_~i~0 >= 10); 3771#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3763#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3764#L12 assume !(main_~i~0 >= 10); 3767#L12-2 assume !(main_~i~0 <= 0); 3769#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3824#L12 assume !(main_~i~0 >= 10); 3823#L12-2 assume !(main_~i~0 <= 0); 3822#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3821#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3820#L12 assume !(main_~i~0 >= 10); 3819#L12-2 assume !(main_~i~0 <= 0); 3818#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3817#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3816#L12 assume !(main_~i~0 >= 10); 3815#L12-2 assume !(main_~i~0 <= 0); 3814#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3812#L12 assume !(main_~i~0 >= 10); 3811#L12-2 assume !(main_~i~0 <= 0); 3810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3809#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3808#L12 assume !(main_~i~0 >= 10); 3807#L12-2 assume !(main_~i~0 <= 0); 3806#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3804#L12 assume !(main_~i~0 >= 10); 3803#L12-2 assume !(main_~i~0 <= 0); 3802#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3801#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3800#L12 assume !(main_~i~0 >= 10); 3799#L12-2 assume !(main_~i~0 <= 0); 3797#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3795#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2018-12-02 15:27:58,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2018-12-02 15:27:58,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:27:58,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:27:58,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:27:58,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:27:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 15:27:58,683 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 15:27:58,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2018-12-02 15:27:58,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:27:58,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:27:58,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:27:58,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 15:27:58,777 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 15:27:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:27:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:27:58,777 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2018-12-02 15:27:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:58,838 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2018-12-02 15:27:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:27:58,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 215 transitions. [2018-12-02 15:27:58,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-12-02 15:27:58,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 190 states and 211 transitions. [2018-12-02 15:27:58,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-12-02 15:27:58,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2018-12-02 15:27:58,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 211 transitions. [2018-12-02 15:27:58,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:58,840 INFO L705 BuchiCegarLoop]: Abstraction has 190 states and 211 transitions. [2018-12-02 15:27:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 211 transitions. [2018-12-02 15:27:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-12-02 15:27:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-02 15:27:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2018-12-02 15:27:58,843 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-12-02 15:27:58,843 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-12-02 15:27:58,843 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 15:27:58,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 184 transitions. [2018-12-02 15:27:58,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:27:58,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:58,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:58,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:27:58,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2018-12-02 15:27:58,845 INFO L794 eck$LassoCheckResult]: Stem: 4314#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4315#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4317#L12 assume !(main_~i~0 >= 10); 4409#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4408#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4322#L12 assume !(main_~i~0 >= 10); 4323#L12-2 assume !(main_~i~0 <= 0); 4406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4319#L12 assume !(main_~i~0 >= 10); 4312#L12-2 assume !(main_~i~0 <= 0); 4313#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4405#L12 assume !(main_~i~0 >= 10); 4404#L12-2 assume !(main_~i~0 <= 0); 4403#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4402#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4401#L12 assume !(main_~i~0 >= 10); 4400#L12-2 assume !(main_~i~0 <= 0); 4399#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4397#L12 assume !(main_~i~0 >= 10); 4396#L12-2 assume !(main_~i~0 <= 0); 4395#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4393#L12 assume !(main_~i~0 >= 10); 4392#L12-2 assume !(main_~i~0 <= 0); 4391#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4389#L12 assume !(main_~i~0 >= 10); 4388#L12-2 assume !(main_~i~0 <= 0); 4387#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4385#L12 assume !(main_~i~0 >= 10); 4384#L12-2 assume !(main_~i~0 <= 0); 4383#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4339#L12 assume !(main_~i~0 >= 10); 4343#L12-2 assume !(main_~i~0 <= 0); 4341#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4332#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2018-12-02 15:27:58,845 INFO L796 eck$LassoCheckResult]: Loop: 4331#L12-2 assume !(main_~i~0 <= 0); 4326#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4333#L12 assume !(main_~i~0 >= 10); 4335#L12-2 assume !(main_~i~0 <= 0); 4472#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4412#L12 assume !(main_~i~0 >= 10); 4379#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4377#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4376#L12 assume !(main_~i~0 >= 10); 4375#L12-2 assume !(main_~i~0 <= 0); 4374#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4373#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4372#L12 assume !(main_~i~0 >= 10); 4371#L12-2 assume !(main_~i~0 <= 0); 4370#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4369#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4368#L12 assume !(main_~i~0 >= 10); 4367#L12-2 assume !(main_~i~0 <= 0); 4366#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4364#L12 assume !(main_~i~0 >= 10); 4363#L12-2 assume !(main_~i~0 <= 0); 4362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4360#L12 assume !(main_~i~0 >= 10); 4359#L12-2 assume !(main_~i~0 <= 0); 4358#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4356#L12 assume !(main_~i~0 >= 10); 4355#L12-2 assume !(main_~i~0 <= 0); 4354#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4352#L12 assume !(main_~i~0 >= 10); 4351#L12-2 assume !(main_~i~0 <= 0); 4350#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4348#L12 assume !(main_~i~0 >= 10); 4347#L12-2 assume !(main_~i~0 <= 0); 4346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4345#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4344#L12 assume !(main_~i~0 >= 10); 4342#L12-2 assume !(main_~i~0 <= 0); 4340#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4336#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4337#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2018-12-02 15:27:58,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2018-12-02 15:27:58,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:58,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2018-12-02 15:27:58,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:58,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 3 times [2018-12-02 15:27:58,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:58,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:58,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:27:58,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:58,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:58,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:27:58,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-02 15:27:58,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:58,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 752 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-12-02 15:27:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:58,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 13 [2018-12-02 15:27:59,077 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 52 [2018-12-02 15:27:59,083 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:59,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:59,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:59,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:59,083 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:59,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:59,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:59,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration17_Loop [2018-12-02 15:27:59,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:59,083 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:59,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:59,118 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:59,121 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:59,135 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:59,135 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:59,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:59,153 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:59,153 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:59,156 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,173 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:59,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:59,190 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:59,191 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:59,191 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:59,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:59,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:59,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:59,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:59,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:59,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration17_Loop [2018-12-02 15:27:59,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:59,192 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:59,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:59,226 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:59,226 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-12-02 15:27:59,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:59,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:59,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:59,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:59,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:59,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:59,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:59,228 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-12-02 15:27:59,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:59,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:59,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:59,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:59,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:59,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:59,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:59,230 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-12-02 15:27:59,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:59,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:59,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:59,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:59,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:59,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:59,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:59,231 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:59,232 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:59,232 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:27:59,232 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:59,232 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:59,232 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:59,232 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2018-12-02 15:27:59,233 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:59,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:59,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:59,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:27:59,265 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-02 15:27:59,265 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-12-02 15:27:59,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 473 states and 516 transitions. Complement of second has 15 states. [2018-12-02 15:27:59,323 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-12-02 15:27:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-02 15:27:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-12-02 15:27:59,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2018-12-02 15:27:59,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:59,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2018-12-02 15:27:59,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:59,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2018-12-02 15:27:59,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:59,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 516 transitions. [2018-12-02 15:27:59,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:27:59,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 431 states and 474 transitions. [2018-12-02 15:27:59,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-12-02 15:27:59,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2018-12-02 15:27:59,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 474 transitions. [2018-12-02 15:27:59,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:59,328 INFO L705 BuchiCegarLoop]: Abstraction has 431 states and 474 transitions. [2018-12-02 15:27:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 474 transitions. [2018-12-02 15:27:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 409. [2018-12-02 15:27:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-12-02 15:27:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 450 transitions. [2018-12-02 15:27:59,332 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 450 transitions. [2018-12-02 15:27:59,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:27:59,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:27:59,332 INFO L87 Difference]: Start difference. First operand 409 states and 450 transitions. Second operand 13 states. [2018-12-02 15:27:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:59,372 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2018-12-02 15:27:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:27:59,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 305 transitions. [2018-12-02 15:27:59,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:27:59,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 255 states and 286 transitions. [2018-12-02 15:27:59,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-12-02 15:27:59,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-12-02 15:27:59,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 286 transitions. [2018-12-02 15:27:59,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:59,374 INFO L705 BuchiCegarLoop]: Abstraction has 255 states and 286 transitions. [2018-12-02 15:27:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 286 transitions. [2018-12-02 15:27:59,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 167. [2018-12-02 15:27:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-02 15:27:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2018-12-02 15:27:59,377 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-12-02 15:27:59,377 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-12-02 15:27:59,377 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-02 15:27:59,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 188 transitions. [2018-12-02 15:27:59,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:27:59,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:59,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:59,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:27:59,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2018-12-02 15:27:59,378 INFO L794 eck$LassoCheckResult]: Stem: 6228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 6229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6243#L12 assume !(main_~i~0 >= 10); 6320#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6319#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6234#L12 assume !(main_~i~0 >= 10); 6226#L12-2 assume !(main_~i~0 <= 0); 6227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6232#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6233#L12 assume !(main_~i~0 >= 10); 6317#L12-2 assume !(main_~i~0 <= 0); 6236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6237#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6316#L12 assume !(main_~i~0 >= 10); 6315#L12-2 assume !(main_~i~0 <= 0); 6314#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6312#L12 assume !(main_~i~0 >= 10); 6311#L12-2 assume !(main_~i~0 <= 0); 6310#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6308#L12 assume !(main_~i~0 >= 10); 6307#L12-2 assume !(main_~i~0 <= 0); 6306#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6304#L12 assume !(main_~i~0 >= 10); 6303#L12-2 assume !(main_~i~0 <= 0); 6302#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6300#L12 assume !(main_~i~0 >= 10); 6299#L12-2 assume !(main_~i~0 <= 0); 6298#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6296#L12 assume !(main_~i~0 >= 10); 6295#L12-2 assume !(main_~i~0 <= 0); 6294#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6249#L12 assume !(main_~i~0 >= 10); 6292#L12-2 assume !(main_~i~0 <= 0); 6291#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6248#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6247#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2018-12-02 15:27:59,379 INFO L796 eck$LassoCheckResult]: Loop: 6246#L12-2 assume !(main_~i~0 <= 0); 6244#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6242#L12 assume !(main_~i~0 >= 10); 6326#L12-2 assume !(main_~i~0 <= 0); 6324#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6330#L12 assume !(main_~i~0 >= 10); 6331#L12-2 assume !(main_~i~0 <= 0); 6327#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6323#L12 assume !(main_~i~0 >= 10); 6289#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6286#L12 assume !(main_~i~0 >= 10); 6285#L12-2 assume !(main_~i~0 <= 0); 6284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6282#L12 assume !(main_~i~0 >= 10); 6281#L12-2 assume !(main_~i~0 <= 0); 6280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6278#L12 assume !(main_~i~0 >= 10); 6277#L12-2 assume !(main_~i~0 <= 0); 6276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6274#L12 assume !(main_~i~0 >= 10); 6273#L12-2 assume !(main_~i~0 <= 0); 6272#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6270#L12 assume !(main_~i~0 >= 10); 6269#L12-2 assume !(main_~i~0 <= 0); 6268#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6266#L12 assume !(main_~i~0 >= 10); 6265#L12-2 assume !(main_~i~0 <= 0); 6264#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6262#L12 assume !(main_~i~0 >= 10); 6261#L12-2 assume !(main_~i~0 <= 0); 6260#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6258#L12 assume !(main_~i~0 >= 10); 6257#L12-2 assume !(main_~i~0 <= 0); 6256#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6254#L12 assume !(main_~i~0 >= 10); 6253#L12-2 assume !(main_~i~0 <= 0); 6252#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6251#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2018-12-02 15:27:59,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:59,379 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2018-12-02 15:27:59,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:59,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:59,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:59,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:59,386 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2018-12-02 15:27:59,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:59,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:59,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:27:59,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:59,393 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 4 times [2018-12-02 15:27:59,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:59,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:59,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:59,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:27:59,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:27:59,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:27:59,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:27:59,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:27:59,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:27:59,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:27:59,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:27:59,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-02 15:27:59,606 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2018-12-02 15:27:59,613 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:59,613 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:59,613 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:59,613 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:59,614 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:27:59,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,614 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:59,614 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:59,614 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2018-12-02 15:27:59,614 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:59,614 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:59,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:59,643 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,645 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:59,645 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:59,659 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:27:59,659 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,662 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:27:59,662 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:27:59,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:27:59,680 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:27:59,693 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:27:59,693 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:27:59,693 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:27:59,693 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:27:59,693 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:27:59,693 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:27:59,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:27:59,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:27:59,694 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2018-12-02 15:27:59,694 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:27:59,694 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:27:59,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:27:59,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:27:59,726 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:27:59,726 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-12-02 15:27:59,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:59,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:59,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:59,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:59,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:27:59,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:27:59,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:27:59,728 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-12-02 15:27:59,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:27:59,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:27:59,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:27:59,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:27:59,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:27:59,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:27:59,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:27:59,730 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:27:59,730 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:27:59,731 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:27:59,731 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:27:59,731 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:27:59,731 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:27:59,731 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2018-12-02 15:27:59,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:27:59,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:59,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:27:59,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:27:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:27:59,816 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-12-02 15:27:59,816 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24 Second operand 7 states. [2018-12-02 15:27:59,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24. Second operand 7 states. Result 529 states and 572 transitions. Complement of second has 19 states. [2018-12-02 15:27:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-02 15:27:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 15:27:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-12-02 15:27:59,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2018-12-02 15:27:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2018-12-02 15:27:59,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:59,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2018-12-02 15:27:59,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:27:59,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 572 transitions. [2018-12-02 15:27:59,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:27:59,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 459 states and 502 transitions. [2018-12-02 15:27:59,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2018-12-02 15:27:59,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2018-12-02 15:27:59,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 502 transitions. [2018-12-02 15:27:59,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:59,964 INFO L705 BuchiCegarLoop]: Abstraction has 459 states and 502 transitions. [2018-12-02 15:27:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 502 transitions. [2018-12-02 15:27:59,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-12-02 15:27:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 15:27:59,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 456 transitions. [2018-12-02 15:27:59,970 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 456 transitions. [2018-12-02 15:27:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 15:27:59,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 15:27:59,970 INFO L87 Difference]: Start difference. First operand 417 states and 456 transitions. Second operand 6 states. [2018-12-02 15:27:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:27:59,992 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2018-12-02 15:27:59,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:27:59,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 319 transitions. [2018-12-02 15:27:59,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:27:59,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 263 states and 292 transitions. [2018-12-02 15:27:59,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2018-12-02 15:27:59,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2018-12-02 15:27:59,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 292 transitions. [2018-12-02 15:27:59,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:27:59,994 INFO L705 BuchiCegarLoop]: Abstraction has 263 states and 292 transitions. [2018-12-02 15:27:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 292 transitions. [2018-12-02 15:27:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 171. [2018-12-02 15:27:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-02 15:27:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2018-12-02 15:27:59,995 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2018-12-02 15:27:59,995 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2018-12-02 15:27:59,996 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-02 15:27:59,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 191 transitions. [2018-12-02 15:27:59,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:27:59,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:27:59,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:27:59,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:27:59,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2018-12-02 15:27:59,997 INFO L794 eck$LassoCheckResult]: Stem: 8251#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 8252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8266#L12 assume !(main_~i~0 >= 10); 8344#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8343#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8257#L12 assume !(main_~i~0 >= 10); 8249#L12-2 assume !(main_~i~0 <= 0); 8250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8256#L12 assume !(main_~i~0 >= 10); 8341#L12-2 assume !(main_~i~0 <= 0); 8259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8340#L12 assume !(main_~i~0 >= 10); 8339#L12-2 assume !(main_~i~0 <= 0); 8338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8337#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8336#L12 assume !(main_~i~0 >= 10); 8335#L12-2 assume !(main_~i~0 <= 0); 8334#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8332#L12 assume !(main_~i~0 >= 10); 8331#L12-2 assume !(main_~i~0 <= 0); 8330#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8328#L12 assume !(main_~i~0 >= 10); 8327#L12-2 assume !(main_~i~0 <= 0); 8326#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8324#L12 assume !(main_~i~0 >= 10); 8323#L12-2 assume !(main_~i~0 <= 0); 8322#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8320#L12 assume !(main_~i~0 >= 10); 8319#L12-2 assume !(main_~i~0 <= 0); 8318#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8275#L12 assume !(main_~i~0 >= 10); 8316#L12-2 assume !(main_~i~0 <= 0); 8315#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8271#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2018-12-02 15:27:59,997 INFO L796 eck$LassoCheckResult]: Loop: 8269#L12-2 assume !(main_~i~0 <= 0); 8267#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8381#L12 assume !(main_~i~0 >= 10); 8380#L12-2 assume !(main_~i~0 <= 0); 8379#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8377#L12 assume !(main_~i~0 >= 10); 8376#L12-2 assume !(main_~i~0 <= 0); 8375#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8351#L12 assume !(main_~i~0 >= 10); 8350#L12-2 assume !(main_~i~0 <= 0); 8348#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8352#L12 assume !(main_~i~0 >= 10); 8313#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8312#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8311#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8310#L12 assume !(main_~i~0 >= 10); 8309#L12-2 assume !(main_~i~0 <= 0); 8308#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8306#L12 assume !(main_~i~0 >= 10); 8305#L12-2 assume !(main_~i~0 <= 0); 8304#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8302#L12 assume !(main_~i~0 >= 10); 8301#L12-2 assume !(main_~i~0 <= 0); 8300#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8298#L12 assume !(main_~i~0 >= 10); 8297#L12-2 assume !(main_~i~0 <= 0); 8296#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8294#L12 assume !(main_~i~0 >= 10); 8293#L12-2 assume !(main_~i~0 <= 0); 8292#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8290#L12 assume !(main_~i~0 >= 10); 8289#L12-2 assume !(main_~i~0 <= 0); 8288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8286#L12 assume !(main_~i~0 >= 10); 8285#L12-2 assume !(main_~i~0 <= 0); 8284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8282#L12 assume !(main_~i~0 >= 10); 8281#L12-2 assume !(main_~i~0 <= 0); 8280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8278#L12 assume !(main_~i~0 >= 10); 8277#L12-2 assume !(main_~i~0 <= 0); 8276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8272#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8273#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2018-12-02 15:27:59,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:27:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2018-12-02 15:27:59,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:27:59,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:27:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:27:59,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:27:59,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2018-12-02 15:28:00,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:00,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:00,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:00,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:00,010 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 5 times [2018-12-02 15:28:00,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:00,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:00,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:00,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:00,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:28:00,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:28:00,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 15:28:00,050 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-12-02 15:28:00,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:28:00,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:00,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:28:00,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-02 15:28:00,214 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 58 [2018-12-02 15:28:00,220 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:00,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:00,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:00,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:00,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:28:00,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:00,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:00,220 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2018-12-02 15:28:00,220 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:00,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:00,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:00,249 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:00,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:00,266 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:00,266 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:00,269 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:28:00,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:00,287 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:28:00,300 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:00,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:00,301 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:00,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:00,301 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:28:00,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:00,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:00,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2018-12-02 15:28:00,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:00,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:00,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:00,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:28:00,329 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-12-02 15:28:00,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:00,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:00,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:00,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:00,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:00,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:00,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:00,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:28:00,331 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:28:00,331 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:28:00,331 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:28:00,331 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:28:00,331 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:28:00,331 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2018-12-02 15:28:00,331 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:28:00,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:00,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:00,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:28:00,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-12-02 15:28:00,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23 Second operand 8 states. [2018-12-02 15:28:00,500 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 601 states and 644 transitions. Complement of second has 23 states. [2018-12-02 15:28:00,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2018-12-02 15:28:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-02 15:28:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-12-02 15:28:00,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2018-12-02 15:28:00,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2018-12-02 15:28:00,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:00,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2018-12-02 15:28:00,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:00,503 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 644 transitions. [2018-12-02 15:28:00,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:28:00,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 495 states and 538 transitions. [2018-12-02 15:28:00,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2018-12-02 15:28:00,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2018-12-02 15:28:00,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 538 transitions. [2018-12-02 15:28:00,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:00,508 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 538 transitions. [2018-12-02 15:28:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 538 transitions. [2018-12-02 15:28:00,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 425. [2018-12-02 15:28:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 15:28:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2018-12-02 15:28:00,514 INFO L728 BuchiCegarLoop]: Abstraction has 425 states and 462 transitions. [2018-12-02 15:28:00,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:28:00,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:28:00,514 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 7 states. [2018-12-02 15:28:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:28:00,542 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2018-12-02 15:28:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:28:00,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 333 transitions. [2018-12-02 15:28:00,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:00,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 271 states and 298 transitions. [2018-12-02 15:28:00,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2018-12-02 15:28:00,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2018-12-02 15:28:00,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2018-12-02 15:28:00,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:00,544 INFO L705 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2018-12-02 15:28:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2018-12-02 15:28:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 175. [2018-12-02 15:28:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-02 15:28:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2018-12-02 15:28:00,547 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2018-12-02 15:28:00,547 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2018-12-02 15:28:00,547 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-02 15:28:00,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 194 transitions. [2018-12-02 15:28:00,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:00,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:28:00,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:28:00,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:28:00,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2018-12-02 15:28:00,550 INFO L794 eck$LassoCheckResult]: Stem: 10407#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 10408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10421#L12 assume !(main_~i~0 >= 10); 10501#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10500#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10498#L12 assume !(main_~i~0 >= 10); 10405#L12-2 assume !(main_~i~0 <= 0); 10406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10412#L12 assume !(main_~i~0 >= 10); 10415#L12-2 assume !(main_~i~0 <= 0); 10417#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10418#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10497#L12 assume !(main_~i~0 >= 10); 10496#L12-2 assume !(main_~i~0 <= 0); 10495#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10493#L12 assume !(main_~i~0 >= 10); 10492#L12-2 assume !(main_~i~0 <= 0); 10491#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10489#L12 assume !(main_~i~0 >= 10); 10488#L12-2 assume !(main_~i~0 <= 0); 10487#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10485#L12 assume !(main_~i~0 >= 10); 10484#L12-2 assume !(main_~i~0 <= 0); 10483#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10481#L12 assume !(main_~i~0 >= 10); 10480#L12-2 assume !(main_~i~0 <= 0); 10479#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10477#L12 assume !(main_~i~0 >= 10); 10476#L12-2 assume !(main_~i~0 <= 0); 10475#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10432#L12 assume !(main_~i~0 >= 10); 10473#L12-2 assume !(main_~i~0 <= 0); 10472#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10428#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2018-12-02 15:28:00,550 INFO L796 eck$LassoCheckResult]: Loop: 10427#L12-2 assume !(main_~i~0 <= 0); 10424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10425#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10538#L12 assume !(main_~i~0 >= 10); 10537#L12-2 assume !(main_~i~0 <= 0); 10536#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10535#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10534#L12 assume !(main_~i~0 >= 10); 10533#L12-2 assume !(main_~i~0 <= 0); 10532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10531#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10530#L12 assume !(main_~i~0 >= 10); 10529#L12-2 assume !(main_~i~0 <= 0); 10528#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10527#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10508#L12 assume !(main_~i~0 >= 10); 10507#L12-2 assume !(main_~i~0 <= 0); 10505#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10509#L12 assume !(main_~i~0 >= 10); 10470#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10469#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10468#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10467#L12 assume !(main_~i~0 >= 10); 10466#L12-2 assume !(main_~i~0 <= 0); 10465#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10464#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10463#L12 assume !(main_~i~0 >= 10); 10462#L12-2 assume !(main_~i~0 <= 0); 10461#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10460#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10459#L12 assume !(main_~i~0 >= 10); 10458#L12-2 assume !(main_~i~0 <= 0); 10457#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10456#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10455#L12 assume !(main_~i~0 >= 10); 10454#L12-2 assume !(main_~i~0 <= 0); 10453#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10452#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10451#L12 assume !(main_~i~0 >= 10); 10450#L12-2 assume !(main_~i~0 <= 0); 10449#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10447#L12 assume !(main_~i~0 >= 10); 10446#L12-2 assume !(main_~i~0 <= 0); 10445#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10444#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10443#L12 assume !(main_~i~0 >= 10); 10442#L12-2 assume !(main_~i~0 <= 0); 10441#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10439#L12 assume !(main_~i~0 >= 10); 10438#L12-2 assume !(main_~i~0 <= 0); 10437#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10436#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10435#L12 assume !(main_~i~0 >= 10); 10434#L12-2 assume !(main_~i~0 <= 0); 10433#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10429#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10430#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2018-12-02 15:28:00,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2018-12-02 15:28:00,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:00,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2018-12-02 15:28:00,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:00,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:00,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 6 times [2018-12-02 15:28:00,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:00,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:00,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:00,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:28:00,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:28:00,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 15:28:00,670 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-12-02 15:28:00,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:28:00,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:00,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:28:00,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-02 15:28:00,852 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 60 [2018-12-02 15:28:00,857 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:00,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:00,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:00,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:00,858 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:28:00,858 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:00,858 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:00,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2018-12-02 15:28:00,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:00,858 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:00,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:00,894 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:00,894 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:00,895 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:00,897 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:00,897 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,912 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:00,912 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:00,927 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:28:00,928 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:01,011 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:28:01,012 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:01,012 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:01,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:01,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:01,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:28:01,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:01,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:01,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:01,013 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2018-12-02 15:28:01,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:01,013 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:01,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:01,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:28:01,046 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-12-02 15:28:01,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:01,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:01,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:01,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:01,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:28:01,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:28:01,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:01,048 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-12-02 15:28:01,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:01,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:01,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:01,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:01,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:01,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:01,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:01,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:01,049 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-12-02 15:28:01,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:01,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:01,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:01,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:01,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:01,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:01,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:01,050 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:28:01,050 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:28:01,051 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:28:01,051 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:28:01,051 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:28:01,051 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:28:01,051 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2018-12-02 15:28:01,051 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:28:01,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:01,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:01,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:28:01,138 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-02 15:28:01,138 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22 Second operand 9 states. [2018-12-02 15:28:01,377 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22. Second operand 9 states. Result 689 states and 732 transitions. Complement of second has 27 states. [2018-12-02 15:28:01,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-12-02 15:28:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 15:28:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-12-02 15:28:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2018-12-02 15:28:01,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2018-12-02 15:28:01,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:01,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2018-12-02 15:28:01,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:01,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 732 transitions. [2018-12-02 15:28:01,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:28:01,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 539 states and 582 transitions. [2018-12-02 15:28:01,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2018-12-02 15:28:01,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2018-12-02 15:28:01,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 582 transitions. [2018-12-02 15:28:01,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:01,382 INFO L705 BuchiCegarLoop]: Abstraction has 539 states and 582 transitions. [2018-12-02 15:28:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 582 transitions. [2018-12-02 15:28:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 433. [2018-12-02 15:28:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-12-02 15:28:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 468 transitions. [2018-12-02 15:28:01,386 INFO L728 BuchiCegarLoop]: Abstraction has 433 states and 468 transitions. [2018-12-02 15:28:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:28:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:28:01,386 INFO L87 Difference]: Start difference. First operand 433 states and 468 transitions. Second operand 8 states. [2018-12-02 15:28:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:28:01,412 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2018-12-02 15:28:01,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:28:01,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 347 transitions. [2018-12-02 15:28:01,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:01,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 279 states and 304 transitions. [2018-12-02 15:28:01,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2018-12-02 15:28:01,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-12-02 15:28:01,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 304 transitions. [2018-12-02 15:28:01,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:01,414 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 304 transitions. [2018-12-02 15:28:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 304 transitions. [2018-12-02 15:28:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 179. [2018-12-02 15:28:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-02 15:28:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2018-12-02 15:28:01,417 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2018-12-02 15:28:01,417 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2018-12-02 15:28:01,417 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-02 15:28:01,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 197 transitions. [2018-12-02 15:28:01,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:01,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:28:01,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:28:01,418 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:28:01,418 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2018-12-02 15:28:01,419 INFO L794 eck$LassoCheckResult]: Stem: 12712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 12713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12728#L12 assume !(main_~i~0 >= 10); 12806#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12805#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12804#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12720#L12 assume !(main_~i~0 >= 10); 12721#L12-2 assume !(main_~i~0 <= 0); 12803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12717#L12 assume !(main_~i~0 >= 10); 12710#L12-2 assume !(main_~i~0 <= 0); 12711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12802#L12 assume !(main_~i~0 >= 10); 12801#L12-2 assume !(main_~i~0 <= 0); 12800#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12799#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12798#L12 assume !(main_~i~0 >= 10); 12797#L12-2 assume !(main_~i~0 <= 0); 12796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12794#L12 assume !(main_~i~0 >= 10); 12793#L12-2 assume !(main_~i~0 <= 0); 12792#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12791#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12790#L12 assume !(main_~i~0 >= 10); 12789#L12-2 assume !(main_~i~0 <= 0); 12788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12787#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12786#L12 assume !(main_~i~0 >= 10); 12785#L12-2 assume !(main_~i~0 <= 0); 12784#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12783#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12782#L12 assume !(main_~i~0 >= 10); 12781#L12-2 assume !(main_~i~0 <= 0); 12780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12737#L12 assume !(main_~i~0 >= 10); 12778#L12-2 assume !(main_~i~0 <= 0); 12777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12733#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2018-12-02 15:28:01,419 INFO L796 eck$LassoCheckResult]: Loop: 12731#L12-2 assume !(main_~i~0 <= 0); 12729#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12843#L12 assume !(main_~i~0 >= 10); 12842#L12-2 assume !(main_~i~0 <= 0); 12841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12840#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12839#L12 assume !(main_~i~0 >= 10); 12838#L12-2 assume !(main_~i~0 <= 0); 12837#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12835#L12 assume !(main_~i~0 >= 10); 12834#L12-2 assume !(main_~i~0 <= 0); 12833#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12832#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12831#L12 assume !(main_~i~0 >= 10); 12830#L12-2 assume !(main_~i~0 <= 0); 12829#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12828#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12813#L12 assume !(main_~i~0 >= 10); 12814#L12-2 assume !(main_~i~0 <= 0); 12810#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12809#L12 assume !(main_~i~0 >= 10); 12775#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12772#L12 assume !(main_~i~0 >= 10); 12771#L12-2 assume !(main_~i~0 <= 0); 12770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12768#L12 assume !(main_~i~0 >= 10); 12767#L12-2 assume !(main_~i~0 <= 0); 12766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12764#L12 assume !(main_~i~0 >= 10); 12763#L12-2 assume !(main_~i~0 <= 0); 12762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12760#L12 assume !(main_~i~0 >= 10); 12759#L12-2 assume !(main_~i~0 <= 0); 12758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12756#L12 assume !(main_~i~0 >= 10); 12755#L12-2 assume !(main_~i~0 <= 0); 12754#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12752#L12 assume !(main_~i~0 >= 10); 12751#L12-2 assume !(main_~i~0 <= 0); 12750#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12748#L12 assume !(main_~i~0 >= 10); 12747#L12-2 assume !(main_~i~0 <= 0); 12746#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12745#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12744#L12 assume !(main_~i~0 >= 10); 12743#L12-2 assume !(main_~i~0 <= 0); 12742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12740#L12 assume !(main_~i~0 >= 10); 12739#L12-2 assume !(main_~i~0 <= 0); 12738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12735#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2018-12-02 15:28:01,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2018-12-02 15:28:01,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:01,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:01,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:01,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:01,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2018-12-02 15:28:01,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:01,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:01,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:28:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:01,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 7 times [2018-12-02 15:28:01,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:01,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:28:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:01,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:28:01,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:28:01,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:28:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:01,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:01,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:28:01,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 15:28:01,737 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 65 [2018-12-02 15:28:01,745 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:01,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:01,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:01,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:01,745 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:28:01,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:01,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:01,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:01,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2018-12-02 15:28:01,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:01,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:01,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,774 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:01,774 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:01,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:01,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:01,789 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:01,789 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:01,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:01,792 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:01,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:28:01,808 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:01,901 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:28:01,902 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:01,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:01,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:01,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:01,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:28:01,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:01,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:01,903 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:01,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2018-12-02 15:28:01,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:01,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:01,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:01,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-12-02 15:28:01,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:01,933 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:28:01,934 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-12-02 15:28:01,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:01,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:01,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:01,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:01,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:28:01,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:28:01,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:01,935 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-12-02 15:28:01,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:01,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:01,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:01,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:01,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:28:01,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:28:01,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:01,937 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-12-02 15:28:01,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:01,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:01,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:01,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:01,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:01,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:01,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:01,938 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:28:01,939 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:28:01,939 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:28:01,939 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:28:01,939 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:28:01,940 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:28:01,940 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2018-12-02 15:28:01,940 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:28:01,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:01,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:01,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:28:01,999 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-12-02 15:28:01,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21 Second operand 10 states. [2018-12-02 15:28:02,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21. Second operand 10 states. Result 793 states and 836 transitions. Complement of second has 31 states. [2018-12-02 15:28:02,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2018-12-02 15:28:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 15:28:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2018-12-02 15:28:02,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2018-12-02 15:28:02,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:02,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2018-12-02 15:28:02,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:02,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2018-12-02 15:28:02,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:02,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 836 transitions. [2018-12-02 15:28:02,160 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:28:02,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 591 states and 634 transitions. [2018-12-02 15:28:02,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2018-12-02 15:28:02,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2018-12-02 15:28:02,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 591 states and 634 transitions. [2018-12-02 15:28:02,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:02,163 INFO L705 BuchiCegarLoop]: Abstraction has 591 states and 634 transitions. [2018-12-02 15:28:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states and 634 transitions. [2018-12-02 15:28:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 441. [2018-12-02 15:28:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-12-02 15:28:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2018-12-02 15:28:02,169 INFO L728 BuchiCegarLoop]: Abstraction has 441 states and 474 transitions. [2018-12-02 15:28:02,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:28:02,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:28:02,169 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand 9 states. [2018-12-02 15:28:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:28:02,206 INFO L93 Difference]: Finished difference Result 338 states and 361 transitions. [2018-12-02 15:28:02,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:28:02,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 361 transitions. [2018-12-02 15:28:02,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:02,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 287 states and 310 transitions. [2018-12-02 15:28:02,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2018-12-02 15:28:02,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-12-02 15:28:02,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 310 transitions. [2018-12-02 15:28:02,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:02,209 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 310 transitions. [2018-12-02 15:28:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 310 transitions. [2018-12-02 15:28:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 183. [2018-12-02 15:28:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-02 15:28:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2018-12-02 15:28:02,212 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2018-12-02 15:28:02,212 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2018-12-02 15:28:02,212 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-02 15:28:02,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 200 transitions. [2018-12-02 15:28:02,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:02,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:28:02,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:28:02,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:28:02,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2018-12-02 15:28:02,213 INFO L794 eck$LassoCheckResult]: Stem: 15182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15183#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15198#L12 assume !(main_~i~0 >= 10); 15276#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15275#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15190#L12 assume !(main_~i~0 >= 10); 15180#L12-2 assume !(main_~i~0 <= 0); 15181#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15187#L12 assume !(main_~i~0 >= 10); 15273#L12-2 assume !(main_~i~0 <= 0); 15192#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15193#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15272#L12 assume !(main_~i~0 >= 10); 15271#L12-2 assume !(main_~i~0 <= 0); 15270#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15268#L12 assume !(main_~i~0 >= 10); 15267#L12-2 assume !(main_~i~0 <= 0); 15266#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15264#L12 assume !(main_~i~0 >= 10); 15263#L12-2 assume !(main_~i~0 <= 0); 15262#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15260#L12 assume !(main_~i~0 >= 10); 15259#L12-2 assume !(main_~i~0 <= 0); 15258#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15256#L12 assume !(main_~i~0 >= 10); 15255#L12-2 assume !(main_~i~0 <= 0); 15254#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15253#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15252#L12 assume !(main_~i~0 >= 10); 15251#L12-2 assume !(main_~i~0 <= 0); 15250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15205#L12 assume !(main_~i~0 >= 10); 15248#L12-2 assume !(main_~i~0 <= 0); 15247#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15204#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15203#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2018-12-02 15:28:02,214 INFO L796 eck$LassoCheckResult]: Loop: 15201#L12-2 assume !(main_~i~0 <= 0); 15199#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15313#L12 assume !(main_~i~0 >= 10); 15312#L12-2 assume !(main_~i~0 <= 0); 15311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15309#L12 assume !(main_~i~0 >= 10); 15308#L12-2 assume !(main_~i~0 <= 0); 15307#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15306#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15305#L12 assume !(main_~i~0 >= 10); 15304#L12-2 assume !(main_~i~0 <= 0); 15303#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15302#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15301#L12 assume !(main_~i~0 >= 10); 15300#L12-2 assume !(main_~i~0 <= 0); 15299#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15298#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15297#L12 assume !(main_~i~0 >= 10); 15296#L12-2 assume !(main_~i~0 <= 0); 15295#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15283#L12 assume !(main_~i~0 >= 10); 15282#L12-2 assume !(main_~i~0 <= 0); 15280#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15281#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15284#L12 assume !(main_~i~0 >= 10); 15245#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15244#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15242#L12 assume !(main_~i~0 >= 10); 15241#L12-2 assume !(main_~i~0 <= 0); 15240#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15239#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15238#L12 assume !(main_~i~0 >= 10); 15237#L12-2 assume !(main_~i~0 <= 0); 15236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15235#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15234#L12 assume !(main_~i~0 >= 10); 15233#L12-2 assume !(main_~i~0 <= 0); 15232#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15231#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15230#L12 assume !(main_~i~0 >= 10); 15229#L12-2 assume !(main_~i~0 <= 0); 15228#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15227#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15226#L12 assume !(main_~i~0 >= 10); 15225#L12-2 assume !(main_~i~0 <= 0); 15224#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15223#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15222#L12 assume !(main_~i~0 >= 10); 15221#L12-2 assume !(main_~i~0 <= 0); 15220#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15218#L12 assume !(main_~i~0 >= 10); 15217#L12-2 assume !(main_~i~0 <= 0); 15216#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15215#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15214#L12 assume !(main_~i~0 >= 10); 15213#L12-2 assume !(main_~i~0 <= 0); 15212#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15211#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15210#L12 assume !(main_~i~0 >= 10); 15209#L12-2 assume !(main_~i~0 <= 0); 15208#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2018-12-02 15:28:02,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:02,214 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2018-12-02 15:28:02,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:02,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:02,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:28:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:02,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2018-12-02 15:28:02,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:02,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:02,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 8 times [2018-12-02 15:28:02,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:02,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:02,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:28:02,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:28:02,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:28:02,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:28:02,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:28:02,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:02,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:28:02,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-02 15:28:02,538 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 68 [2018-12-02 15:28:02,544 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:02,544 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:02,544 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:02,544 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:02,544 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:28:02,544 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:02,544 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:02,544 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:02,544 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2018-12-02 15:28:02,544 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:02,544 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:02,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-12-02 15:28:02,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-12-02 15:28:02,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:02,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:02,572 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:02,572 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:02,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:02,576 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:02,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:28:02,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:02,594 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:28:02,607 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:02,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:02,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:02,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:02,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:28:02,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:02,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:02,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:02,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2018-12-02 15:28:02,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:02,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:02,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:02,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:02,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:02,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:02,643 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:02,643 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:28:02,644 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-12-02 15:28:02,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:02,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:02,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:02,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:02,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:02,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:02,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:02,645 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:28:02,646 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:28:02,646 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:28:02,646 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:28:02,646 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:28:02,646 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:28:02,646 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2018-12-02 15:28:02,647 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:28:02,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:02,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:02,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:28:02,774 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-12-02 15:28:02,774 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20 Second operand 11 states. [2018-12-02 15:28:03,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20. Second operand 11 states. Result 913 states and 956 transitions. Complement of second has 35 states. [2018-12-02 15:28:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2018-12-02 15:28:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 15:28:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-12-02 15:28:03,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2018-12-02 15:28:03,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:03,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2018-12-02 15:28:03,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:03,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2018-12-02 15:28:03,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:03,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 956 transitions. [2018-12-02 15:28:03,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:28:03,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 651 states and 694 transitions. [2018-12-02 15:28:03,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2018-12-02 15:28:03,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-12-02 15:28:03,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 651 states and 694 transitions. [2018-12-02 15:28:03,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:03,132 INFO L705 BuchiCegarLoop]: Abstraction has 651 states and 694 transitions. [2018-12-02 15:28:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 694 transitions. [2018-12-02 15:28:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 449. [2018-12-02 15:28:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-12-02 15:28:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 480 transitions. [2018-12-02 15:28:03,136 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 480 transitions. [2018-12-02 15:28:03,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 15:28:03,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:28:03,136 INFO L87 Difference]: Start difference. First operand 449 states and 480 transitions. Second operand 10 states. [2018-12-02 15:28:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:28:03,173 INFO L93 Difference]: Finished difference Result 354 states and 375 transitions. [2018-12-02 15:28:03,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:28:03,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 375 transitions. [2018-12-02 15:28:03,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:03,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 295 states and 316 transitions. [2018-12-02 15:28:03,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-12-02 15:28:03,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2018-12-02 15:28:03,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 316 transitions. [2018-12-02 15:28:03,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:03,176 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 316 transitions. [2018-12-02 15:28:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 316 transitions. [2018-12-02 15:28:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2018-12-02 15:28:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-02 15:28:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2018-12-02 15:28:03,179 INFO L728 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2018-12-02 15:28:03,179 INFO L608 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2018-12-02 15:28:03,179 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-02 15:28:03,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 203 transitions. [2018-12-02 15:28:03,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:03,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:28:03,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:28:03,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:28:03,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2018-12-02 15:28:03,181 INFO L794 eck$LassoCheckResult]: Stem: 17833#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 17834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17847#L12 assume !(main_~i~0 >= 10); 17931#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17930#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17929#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17928#L12 assume !(main_~i~0 >= 10); 17831#L12-2 assume !(main_~i~0 <= 0); 17832#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17838#L12 assume !(main_~i~0 >= 10); 17840#L12-2 assume !(main_~i~0 <= 0); 17925#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17921#L12 assume !(main_~i~0 >= 10); 17920#L12-2 assume !(main_~i~0 <= 0); 17919#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17917#L12 assume !(main_~i~0 >= 10); 17916#L12-2 assume !(main_~i~0 <= 0); 17915#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17914#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17913#L12 assume !(main_~i~0 >= 10); 17912#L12-2 assume !(main_~i~0 <= 0); 17911#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17909#L12 assume !(main_~i~0 >= 10); 17908#L12-2 assume !(main_~i~0 <= 0); 17907#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17906#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17905#L12 assume !(main_~i~0 >= 10); 17904#L12-2 assume !(main_~i~0 <= 0); 17903#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17901#L12 assume !(main_~i~0 >= 10); 17900#L12-2 assume !(main_~i~0 <= 0); 17899#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17898#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17856#L12 assume !(main_~i~0 >= 10); 17897#L12-2 assume !(main_~i~0 <= 0); 17896#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17855#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17852#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2018-12-02 15:28:03,181 INFO L796 eck$LassoCheckResult]: Loop: 17850#L12-2 assume !(main_~i~0 <= 0); 17848#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17964#L12 assume !(main_~i~0 >= 10); 17963#L12-2 assume !(main_~i~0 <= 0); 17962#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17960#L12 assume !(main_~i~0 >= 10); 17959#L12-2 assume !(main_~i~0 <= 0); 17958#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17957#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17956#L12 assume !(main_~i~0 >= 10); 17955#L12-2 assume !(main_~i~0 <= 0); 17954#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17953#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17952#L12 assume !(main_~i~0 >= 10); 17951#L12-2 assume !(main_~i~0 <= 0); 17950#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17949#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17948#L12 assume !(main_~i~0 >= 10); 17947#L12-2 assume !(main_~i~0 <= 0); 17946#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17945#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17944#L12 assume !(main_~i~0 >= 10); 17943#L12-2 assume !(main_~i~0 <= 0); 17942#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17935#L12 assume !(main_~i~0 >= 10); 17936#L12-2 assume !(main_~i~0 <= 0); 17926#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17937#L12 assume !(main_~i~0 >= 10); 17894#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17893#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17892#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17891#L12 assume !(main_~i~0 >= 10); 17890#L12-2 assume !(main_~i~0 <= 0); 17889#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17887#L12 assume !(main_~i~0 >= 10); 17886#L12-2 assume !(main_~i~0 <= 0); 17885#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17883#L12 assume !(main_~i~0 >= 10); 17882#L12-2 assume !(main_~i~0 <= 0); 17881#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17879#L12 assume !(main_~i~0 >= 10); 17878#L12-2 assume !(main_~i~0 <= 0); 17877#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17876#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17875#L12 assume !(main_~i~0 >= 10); 17874#L12-2 assume !(main_~i~0 <= 0); 17873#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17872#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17871#L12 assume !(main_~i~0 >= 10); 17870#L12-2 assume !(main_~i~0 <= 0); 17869#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17867#L12 assume !(main_~i~0 >= 10); 17866#L12-2 assume !(main_~i~0 <= 0); 17865#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17864#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17863#L12 assume !(main_~i~0 >= 10); 17862#L12-2 assume !(main_~i~0 <= 0); 17861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17859#L12 assume !(main_~i~0 >= 10); 17858#L12-2 assume !(main_~i~0 <= 0); 17857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17854#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2018-12-02 15:28:03,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2018-12-02 15:28:03,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:03,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:03,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:03,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:03,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:03,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:03,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2018-12-02 15:28:03,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:03,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:03,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:03,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:03,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:03,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 9 times [2018-12-02 15:28:03,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:03,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:03,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:03,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:03,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:03,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:03,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:28:03,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:28:03,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:28:03,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-02 15:28:03,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:28:03,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1112 proven. 226 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-12-02 15:28:03,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:28:03,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2018-12-02 15:28:03,540 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 69 [2018-12-02 15:28:03,545 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:03,545 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:03,546 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:03,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:03,546 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:28:03,546 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,546 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:03,546 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:03,546 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2018-12-02 15:28:03,546 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:03,546 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:03,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:03,575 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:03,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:03,578 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:03,578 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:03,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:03,607 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:03,607 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_25=1} Honda state: {v_rep~unnamed0~0~true_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:03,610 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:03,624 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:03,624 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_25=0} Honda state: {v_rep~unnamed0~0~false_25=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,626 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:03,627 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:28:03,643 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:03,645 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:28:03,657 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:03,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:03,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:03,658 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:03,658 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:28:03,658 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:03,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:03,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:03,658 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2018-12-02 15:28:03,658 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:03,658 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:03,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:03,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:03,695 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:28:03,695 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-12-02 15:28:03,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:03,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:03,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:03,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:03,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:28:03,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:28:03,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:03,697 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-12-02 15:28:03,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:03,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:03,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:03,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:03,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:03,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:03,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:03,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:03,698 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-12-02 15:28:03,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:03,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:03,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:03,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:03,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:28:03,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:28:03,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:03,699 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-12-02 15:28:03,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:03,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:03,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:03,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:03,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:03,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:03,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:03,700 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:28:03,701 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:28:03,701 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:28:03,701 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:28:03,702 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:28:03,702 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:28:03,702 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-12-02 15:28:03,702 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:28:03,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:03,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:03,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:28:03,778 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 10 loop predicates [2018-12-02 15:28:03,778 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19 Second operand 12 states. [2018-12-02 15:28:04,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 1050 states and 1093 transitions. Complement of second has 39 states. [2018-12-02 15:28:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2018-12-02 15:28:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-02 15:28:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2018-12-02 15:28:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2018-12-02 15:28:04,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2018-12-02 15:28:04,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:04,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2018-12-02 15:28:04,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:04,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1050 states and 1093 transitions. [2018-12-02 15:28:04,018 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-12-02 15:28:04,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1050 states to 720 states and 763 transitions. [2018-12-02 15:28:04,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 423 [2018-12-02 15:28:04,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2018-12-02 15:28:04,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 763 transitions. [2018-12-02 15:28:04,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:04,020 INFO L705 BuchiCegarLoop]: Abstraction has 720 states and 763 transitions. [2018-12-02 15:28:04,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 763 transitions. [2018-12-02 15:28:04,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 457. [2018-12-02 15:28:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-12-02 15:28:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2018-12-02 15:28:04,024 INFO L728 BuchiCegarLoop]: Abstraction has 457 states and 486 transitions. [2018-12-02 15:28:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:28:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:28:04,024 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 13 states. [2018-12-02 15:28:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:28:04,077 INFO L93 Difference]: Finished difference Result 370 states and 389 transitions. [2018-12-02 15:28:04,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:28:04,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 389 transitions. [2018-12-02 15:28:04,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:04,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 303 states and 322 transitions. [2018-12-02 15:28:04,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2018-12-02 15:28:04,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2018-12-02 15:28:04,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 322 transitions. [2018-12-02 15:28:04,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:04,080 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2018-12-02 15:28:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 322 transitions. [2018-12-02 15:28:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 191. [2018-12-02 15:28:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-02 15:28:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-12-02 15:28:04,083 INFO L728 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-12-02 15:28:04,083 INFO L608 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-12-02 15:28:04,083 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-02 15:28:04,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 206 transitions. [2018-12-02 15:28:04,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:04,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:28:04,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:28:04,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-02 15:28:04,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2018-12-02 15:28:04,084 INFO L794 eck$LassoCheckResult]: Stem: 20684#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 20685#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20695#L12 assume !(main_~i~0 >= 10); 20812#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20806#L12 assume !(main_~i~0 >= 10); 20804#L12-2 assume !(main_~i~0 <= 0); 20803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20688#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20689#L12 assume !(main_~i~0 >= 10); 20682#L12-2 assume !(main_~i~0 <= 0); 20683#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20691#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20800#L12 assume !(main_~i~0 >= 10); 20798#L12-2 assume !(main_~i~0 <= 0); 20796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20792#L12 assume !(main_~i~0 >= 10); 20790#L12-2 assume !(main_~i~0 <= 0); 20788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20784#L12 assume !(main_~i~0 >= 10); 20782#L12-2 assume !(main_~i~0 <= 0); 20780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20776#L12 assume !(main_~i~0 >= 10); 20774#L12-2 assume !(main_~i~0 <= 0); 20772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20768#L12 assume !(main_~i~0 >= 10); 20766#L12-2 assume !(main_~i~0 <= 0); 20764#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20760#L12 assume !(main_~i~0 >= 10); 20758#L12-2 assume !(main_~i~0 <= 0); 20756#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20705#L12 assume !(main_~i~0 >= 10); 20748#L12-2 assume !(main_~i~0 <= 0); 20745#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20704#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20701#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2018-12-02 15:28:04,084 INFO L796 eck$LassoCheckResult]: Loop: 20698#L12-2 assume !(main_~i~0 <= 0); 20699#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20811#L12 assume !(main_~i~0 >= 10); 20809#L12-2 assume !(main_~i~0 <= 0); 20807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20802#L12 assume !(main_~i~0 >= 10); 20801#L12-2 assume !(main_~i~0 <= 0); 20799#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20795#L12 assume !(main_~i~0 >= 10); 20793#L12-2 assume !(main_~i~0 <= 0); 20791#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20787#L12 assume !(main_~i~0 >= 10); 20785#L12-2 assume !(main_~i~0 <= 0); 20783#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20779#L12 assume !(main_~i~0 >= 10); 20777#L12-2 assume !(main_~i~0 <= 0); 20775#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20771#L12 assume !(main_~i~0 >= 10); 20769#L12-2 assume !(main_~i~0 <= 0); 20767#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20763#L12 assume !(main_~i~0 >= 10); 20761#L12-2 assume !(main_~i~0 <= 0); 20759#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20754#L12 assume !(main_~i~0 >= 10); 20751#L12-2 assume !(main_~i~0 <= 0); 20752#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20747#L12 assume !(main_~i~0 >= 10); 20743#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20740#L12 assume !(main_~i~0 >= 10); 20739#L12-2 assume !(main_~i~0 <= 0); 20738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20737#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20736#L12 assume !(main_~i~0 >= 10); 20735#L12-2 assume !(main_~i~0 <= 0); 20734#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20733#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20732#L12 assume !(main_~i~0 >= 10); 20731#L12-2 assume !(main_~i~0 <= 0); 20730#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20729#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20728#L12 assume !(main_~i~0 >= 10); 20727#L12-2 assume !(main_~i~0 <= 0); 20726#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20725#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20724#L12 assume !(main_~i~0 >= 10); 20723#L12-2 assume !(main_~i~0 <= 0); 20722#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20720#L12 assume !(main_~i~0 >= 10); 20719#L12-2 assume !(main_~i~0 <= 0); 20718#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20717#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20716#L12 assume !(main_~i~0 >= 10); 20715#L12-2 assume !(main_~i~0 <= 0); 20714#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20712#L12 assume !(main_~i~0 >= 10); 20711#L12-2 assume !(main_~i~0 <= 0); 20710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20708#L12 assume !(main_~i~0 >= 10); 20707#L12-2 assume !(main_~i~0 <= 0); 20706#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20702#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2018-12-02 15:28:04,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2018-12-02 15:28:04,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:04,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:04,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:04,091 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2018-12-02 15:28:04,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:04,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:04,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:04,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:04,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:04,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 10 times [2018-12-02 15:28:04,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:04,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:04,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:04,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:04,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:04,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:28:04,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:28:04,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:28:04,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:28:04,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:28:04,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-12-02 15:28:04,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:28:04,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-02 15:28:04,458 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 74 [2018-12-02 15:28:04,464 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:04,464 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:04,464 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:04,464 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:04,464 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 15:28:04,464 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:04,464 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:04,464 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:04,464 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2018-12-02 15:28:04,464 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:04,464 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:04,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:04,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:04,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:04,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:04,510 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:04,510 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:04,512 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:04,512 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:04,514 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 15:28:04,514 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:04,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 15:28:04,529 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:04,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 15:28:04,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 15:28:04,547 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 15:28:04,560 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 15:28:04,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 15:28:04,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 15:28:04,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 15:28:04,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 15:28:04,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 15:28:04,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 15:28:04,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 15:28:04,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2018-12-02 15:28:04,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 15:28:04,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 15:28:04,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 15:28:04,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 15:28:04,590 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 15:28:04,591 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-12-02 15:28:04,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:04,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:04,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:04,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:04,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 15:28:04,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 15:28:04,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:04,592 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-12-02 15:28:04,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:04,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:04,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:04,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:04,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:04,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:04,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:04,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 15:28:04,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 15:28:04,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 15:28:04,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 15:28:04,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 15:28:04,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 15:28:04,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 15:28:04,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 15:28:04,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 15:28:04,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 15:28:04,595 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 15:28:04,595 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 15:28:04,595 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 15:28:04,595 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 15:28:04,595 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 15:28:04,595 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-12-02 15:28:04,595 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 15:28:04,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:04,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:28:04,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:28:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-02 15:28:04,739 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2018-12-02 15:28:04,739 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18 Second operand 13 states. [2018-12-02 15:28:05,544 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18. Second operand 13 states. Result 1203 states and 1246 transitions. Complement of second has 43 states. [2018-12-02 15:28:05,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2018-12-02 15:28:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 15:28:05,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2018-12-02 15:28:05,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 76 letters. [2018-12-02 15:28:05,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:05,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 119 letters. Loop has 76 letters. [2018-12-02 15:28:05,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:05,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 152 letters. [2018-12-02 15:28:05,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 15:28:05,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 1246 transitions. [2018-12-02 15:28:05,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:05,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 796 states and 837 transitions. [2018-12-02 15:28:05,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2018-12-02 15:28:05,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2018-12-02 15:28:05,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 837 transitions. [2018-12-02 15:28:05,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:05,550 INFO L705 BuchiCegarLoop]: Abstraction has 796 states and 837 transitions. [2018-12-02 15:28:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 837 transitions. [2018-12-02 15:28:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 464. [2018-12-02 15:28:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-12-02 15:28:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 489 transitions. [2018-12-02 15:28:05,553 INFO L728 BuchiCegarLoop]: Abstraction has 464 states and 489 transitions. [2018-12-02 15:28:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:28:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 15:28:05,553 INFO L87 Difference]: Start difference. First operand 464 states and 489 transitions. Second operand 12 states. [2018-12-02 15:28:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:28:05,615 INFO L93 Difference]: Finished difference Result 388 states and 402 transitions. [2018-12-02 15:28:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:28:05,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 402 transitions. [2018-12-02 15:28:05,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:05,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 311 states and 325 transitions. [2018-12-02 15:28:05,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2018-12-02 15:28:05,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2018-12-02 15:28:05,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 325 transitions. [2018-12-02 15:28:05,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 15:28:05,617 INFO L705 BuchiCegarLoop]: Abstraction has 311 states and 325 transitions. [2018-12-02 15:28:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 325 transitions. [2018-12-02 15:28:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 115. [2018-12-02 15:28:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-02 15:28:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-12-02 15:28:05,619 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-12-02 15:28:05,620 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-12-02 15:28:05,620 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-02 15:28:05,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 126 transitions. [2018-12-02 15:28:05,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-02 15:28:05,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 15:28:05,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 15:28:05,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 15:28:05,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2018-12-02 15:28:05,620 INFO L794 eck$LassoCheckResult]: Stem: 23748#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 23749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2018-12-02 15:28:05,620 INFO L796 eck$LassoCheckResult]: Loop: 23796#L12 assume !(main_~i~0 >= 10); 23795#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 23794#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23793#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23792#L12 assume !(main_~i~0 >= 10); 23791#L12-2 assume !(main_~i~0 <= 0); 23790#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23788#L12 assume !(main_~i~0 >= 10); 23787#L12-2 assume !(main_~i~0 <= 0); 23786#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23784#L12 assume !(main_~i~0 >= 10); 23783#L12-2 assume !(main_~i~0 <= 0); 23782#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23780#L12 assume !(main_~i~0 >= 10); 23779#L12-2 assume !(main_~i~0 <= 0); 23778#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23776#L12 assume !(main_~i~0 >= 10); 23775#L12-2 assume !(main_~i~0 <= 0); 23774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23772#L12 assume !(main_~i~0 >= 10); 23771#L12-2 assume !(main_~i~0 <= 0); 23770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23768#L12 assume !(main_~i~0 >= 10); 23767#L12-2 assume !(main_~i~0 <= 0); 23766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23764#L12 assume !(main_~i~0 >= 10); 23763#L12-2 assume !(main_~i~0 <= 0); 23762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23760#L12 assume !(main_~i~0 >= 10); 23759#L12-2 assume !(main_~i~0 <= 0); 23758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23756#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 23755#L12-2 assume !(main_~i~0 <= 0); 23747#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23753#L12 assume !(main_~i~0 >= 10); 23744#L12-2 assume !(main_~i~0 <= 0); 23745#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23751#L12 assume !(main_~i~0 >= 10); 23754#L12-2 assume !(main_~i~0 <= 0); 23858#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23856#L12 assume !(main_~i~0 >= 10); 23855#L12-2 assume !(main_~i~0 <= 0); 23854#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23852#L12 assume !(main_~i~0 >= 10); 23851#L12-2 assume !(main_~i~0 <= 0); 23850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23848#L12 assume !(main_~i~0 >= 10); 23847#L12-2 assume !(main_~i~0 <= 0); 23846#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23844#L12 assume !(main_~i~0 >= 10); 23843#L12-2 assume !(main_~i~0 <= 0); 23842#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23840#L12 assume !(main_~i~0 >= 10); 23839#L12-2 assume !(main_~i~0 <= 0); 23838#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23836#L12 assume !(main_~i~0 >= 10); 23835#L12-2 assume !(main_~i~0 <= 0); 23809#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23806#L12 assume !(main_~i~0 >= 10); 23808#L12-2 assume !(main_~i~0 <= 0); 23807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2018-12-02 15:28:05,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2018-12-02 15:28:05,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:05,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:05,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:05,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:05,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash -950527111, now seen corresponding path program 17 times [2018-12-02 15:28:05,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:05,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:05,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:05,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:28:05,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:05,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:28:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2117507742, now seen corresponding path program 11 times [2018-12-02 15:28:05,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:28:05,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:28:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:05,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:28:05,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:28:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:28:05,889 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 74 [2018-12-02 15:28:05,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:28:05 BoogieIcfgContainer [2018-12-02 15:28:05,915 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 15:28:05,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:28:05,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:28:05,915 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:28:05,916 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:27:55" (3/4) ... [2018-12-02 15:28:05,918 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 15:28:05,956 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f14efb2c-70b9-44ba-a527-317291620ed3/bin-2019/uautomizer/witness.graphml [2018-12-02 15:28:05,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:28:05,957 INFO L168 Benchmark]: Toolchain (without parser) took 11207.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -168.0 MB). Peak memory consumption was 141.8 MB. Max. memory is 11.5 GB. [2018-12-02 15:28:05,957 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:28:05,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 116.13 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:28:05,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:28:05,958 INFO L168 Benchmark]: Boogie Preprocessor took 9.89 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:28:05,958 INFO L168 Benchmark]: RCFGBuilder took 129.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:28:05,958 INFO L168 Benchmark]: BuchiAutomizer took 10891.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.4 MB). Peak memory consumption was 162.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:28:05,958 INFO L168 Benchmark]: Witness Printer took 41.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:28:05,959 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 116.13 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 16.81 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.89 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 129.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -152.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10891.63 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -37.4 MB). Peak memory consumption was 162.4 MB. Max. memory is 11.5 GB. * Witness Printer took 41.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. 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 36 terminating modules (22 trivial, 12 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 115 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 6.6s. Construction of modules took 1.1s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 2226 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 191 states and ocurred in iteration 23. Nontrivial modules had stage [12, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 281 SDtfs, 858 SDslu, 9 SDs, 0 SdLazy, 2372 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT10 SILN0 SILU0 SILI9 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf97 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq129 hnf96 smp98 dnf100 smp100 tf112 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 28 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e3b3d81=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...