./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/UpAndDown_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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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 014f994c3374ea132faaa71956bb80ddfc4c8f9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 02:42:32,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:42:32,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:42:32,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:42:32,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:42:32,240 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:42:32,241 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:42:32,241 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:42:32,242 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:42:32,243 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:42:32,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:42:32,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:42:32,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:42:32,244 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:42:32,245 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:42:32,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:42:32,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:42:32,246 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:42:32,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:42:32,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:42:32,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:42:32,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:42:32,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:42:32,250 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:42:32,250 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:42:32,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:42:32,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:42:32,251 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:42:32,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:42:32,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:42:32,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:42:32,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:42:32,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:42:32,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:42:32,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:42:32,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:42:32,254 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 02:42:32,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:42:32,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:42:32,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 02:42:32,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 02:42:32,263 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 02:42:32,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:42:32,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 02:42:32,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 02:42:32,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:42:32,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 02:42:32,265 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 02:42:32,265 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 02:42:32,265 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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 -> 014f994c3374ea132faaa71956bb80ddfc4c8f9b [2018-12-09 02:42:32,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:42:32,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:42:32,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:42:32,296 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:42:32,296 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:42:32,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c [2018-12-09 02:42:32,331 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/data/6f0609937/31ef71b7c81641ae969ea67fa0cbbf5c/FLAG66e281fba [2018-12-09 02:42:32,711 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:42:32,711 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c [2018-12-09 02:42:32,715 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/data/6f0609937/31ef71b7c81641ae969ea67fa0cbbf5c/FLAG66e281fba [2018-12-09 02:42:33,066 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/data/6f0609937/31ef71b7c81641ae969ea67fa0cbbf5c [2018-12-09 02:42:33,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:42:33,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:42:33,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:42:33,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:42:33,073 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:42:33,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff7353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33, skipping insertion in model container [2018-12-09 02:42:33,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:42:33,092 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:42:33,175 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:42:33,178 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:42:33,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:42:33,193 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:42:33,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33 WrapperNode [2018-12-09 02:42:33,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:42:33,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:42:33,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:42:33,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:42:33,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:42:33,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:42:33,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:42:33,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:42:33,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... [2018-12-09 02:42:33,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:42:33,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:42:33,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:42:33,225 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:42:33,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:33,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:42:33,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:42:33,382 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:42:33,382 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 02:42:33,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:33 BoogieIcfgContainer [2018-12-09 02:42:33,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:42:33,383 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 02:42:33,383 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 02:42:33,386 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 02:42:33,387 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:42:33,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 02:42:33" (1/3) ... [2018-12-09 02:42:33,388 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14eda7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 02:42:33, skipping insertion in model container [2018-12-09 02:42:33,388 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:42:33,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:42:33" (2/3) ... [2018-12-09 02:42:33,389 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14eda7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 02:42:33, skipping insertion in model container [2018-12-09 02:42:33,389 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 02:42:33,389 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:33" (3/3) ... [2018-12-09 02:42:33,390 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDown_false-termination_true-no-overflow.c [2018-12-09 02:42:33,426 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 02:42:33,427 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 02:42:33,427 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 02:42:33,427 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 02:42:33,427 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:42:33,427 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:42:33,427 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 02:42:33,428 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:42:33,428 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 02:42:33,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-09 02:42:33,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 02:42:33,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:33,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:33,453 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 02:42:33,453 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:33,453 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 02:42:33,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-12-09 02:42:33,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-09 02:42:33,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:33,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:33,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 02:42:33,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:33,458 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-09 02:42:33,459 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume 10 == main_~i~0;main_~up~0 := 0; 3#L12-2true assume 0 == main_~i~0;main_~up~0 := 1; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2018-12-09 02:42:33,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-12-09 02:42:33,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:33,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2018-12-09 02:42:33,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:33,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:33,561 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-09 02:42:33,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:33,566 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:33,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:33,576 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-09 02:42:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:33,603 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-09 02:42:33,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:33,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-12-09 02:42:33,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 02:42:33,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 14 transitions. [2018-12-09 02:42:33,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-09 02:42:33,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-09 02:42:33,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2018-12-09 02:42:33,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 02:42:33,609 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-09 02:42:33,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2018-12-09 02:42:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-09 02:42:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:42:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-12-09 02:42:33,626 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-09 02:42:33,626 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-09 02:42:33,626 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 02:42:33,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2018-12-09 02:42:33,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 02:42:33,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:33,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:33,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-12-09 02:42:33,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:33,628 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-09 02:42:33,628 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume 10 == main_~i~0;main_~up~0 := 0; 35#L12-2 assume !(0 == main_~i~0); 36#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2018-12-09 02:42:33,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-12-09 02:42:33,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:33,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2018-12-09 02:42:33,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:33,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2018-12-09 02:42:33,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:33,679 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:33,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:33,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:33,680 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:33,680 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:33,680 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:33,680 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:33,680 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:33,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration2_Loop [2018-12-09 02:42:33,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:33,681 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:33,693 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-09 02:42:33,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-09 02:42:33,700 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-09 02:42:33,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-09 02:42:33,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:33,751 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:33,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:33,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:33,775 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:33,775 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:33,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:33,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:33,792 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:33,792 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:33,795 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:33,795 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:33,797 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:33,797 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:33,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:33,812 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:33,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:33,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:33,833 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:33,845 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:33,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:33,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:33,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:33,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:33,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:33,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:33,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:33,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration2_Loop [2018-12-09 02:42:33,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:33,846 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:33,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-09 02:42:33,849 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-09 02:42:33,851 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-09 02:42:33,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-09 02:42:33,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:33,888 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:33,889 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-09 02:42:33,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:33,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:33,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:33,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:33,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:33,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:33,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:33,896 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-09 02:42:33,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:33,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:33,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:33,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:33,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:33,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:33,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:33,902 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-09 02:42:33,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:33,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:33,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:33,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:33,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:33,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:33,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:33,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:33,904 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-09 02:42:33,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:33,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:33,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:33,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:33,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:33,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:33,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:33,908 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:33,910 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:33,911 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 02:42:33,912 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:33,912 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:33,912 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:33,912 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-09 02:42:33,913 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:33,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:33,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:33,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:33,944 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-09 02:42:33,946 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-09 02:42:33,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-12-09 02:42:33,975 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 5 states. [2018-12-09 02:42:33,975 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-09 02:42:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-09 02:42:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-12-09 02:42:33,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2018-12-09 02:42:33,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:33,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 02:42:33,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:33,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2018-12-09 02:42:33,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:33,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2018-12-09 02:42:33,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 02:42:33,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 32 transitions. [2018-12-09 02:42:33,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 02:42:33,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-09 02:42:33,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2018-12-09 02:42:33,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:33,979 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2018-12-09 02:42:33,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2018-12-09 02:42:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-09 02:42:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 02:42:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-12-09 02:42:33,981 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-09 02:42:33,981 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-12-09 02:42:33,981 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 02:42:33,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-12-09 02:42:33,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-12-09 02:42:33,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:33,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:33,982 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:42:33,982 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:33,982 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 10 == main_~i~0;main_~up~0 := 0; 112#L12-2 assume !(0 == main_~i~0); 120#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-12-09 02:42:33,982 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume 10 == main_~i~0;main_~up~0 := 0; 117#L12-2 assume !(0 == main_~i~0); 118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-12-09 02:42:33,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2018-12-09 02:42:33,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:33,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:33,990 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-09 02:42:33,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:33,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:42:33,990 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:33,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2018-12-09 02:42:33,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:33,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:33,997 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-09 02:42:33,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:33,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:42:33,997 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:33,998 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-09 02:42:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:34,005 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2018-12-09 02:42:34,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:34,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2018-12-09 02:42:34,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-09 02:42:34,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 39 transitions. [2018-12-09 02:42:34,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 02:42:34,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 02:42:34,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2018-12-09 02:42:34,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,007 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2018-12-09 02:42:34,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2018-12-09 02:42:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-09 02:42:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-09 02:42:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-12-09 02:42:34,008 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-12-09 02:42:34,008 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-12-09 02:42:34,008 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 02:42:34,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2018-12-09 02:42:34,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-09 02:42:34,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:34,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:34,009 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:42:34,009 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:34,009 INFO L794 eck$LassoCheckResult]: Stem: 161#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; 162#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 166#L12 assume !(10 == main_~i~0); 168#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2018-12-09 02:42:34,009 INFO L796 eck$LassoCheckResult]: Loop: 173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 178#L12 assume !(10 == main_~i~0); 176#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 174#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2018-12-09 02:42:34,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2018-12-09 02:42:34,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2018-12-09 02:42:34,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2018-12-09 02:42:34,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,030 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-09 02:42:34,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:34,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:42:34,044 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:34,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:34,044 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:34,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:34,045 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:34,045 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:34,045 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:34,045 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:34,045 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration4_Loop [2018-12-09 02:42:34,045 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:34,045 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:34,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:34,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:34,048 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-09 02:42:34,049 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-09 02:42:34,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:34,081 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,098 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,098 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,101 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,125 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,125 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,127 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,128 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,130 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,130 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,145 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,169 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:34,169 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,172 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:34,184 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:34,185 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:34,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:34,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:34,185 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:34,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:34,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:34,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:34,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration4_Loop [2018-12-09 02:42:34,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:34,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:34,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:34,188 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-09 02:42:34,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:34,193 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-09 02:42:34,231 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:34,231 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:34,232 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-09 02:42:34,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:34,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:34,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:34,237 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-09 02:42:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:34,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:34,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:34,242 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-09 02:42:34,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:34,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:34,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:34,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:34,247 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:34,247 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:34,248 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:34,248 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:34,248 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:34,248 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-09 02:42:34,248 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:34,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:34,274 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-09 02:42:34,274 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-09 02:42:34,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-12-09 02:42:34,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 62 transitions. Complement of second has 7 states. [2018-12-09 02:42:34,297 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-09 02:42:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 02:42:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 02:42:34,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 02:42:34,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 02:42:34,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-09 02:42:34,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-12-09 02:42:34,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-09 02:42:34,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 40 states and 60 transitions. [2018-12-09 02:42:34,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 02:42:34,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-09 02:42:34,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 60 transitions. [2018-12-09 02:42:34,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,299 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-12-09 02:42:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 60 transitions. [2018-12-09 02:42:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-12-09 02:42:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 02:42:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2018-12-09 02:42:34,302 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 56 transitions. [2018-12-09 02:42:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:34,302 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 4 states. [2018-12-09 02:42:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:34,318 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2018-12-09 02:42:34,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:34,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. [2018-12-09 02:42:34,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-12-09 02:42:34,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 56 transitions. [2018-12-09 02:42:34,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-12-09 02:42:34,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-12-09 02:42:34,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 56 transitions. [2018-12-09 02:42:34,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,320 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 56 transitions. [2018-12-09 02:42:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 56 transitions. [2018-12-09 02:42:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-09 02:42:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 02:42:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-12-09 02:42:34,321 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-12-09 02:42:34,321 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-12-09 02:42:34,322 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 02:42:34,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2018-12-09 02:42:34,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 02:42:34,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:34,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:34,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 02:42:34,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:34,322 INFO L794 eck$LassoCheckResult]: Stem: 360#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; 361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 365#L12 assume !(10 == main_~i~0); 367#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 374#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2018-12-09 02:42:34,323 INFO L796 eck$LassoCheckResult]: Loop: 362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 363#L12 assume !(10 == main_~i~0); 356#L12-2 assume !(0 == main_~i~0); 357#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2018-12-09 02:42:34,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2018-12-09 02:42:34,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2018-12-09 02:42:34,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:34,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,331 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2018-12-09 02:42:34,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,363 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:34,363 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:34,363 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:34,363 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:34,363 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:34,363 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:34,364 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:34,364 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:34,364 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration5_Loop [2018-12-09 02:42:34,364 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:34,364 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:34,365 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-09 02:42:34,367 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-09 02:42:34,368 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-09 02:42:34,369 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-09 02:42:34,415 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:34,415 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,435 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,440 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,440 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,454 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,469 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,471 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:34,488 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,491 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:34,503 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:34,504 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:34,504 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:34,504 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:34,504 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:34,504 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:34,504 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:34,504 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:34,504 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration5_Loop [2018-12-09 02:42:34,504 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:34,504 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:34,506 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-09 02:42:34,508 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-09 02:42:34,510 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-09 02:42:34,518 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-09 02:42:34,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:34,559 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:34,559 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-09 02:42:34,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:34,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:34,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:34,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:34,561 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-09 02:42:34,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:34,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:34,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:34,565 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-09 02:42:34,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:34,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:34,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:34,567 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:34,569 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:34,569 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:34,569 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:34,569 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:34,569 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:34,569 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-09 02:42:34,569 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:34,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:34,601 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-09 02:42:34,601 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-09 02:42:34,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-09 02:42:34,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 40 states and 57 transitions. Complement of second has 7 states. [2018-12-09 02:42:34,620 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-09 02:42:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 02:42:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-12-09 02:42:34,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-09 02:42:34,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-09 02:42:34,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-09 02:42:34,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2018-12-09 02:42:34,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 02:42:34,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 55 transitions. [2018-12-09 02:42:34,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-09 02:42:34,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-09 02:42:34,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 55 transitions. [2018-12-09 02:42:34,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,622 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-12-09 02:42:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 55 transitions. [2018-12-09 02:42:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-12-09 02:42:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 02:42:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2018-12-09 02:42:34,623 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-12-09 02:42:34,623 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-12-09 02:42:34,623 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 02:42:34,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2018-12-09 02:42:34,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 02:42:34,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:34,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:34,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-12-09 02:42:34,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:34,624 INFO L794 eck$LassoCheckResult]: Stem: 480#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; 481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 485#L12 assume !(10 == main_~i~0); 501#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 500#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 487#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2018-12-09 02:42:34,624 INFO L796 eck$LassoCheckResult]: Loop: 476#L12-2 assume !(0 == main_~i~0); 477#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 511#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 509#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2018-12-09 02:42:34,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2018-12-09 02:42:34,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,633 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-09 02:42:34,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:34,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:42:34,634 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:34,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2018-12-09 02:42:34,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:34,652 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:34,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:34,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:34,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:34,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:34,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:34,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:34,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:34,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration6_Loop [2018-12-09 02:42:34,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:34,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:34,654 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-09 02:42:34,657 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-09 02:42:34,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-09 02:42:34,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-09 02:42:34,694 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:34,694 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,696 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,698 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,698 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,727 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:34,727 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,730 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:34,730 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:34,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:34,746 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:34,832 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:34,833 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:34,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:34,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:34,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:34,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:34,833 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:34,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:34,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:34,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration6_Loop [2018-12-09 02:42:34,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:34,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:34,834 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-09 02:42:34,838 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-09 02:42:34,840 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-09 02:42:34,842 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-09 02:42:34,879 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:34,879 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:34,879 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-09 02:42:34,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:34,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,880 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:42:34,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 02:42:34,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:34,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:34,882 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-09 02:42:34,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:34,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:34,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:34,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:34,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:34,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:34,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:34,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:34,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:34,896 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 02:42:34,897 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:34,897 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:34,897 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:34,897 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-09 02:42:34,898 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:34,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:34,929 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-09 02:42:34,930 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-09 02:42:34,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-12-09 02:42:34,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 93 states and 141 transitions. Complement of second has 7 states. [2018-12-09 02:42:34,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-09 02:42:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 02:42:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 02:42:34,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-09 02:42:34,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-09 02:42:34,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2018-12-09 02:42:34,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:34,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 141 transitions. [2018-12-09 02:42:34,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-12-09 02:42:34,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 78 states and 116 transitions. [2018-12-09 02:42:34,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-12-09 02:42:34,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-12-09 02:42:34,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 116 transitions. [2018-12-09 02:42:34,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,949 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 116 transitions. [2018-12-09 02:42:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 116 transitions. [2018-12-09 02:42:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-12-09 02:42:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 02:42:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2018-12-09 02:42:34,952 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2018-12-09 02:42:34,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:34,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:34,952 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand 4 states. [2018-12-09 02:42:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:34,967 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-12-09 02:42:34,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:34,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 146 transitions. [2018-12-09 02:42:34,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-12-09 02:42:34,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 146 transitions. [2018-12-09 02:42:34,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-12-09 02:42:34,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-12-09 02:42:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 146 transitions. [2018-12-09 02:42:34,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,969 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 146 transitions. [2018-12-09 02:42:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 146 transitions. [2018-12-09 02:42:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-12-09 02:42:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 02:42:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2018-12-09 02:42:34,973 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-12-09 02:42:34,973 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-12-09 02:42:34,973 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 02:42:34,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 140 transitions. [2018-12-09 02:42:34,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-12-09 02:42:34,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:34,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:34,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-09 02:42:34,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:34,974 INFO L794 eck$LassoCheckResult]: Stem: 849#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; 850#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 875#L12 assume !(10 == main_~i~0); 872#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 873#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 869#L12 assume !(10 == main_~i~0); 923#L12-2 assume !(0 == main_~i~0); 922#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2018-12-09 02:42:34,974 INFO L796 eck$LassoCheckResult]: Loop: 910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 921#L12 assume !(10 == main_~i~0); 919#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 917#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2018-12-09 02:42:34,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash -760725578, now seen corresponding path program 1 times [2018-12-09 02:42:34,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 02:42:34,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:34,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:42:34,985 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:34,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:34,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2018-12-09 02:42:34,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:34,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:34,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:34,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:34,990 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-09 02:42:34,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:42:34,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 02:42:34,990 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:34,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:42:34,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:42:34,991 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. cyclomatic complexity: 51 Second operand 3 states. [2018-12-09 02:42:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:34,994 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-12-09 02:42:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:42:34,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-12-09 02:42:34,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 02:42:34,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 51 states and 63 transitions. [2018-12-09 02:42:34,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-09 02:42:34,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-09 02:42:34,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-12-09 02:42:34,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:34,996 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-12-09 02:42:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-12-09 02:42:34,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-12-09 02:42:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 02:42:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-12-09 02:42:34,998 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-09 02:42:34,998 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-09 02:42:34,999 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 02:42:34,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-12-09 02:42:34,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-09 02:42:34,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:34,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:34,999 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-12-09 02:42:35,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-09 02:42:35,000 INFO L794 eck$LassoCheckResult]: Stem: 1019#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; 1020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1050#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1055#L12-2 assume !(0 == main_~i~0); 1030#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1031#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1048#L12 assume !(10 == main_~i~0); 1044#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1045#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1038#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1039#L12 assume !(10 == main_~i~0); 1034#L12-2 assume !(0 == main_~i~0); 1035#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1040#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1041#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2018-12-09 02:42:35,000 INFO L796 eck$LassoCheckResult]: Loop: 1057#L12-2 assume !(0 == main_~i~0); 1028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1029#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1058#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2018-12-09 02:42:35,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 1 times [2018-12-09 02:42:35,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,015 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-09 02:42:35,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,029 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-09 02:42:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-09 02:42:35,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:35,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2018-12-09 02:42:35,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:35,068 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:35,069 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:35,069 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:35,069 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:35,069 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:35,069 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:35,069 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:35,069 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:35,069 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration8_Loop [2018-12-09 02:42:35,069 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:35,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:35,070 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-09 02:42:35,074 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-09 02:42:35,077 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-09 02:42:35,078 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-09 02:42:35,107 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:35,107 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:35,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:35,108 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:35,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:35,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:35,210 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:35,212 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:35,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:35,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:35,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:35,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:35,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:35,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:35,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:35,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration8_Loop [2018-12-09 02:42:35,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:35,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:35,213 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-09 02:42:35,216 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-09 02:42:35,217 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-09 02:42:35,220 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-09 02:42:35,258 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:35,258 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:35,258 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-09 02:42:35,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:35,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:35,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:35,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:35,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:35,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:35,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:35,260 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:35,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:35,261 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 02:42:35,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:35,261 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:35,261 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:35,261 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-09 02:42:35,262 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:35,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,285 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-09 02:42:35,285 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-09 02:42:35,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-12-09 02:42:35,300 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 59 states and 75 transitions. Complement of second has 7 states. [2018-12-09 02:42:35,301 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-09 02:42:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 02:42:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-09 02:42:35,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 02:42:35,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:35,301 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:42:35,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,333 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-09 02:42:35,333 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-09 02:42:35,333 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-12-09 02:42:35,356 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 81 states and 96 transitions. Complement of second has 9 states. [2018-12-09 02:42:35,356 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-09 02:42:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 02:42:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-09 02:42:35,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 02:42:35,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:35,356 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 02:42:35,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,381 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-09 02:42:35,381 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-09 02:42:35,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-12-09 02:42:35,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2018-12-09 02:42:35,397 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-09 02:42:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 02:42:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-09 02:42:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-12-09 02:42:35,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:35,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-09 02:42:35,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:35,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2018-12-09 02:42:35,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:35,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2018-12-09 02:42:35,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-09 02:42:35,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2018-12-09 02:42:35,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 02:42:35,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-09 02:42:35,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-12-09 02:42:35,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:35,401 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-12-09 02:42:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-12-09 02:42:35,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-12-09 02:42:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 02:42:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-09 02:42:35,403 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-09 02:42:35,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:42:35,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:42:35,404 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2018-12-09 02:42:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:35,425 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-09 02:42:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:42:35,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-12-09 02:42:35,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-12-09 02:42:35,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2018-12-09 02:42:35,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-09 02:42:35,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 02:42:35,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-12-09 02:42:35,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:35,427 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-12-09 02:42:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-12-09 02:42:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-12-09 02:42:35,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 02:42:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-12-09 02:42:35,428 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-09 02:42:35,428 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-09 02:42:35,428 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-09 02:42:35,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-12-09 02:42:35,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-09 02:42:35,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:35,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:35,429 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-09 02:42:35,429 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2018-12-09 02:42:35,430 INFO L794 eck$LassoCheckResult]: Stem: 1606#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; 1607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1612#L12 assume !(10 == main_~i~0); 1613#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1615#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1608#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1609#L12 assume !(10 == main_~i~0); 1633#L12-2 assume !(0 == main_~i~0); 1632#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1631#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1621#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2018-12-09 02:42:35,430 INFO L796 eck$LassoCheckResult]: Loop: 1602#L12-2 assume !(0 == main_~i~0); 1603#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1636#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1635#L12 assume !(10 == main_~i~0); 1624#L12-2 assume !(0 == main_~i~0); 1629#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1627#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1622#L12 assume !(10 == main_~i~0); 1625#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1628#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1626#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1619#L12 assume !(10 == main_~i~0); 1617#L12-2 assume !(0 == main_~i~0); 1618#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1620#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2018-12-09 02:42:35,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2018-12-09 02:42:35,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,446 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-09 02:42:35,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,446 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,457 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-09 02:42:35,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-09 02:42:35,472 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:35,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2018-12-09 02:42:35,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,489 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-09 02:42:35,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,500 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-09 02:42:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-12-09 02:42:35,515 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:35,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:35,516 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-12-09 02:42:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:35,531 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-12-09 02:42:35,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:35,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-12-09 02:42:35,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-09 02:42:35,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2018-12-09 02:42:35,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-09 02:42:35,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-12-09 02:42:35,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2018-12-09 02:42:35,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:35,533 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-12-09 02:42:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2018-12-09 02:42:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-12-09 02:42:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 02:42:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-12-09 02:42:35,534 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-12-09 02:42:35,534 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-12-09 02:42:35,534 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-09 02:42:35,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2018-12-09 02:42:35,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-09 02:42:35,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:35,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:35,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2018-12-09 02:42:35,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2018-12-09 02:42:35,535 INFO L794 eck$LassoCheckResult]: Stem: 1776#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; 1777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1793#L12 assume !(10 == main_~i~0); 1794#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1809#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1806#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1807#L12 assume !(10 == main_~i~0); 1813#L12-2 assume !(0 == main_~i~0); 1812#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1780#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1781#L12 assume !(10 == main_~i~0); 1774#L12-2 assume !(0 == main_~i~0); 1775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1808#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2018-12-09 02:42:35,535 INFO L796 eck$LassoCheckResult]: Loop: 1772#L12-2 assume !(0 == main_~i~0); 1773#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1803#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1801#L12 assume !(10 == main_~i~0); 1792#L12-2 assume !(0 == main_~i~0); 1798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1790#L12 assume !(10 == main_~i~0); 1787#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1788#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1779#L12 assume !(10 == main_~i~0); 1814#L12-2 assume !(0 == main_~i~0); 1784#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1782#L12 assume !(10 == main_~i~0); 1783#L12-2 assume !(0 == main_~i~0); 1789#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1810#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1811#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2018-12-09 02:42:35,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,535 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2018-12-09 02:42:35,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:35,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,557 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-09 02:42:35,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:35,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 02:42:35,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 02:42:35,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:35,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,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-09 02:42:35,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 02:42:35,586 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:35,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2018-12-09 02:42:35,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,607 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-09 02:42:35,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 02:42:35,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 02:42:35,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:35,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,621 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-09 02:42:35,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 02:42:35,636 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:35,636 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-12-09 02:42:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:35,666 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-12-09 02:42:35,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:35,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2018-12-09 02:42:35,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-09 02:42:35,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2018-12-09 02:42:35,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-09 02:42:35,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-09 02:42:35,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2018-12-09 02:42:35,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:35,668 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-09 02:42:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2018-12-09 02:42:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-12-09 02:42:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-09 02:42:35,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-12-09 02:42:35,670 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-12-09 02:42:35,670 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-12-09 02:42:35,670 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-09 02:42:35,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2018-12-09 02:42:35,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-09 02:42:35,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:35,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:35,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2018-12-09 02:42:35,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2018-12-09 02:42:35,672 INFO L794 eck$LassoCheckResult]: Stem: 1988#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; 1989#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1999#L12 assume !(10 == main_~i~0); 2000#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2018#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2015#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2016#L12 assume !(10 == main_~i~0); 2023#L12-2 assume !(0 == main_~i~0); 2024#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2028#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2026#L12 assume !(10 == main_~i~0); 2027#L12-2 assume !(0 == main_~i~0); 1996#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1993#L12 assume !(10 == main_~i~0); 1986#L12-2 assume !(0 == main_~i~0); 1987#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2019#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2017#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2018-12-09 02:42:35,672 INFO L796 eck$LassoCheckResult]: Loop: 1984#L12-2 assume !(0 == main_~i~0); 1985#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2011#L12 assume !(10 == main_~i~0); 2003#L12-2 assume !(0 == main_~i~0); 2008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2006#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2001#L12 assume !(10 == main_~i~0); 1997#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1995#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1990#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1991#L12 assume !(10 == main_~i~0); 1994#L12-2 assume !(0 == main_~i~0); 1998#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2034#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2033#L12 assume !(10 == main_~i~0); 2032#L12-2 assume !(0 == main_~i~0); 2031#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2030#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2029#L12 assume !(10 == main_~i~0); 2025#L12-2 assume !(0 == main_~i~0); 2022#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2021#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2018-12-09 02:42:35,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2018-12-09 02:42:35,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,696 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-09 02:42:35,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,696 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:42:35,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 02:42:35,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:35,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,709 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-09 02:42:35,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 02:42:35,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:35,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2018-12-09 02:42:35,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,741 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-09 02:42:35,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:42:35,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-09 02:42:35,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:35,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,757 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-09 02:42:35,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 02:42:35,772 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:35,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:35,772 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-12-09 02:42:35,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:35,805 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-12-09 02:42:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:35,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-12-09 02:42:35,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-12-09 02:42:35,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2018-12-09 02:42:35,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-09 02:42:35,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-09 02:42:35,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2018-12-09 02:42:35,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:35,807 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-12-09 02:42:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2018-12-09 02:42:35,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-12-09 02:42:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 02:42:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-12-09 02:42:35,808 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-12-09 02:42:35,808 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-12-09 02:42:35,808 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-09 02:42:35,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2018-12-09 02:42:35,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-12-09 02:42:35,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:35,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:35,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2018-12-09 02:42:35,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2018-12-09 02:42:35,809 INFO L794 eck$LassoCheckResult]: Stem: 2242#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; 2243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2254#L12 assume !(10 == main_~i~0); 2255#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2270#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2271#L12 assume !(10 == main_~i~0); 2296#L12-2 assume !(0 == main_~i~0); 2295#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2246#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2247#L12 assume !(10 == main_~i~0); 2240#L12-2 assume !(0 == main_~i~0); 2241#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2294#L12 assume !(10 == main_~i~0); 2293#L12-2 assume !(0 == main_~i~0); 2292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2275#L12 assume !(10 == main_~i~0); 2280#L12-2 assume !(0 == main_~i~0); 2278#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2018-12-09 02:42:35,809 INFO L796 eck$LassoCheckResult]: Loop: 2238#L12-2 assume !(0 == main_~i~0); 2239#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2266#L12 assume !(10 == main_~i~0); 2258#L12-2 assume !(0 == main_~i~0); 2263#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2256#L12 assume !(10 == main_~i~0); 2252#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2253#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2244#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2245#L12 assume !(10 == main_~i~0); 2248#L12-2 assume !(0 == main_~i~0); 2249#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2290#L12 assume !(10 == main_~i~0); 2289#L12-2 assume !(0 == main_~i~0); 2288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2286#L12 assume !(10 == main_~i~0); 2285#L12-2 assume !(0 == main_~i~0); 2284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2282#L12 assume !(10 == main_~i~0); 2281#L12-2 assume !(0 == main_~i~0); 2279#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2277#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2018-12-09 02:42:35,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2018-12-09 02:42:35,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,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-09 02:42:35,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:42:35,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:42:35,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:35,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,850 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-09 02:42:35,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 02:42:35,864 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:35,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2018-12-09 02:42:35,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,892 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-09 02:42:35,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:35,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:42:35,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:42:35,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:35,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:35,908 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-09 02:42:35,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:35,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 02:42:35,924 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:42:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:35,925 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-12-09 02:42:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:35,951 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-12-09 02:42:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:35,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-12-09 02:42:35,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-12-09 02:42:35,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2018-12-09 02:42:35,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-09 02:42:35,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-12-09 02:42:35,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-12-09 02:42:35,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:35,952 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-12-09 02:42:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-12-09 02:42:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-12-09 02:42:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 02:42:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-12-09 02:42:35,954 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-12-09 02:42:35,954 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-12-09 02:42:35,954 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-09 02:42:35,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2018-12-09 02:42:35,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-12-09 02:42:35,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:35,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:35,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2018-12-09 02:42:35,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2018-12-09 02:42:35,955 INFO L794 eck$LassoCheckResult]: Stem: 2538#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; 2539#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2550#L12 assume !(10 == main_~i~0); 2551#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2569#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2566#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2567#L12 assume !(10 == main_~i~0); 2600#L12-2 assume !(0 == main_~i~0); 2599#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2542#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2543#L12 assume !(10 == main_~i~0); 2536#L12-2 assume !(0 == main_~i~0); 2537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2598#L12 assume !(10 == main_~i~0); 2597#L12-2 assume !(0 == main_~i~0); 2596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2594#L12 assume !(10 == main_~i~0); 2593#L12-2 assume !(0 == main_~i~0); 2592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2591#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2573#L12 assume !(10 == main_~i~0); 2577#L12-2 assume !(0 == main_~i~0); 2575#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2572#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2568#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2018-12-09 02:42:35,955 INFO L796 eck$LassoCheckResult]: Loop: 2534#L12-2 assume !(0 == main_~i~0); 2535#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2562#L12 assume !(10 == main_~i~0); 2554#L12-2 assume !(0 == main_~i~0); 2559#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2557#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2552#L12 assume !(10 == main_~i~0); 2548#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2541#L12 assume !(10 == main_~i~0); 2544#L12-2 assume !(0 == main_~i~0); 2545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2590#L12 assume !(10 == main_~i~0); 2589#L12-2 assume !(0 == main_~i~0); 2588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2587#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2586#L12 assume !(10 == main_~i~0); 2585#L12-2 assume !(0 == main_~i~0); 2584#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2583#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2582#L12 assume !(10 == main_~i~0); 2581#L12-2 assume !(0 == main_~i~0); 2580#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2579#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2578#L12 assume !(10 == main_~i~0); 2576#L12-2 assume !(0 == main_~i~0); 2574#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2570#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2571#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2018-12-09 02:42:35,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:35,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2018-12-09 02:42:35,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:35,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:35,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:35,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:35,988 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-09 02:42:35,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:35,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:35,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 02:42:36,006 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-09 02:42:36,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,010 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-09 02:42:36,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 02:42:36,026 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:36,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2018-12-09 02:42:36,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,059 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-09 02:42:36,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,068 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 02:42:36,076 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-09 02:42:36,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,080 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-09 02:42:36,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 02:42:36,100 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:36,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:42:36,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:42:36,100 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-12-09 02:42:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:36,130 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-12-09 02:42:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:36,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-12-09 02:42:36,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-12-09 02:42:36,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2018-12-09 02:42:36,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-12-09 02:42:36,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-09 02:42:36,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-12-09 02:42:36,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:36,131 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-12-09 02:42:36,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-12-09 02:42:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-12-09 02:42:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 02:42:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-12-09 02:42:36,132 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-12-09 02:42:36,132 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-12-09 02:42:36,132 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-09 02:42:36,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2018-12-09 02:42:36,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-12-09 02:42:36,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:36,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:36,133 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2018-12-09 02:42:36,133 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2018-12-09 02:42:36,134 INFO L794 eck$LassoCheckResult]: Stem: 2876#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; 2877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2892#L12 assume !(10 == main_~i~0); 2893#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2905#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2906#L12 assume !(10 == main_~i~0); 2946#L12-2 assume !(0 == main_~i~0); 2945#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2881#L12 assume !(10 == main_~i~0); 2874#L12-2 assume !(0 == main_~i~0); 2875#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2944#L12 assume !(10 == main_~i~0); 2943#L12-2 assume !(0 == main_~i~0); 2942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2940#L12 assume !(10 == main_~i~0); 2939#L12-2 assume !(0 == main_~i~0); 2938#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2937#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2936#L12 assume !(10 == main_~i~0); 2935#L12-2 assume !(0 == main_~i~0); 2934#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2933#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2912#L12 assume !(10 == main_~i~0); 2916#L12-2 assume !(0 == main_~i~0); 2914#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2907#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2018-12-09 02:42:36,134 INFO L796 eck$LassoCheckResult]: Loop: 2872#L12-2 assume !(0 == main_~i~0); 2873#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2900#L12 assume !(10 == main_~i~0); 2891#L12-2 assume !(0 == main_~i~0); 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2894#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2889#L12 assume !(10 == main_~i~0); 2886#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2883#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2932#L12 assume !(10 == main_~i~0); 2887#L12-2 assume !(0 == main_~i~0); 2888#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2879#L12 assume !(10 == main_~i~0); 2882#L12-2 assume !(0 == main_~i~0); 2931#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2930#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2929#L12 assume !(10 == main_~i~0); 2928#L12-2 assume !(0 == main_~i~0); 2927#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2926#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2925#L12 assume !(10 == main_~i~0); 2924#L12-2 assume !(0 == main_~i~0); 2923#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2921#L12 assume !(10 == main_~i~0); 2920#L12-2 assume !(0 == main_~i~0); 2919#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2917#L12 assume !(10 == main_~i~0); 2915#L12-2 assume !(0 == main_~i~0); 2913#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2909#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2910#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2018-12-09 02:42:36,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2018-12-09 02:42:36,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,174 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-09 02:42:36,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 02:42:36,188 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-09 02:42:36,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,194 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-09 02:42:36,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 02:42:36,210 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:36,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2018-12-09 02:42:36,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,265 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-09 02:42:36,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,266 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,275 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 02:42:36,288 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-12-09 02:42:36,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,296 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-09 02:42:36,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 02:42:36,311 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 02:42:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:42:36,312 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2018-12-09 02:42:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:36,364 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-12-09 02:42:36,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:42:36,365 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2018-12-09 02:42:36,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-12-09 02:42:36,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2018-12-09 02:42:36,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-12-09 02:42:36,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-12-09 02:42:36,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2018-12-09 02:42:36,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:36,366 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-12-09 02:42:36,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2018-12-09 02:42:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-12-09 02:42:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 02:42:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-12-09 02:42:36,367 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-12-09 02:42:36,367 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-12-09 02:42:36,367 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-09 02:42:36,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2018-12-09 02:42:36,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-12-09 02:42:36,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:36,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:36,368 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2018-12-09 02:42:36,368 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2018-12-09 02:42:36,368 INFO L794 eck$LassoCheckResult]: Stem: 3256#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; 3257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3272#L12 assume !(10 == main_~i~0); 3273#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3287#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3263#L12 assume !(10 == main_~i~0); 3254#L12-2 assume !(0 == main_~i~0); 3255#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3261#L12 assume !(10 == main_~i~0); 3334#L12-2 assume !(0 == main_~i~0); 3333#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3332#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3331#L12 assume !(10 == main_~i~0); 3330#L12-2 assume !(0 == main_~i~0); 3329#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3327#L12 assume !(10 == main_~i~0); 3326#L12-2 assume !(0 == main_~i~0); 3325#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3324#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3323#L12 assume !(10 == main_~i~0); 3322#L12-2 assume !(0 == main_~i~0); 3321#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3320#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3319#L12 assume !(10 == main_~i~0); 3318#L12-2 assume !(0 == main_~i~0); 3317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3316#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3291#L12 assume !(10 == main_~i~0); 3295#L12-2 assume !(0 == main_~i~0); 3293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3290#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3286#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2018-12-09 02:42:36,369 INFO L796 eck$LassoCheckResult]: Loop: 3252#L12-2 assume !(0 == main_~i~0); 3253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3282#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3280#L12 assume !(10 == main_~i~0); 3271#L12-2 assume !(0 == main_~i~0); 3277#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3269#L12 assume !(10 == main_~i~0); 3266#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3315#L12 assume !(10 == main_~i~0); 3267#L12-2 assume !(0 == main_~i~0); 3268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3259#L12 assume !(10 == main_~i~0); 3262#L12-2 assume !(0 == main_~i~0); 3314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3312#L12 assume !(10 == main_~i~0); 3311#L12-2 assume !(0 == main_~i~0); 3310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3308#L12 assume !(10 == main_~i~0); 3307#L12-2 assume !(0 == main_~i~0); 3306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3304#L12 assume !(10 == main_~i~0); 3303#L12-2 assume !(0 == main_~i~0); 3302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3300#L12 assume !(10 == main_~i~0); 3299#L12-2 assume !(0 == main_~i~0); 3298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3296#L12 assume !(10 == main_~i~0); 3294#L12-2 assume !(0 == main_~i~0); 3292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3289#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2018-12-09 02:42:36,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,369 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2018-12-09 02:42:36,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,418 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-09 02:42:36,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,418 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,442 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-09 02:42:36,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-09 02:42:36,463 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:36,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2018-12-09 02:42:36,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,513 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-09 02:42:36,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,513 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,533 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-09 02:42:36,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-09 02:42:36,548 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:42:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:42:36,549 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-12-09 02:42:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:36,593 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-12-09 02:42:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:42:36,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2018-12-09 02:42:36,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-12-09 02:42:36,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2018-12-09 02:42:36,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-12-09 02:42:36,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-12-09 02:42:36,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2018-12-09 02:42:36,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:36,594 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-09 02:42:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2018-12-09 02:42:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-12-09 02:42:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-09 02:42:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-12-09 02:42:36,595 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-12-09 02:42:36,595 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-12-09 02:42:36,595 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-09 02:42:36,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2018-12-09 02:42:36,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-12-09 02:42:36,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:36,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:36,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2018-12-09 02:42:36,596 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2018-12-09 02:42:36,597 INFO L794 eck$LassoCheckResult]: Stem: 3678#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; 3679#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3693#L12 assume !(10 == main_~i~0); 3694#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3706#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3685#L12 assume !(10 == main_~i~0); 3676#L12-2 assume !(0 == main_~i~0); 3677#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3682#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3683#L12 assume !(10 == main_~i~0); 3764#L12-2 assume !(0 == main_~i~0); 3763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3761#L12 assume !(10 == main_~i~0); 3760#L12-2 assume !(0 == main_~i~0); 3759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3758#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3757#L12 assume !(10 == main_~i~0); 3756#L12-2 assume !(0 == main_~i~0); 3755#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3754#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3753#L12 assume !(10 == main_~i~0); 3752#L12-2 assume !(0 == main_~i~0); 3751#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3749#L12 assume !(10 == main_~i~0); 3748#L12-2 assume !(0 == main_~i~0); 3747#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3745#L12 assume !(10 == main_~i~0); 3744#L12-2 assume !(0 == main_~i~0); 3743#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3742#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3710#L12 assume !(10 == main_~i~0); 3715#L12-2 assume !(0 == main_~i~0); 3713#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3707#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2018-12-09 02:42:36,597 INFO L796 eck$LassoCheckResult]: Loop: 3674#L12-2 assume !(0 == main_~i~0); 3675#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3703#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3701#L12 assume !(10 == main_~i~0); 3692#L12-2 assume !(0 == main_~i~0); 3698#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3695#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3690#L12 assume !(10 == main_~i~0); 3688#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3689#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3680#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3681#L12 assume !(10 == main_~i~0); 3684#L12-2 assume !(0 == main_~i~0); 3686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3687#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3741#L12 assume !(10 == main_~i~0); 3740#L12-2 assume !(0 == main_~i~0); 3739#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3738#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3737#L12 assume !(10 == main_~i~0); 3736#L12-2 assume !(0 == main_~i~0); 3735#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3733#L12 assume !(10 == main_~i~0); 3732#L12-2 assume !(0 == main_~i~0); 3731#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3729#L12 assume !(10 == main_~i~0); 3728#L12-2 assume !(0 == main_~i~0); 3727#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3726#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3725#L12 assume !(10 == main_~i~0); 3724#L12-2 assume !(0 == main_~i~0); 3723#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3722#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3721#L12 assume !(10 == main_~i~0); 3720#L12-2 assume !(0 == main_~i~0); 3719#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3718#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3717#L12 assume !(10 == main_~i~0); 3716#L12-2 assume !(0 == main_~i~0); 3714#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3711#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3712#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2018-12-09 02:42:36,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2018-12-09 02:42:36,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:36,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,651 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-09 02:42:36,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 02:42:36,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 02:42:36,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,670 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-09 02:42:36,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 02:42:36,694 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 02:42:36,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2018-12-09 02:42:36,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,748 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-09 02:42:36,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,748 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 02:42:36,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 02:42:36,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,768 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-09 02:42:36,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 02:42:36,784 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 02:42:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 02:42:36,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:42:36,784 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2018-12-09 02:42:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:36,820 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-12-09 02:42:36,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:42:36,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 113 transitions. [2018-12-09 02:42:36,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-12-09 02:42:36,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 112 transitions. [2018-12-09 02:42:36,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-12-09 02:42:36,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-12-09 02:42:36,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 112 transitions. [2018-12-09 02:42:36,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:36,822 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-12-09 02:42:36,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 112 transitions. [2018-12-09 02:42:36,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-12-09 02:42:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 02:42:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-12-09 02:42:36,824 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-09 02:42:36,824 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-12-09 02:42:36,824 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-09 02:42:36,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 107 transitions. [2018-12-09 02:42:36,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-12-09 02:42:36,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:36,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:36,826 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:36,826 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2018-12-09 02:42:36,826 INFO L794 eck$LassoCheckResult]: Stem: 4142#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; 4143#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4154#L12 assume !(10 == main_~i~0); 4155#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4170#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4149#L12 assume !(10 == main_~i~0); 4140#L12-2 assume !(0 == main_~i~0); 4141#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4146#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4147#L12 assume !(10 == main_~i~0); 4236#L12-2 assume !(0 == main_~i~0); 4235#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4234#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4233#L12 assume !(10 == main_~i~0); 4232#L12-2 assume !(0 == main_~i~0); 4231#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4229#L12 assume !(10 == main_~i~0); 4228#L12-2 assume !(0 == main_~i~0); 4227#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4226#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4225#L12 assume !(10 == main_~i~0); 4224#L12-2 assume !(0 == main_~i~0); 4223#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4222#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4221#L12 assume !(10 == main_~i~0); 4220#L12-2 assume !(0 == main_~i~0); 4219#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4218#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4217#L12 assume !(10 == main_~i~0); 4216#L12-2 assume !(0 == main_~i~0); 4215#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4214#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4213#L12 assume !(10 == main_~i~0); 4212#L12-2 assume !(0 == main_~i~0); 4211#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4210#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4174#L12 assume !(10 == main_~i~0); 4179#L12-2 assume !(0 == main_~i~0); 4177#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4171#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2018-12-09 02:42:36,826 INFO L796 eck$LassoCheckResult]: Loop: 4138#L12-2 assume !(0 == main_~i~0); 4139#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4168#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4166#L12 assume !(10 == main_~i~0); 4158#L12-2 assume !(0 == main_~i~0); 4163#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4161#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4156#L12 assume !(10 == main_~i~0); 4152#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4153#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4144#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4145#L12 assume !(10 == main_~i~0); 4148#L12-2 assume !(0 == main_~i~0); 4150#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4151#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4209#L12 assume !(10 == main_~i~0); 4208#L12-2 assume !(0 == main_~i~0); 4207#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4205#L12 assume !(10 == main_~i~0); 4204#L12-2 assume !(0 == main_~i~0); 4203#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4202#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4201#L12 assume !(10 == main_~i~0); 4200#L12-2 assume !(0 == main_~i~0); 4199#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4198#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4197#L12 assume !(10 == main_~i~0); 4196#L12-2 assume !(0 == main_~i~0); 4195#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4194#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4193#L12 assume !(10 == main_~i~0); 4192#L12-2 assume !(0 == main_~i~0); 4191#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4190#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4189#L12 assume !(10 == main_~i~0); 4188#L12-2 assume !(0 == main_~i~0); 4187#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4185#L12 assume !(10 == main_~i~0); 4184#L12-2 assume !(0 == main_~i~0); 4183#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4182#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4181#L12 assume !(10 == main_~i~0); 4180#L12-2 assume !(0 == main_~i~0); 4178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4175#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4176#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2018-12-09 02:42:36,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,826 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2018-12-09 02:42:36,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:36,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2018-12-09 02:42:36,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:36,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 2 times [2018-12-09 02:42:36,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:36,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:36,872 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-09 02:42:36,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:36,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:36,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 02:42:36,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 02:42:36,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:36,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:36,896 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-09 02:42:36,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:36,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 02:42:37,028 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2018-12-09 02:42:37,037 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:37,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:37,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:37,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:37,037 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:37,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:37,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:37,037 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration17_Loop [2018-12-09 02:42:37,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:37,037 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:37,038 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-09 02:42:37,044 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-09 02:42:37,045 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-09 02:42:37,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:37,086 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:37,086 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:37,088 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:37,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:37,126 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:37,127 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:37,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:37,127 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:37,127 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:37,127 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:37,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:37,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:37,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration17_Loop [2018-12-09 02:42:37,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:37,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:37,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-09 02:42:37,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-09 02:42:37,136 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-09 02:42:37,138 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-09 02:42:37,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:37,172 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:37,172 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-09 02:42:37,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:37,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:37,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:37,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:37,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:37,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:37,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:37,174 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:37,175 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:37,175 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:37,175 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:37,175 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:37,175 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:37,175 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-09 02:42:37,175 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:37,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:37,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:37,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:37,209 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-09 02:42:37,210 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-09 02:42:37,210 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-12-09 02:42:37,272 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 367 states and 394 transitions. Complement of second has 15 states. [2018-12-09 02:42:37,273 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-09 02:42:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 02:42:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-12-09 02:42:37,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2018-12-09 02:42:37,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:37,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2018-12-09 02:42:37,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:37,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2018-12-09 02:42:37,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:37,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 394 transitions. [2018-12-09 02:42:37,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-12-09 02:42:37,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 330 states and 354 transitions. [2018-12-09 02:42:37,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-12-09 02:42:37,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:37,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 354 transitions. [2018-12-09 02:42:37,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:37,279 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 354 transitions. [2018-12-09 02:42:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 354 transitions. [2018-12-09 02:42:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 306. [2018-12-09 02:42:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-09 02:42:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 327 transitions. [2018-12-09 02:42:37,284 INFO L728 BuchiCegarLoop]: Abstraction has 306 states and 327 transitions. [2018-12-09 02:42:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:42:37,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:42:37,284 INFO L87 Difference]: Start difference. First operand 306 states and 327 transitions. Second operand 5 states. [2018-12-09 02:42:37,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:37,301 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-12-09 02:42:37,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:42:37,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 208 transitions. [2018-12-09 02:42:37,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-12-09 02:42:37,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 172 states and 189 transitions. [2018-12-09 02:42:37,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:37,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:37,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 189 transitions. [2018-12-09 02:42:37,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:37,303 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-12-09 02:42:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 189 transitions. [2018-12-09 02:42:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 107. [2018-12-09 02:42:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 02:42:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-12-09 02:42:37,305 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-12-09 02:42:37,305 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-12-09 02:42:37,305 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-09 02:42:37,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 117 transitions. [2018-12-09 02:42:37,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2018-12-09 02:42:37,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:37,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:37,307 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:37,307 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2018-12-09 02:42:37,307 INFO L794 eck$LassoCheckResult]: Stem: 5692#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; 5693#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5704#L12 assume !(10 == main_~i~0); 5702#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5701#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5694#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5695#L12 assume !(10 == main_~i~0); 5792#L12-2 assume !(0 == main_~i~0); 5791#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5790#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5789#L12 assume !(10 == main_~i~0); 5788#L12-2 assume !(0 == main_~i~0); 5787#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5785#L12 assume !(10 == main_~i~0); 5784#L12-2 assume !(0 == main_~i~0); 5783#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5782#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5781#L12 assume !(10 == main_~i~0); 5780#L12-2 assume !(0 == main_~i~0); 5779#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5777#L12 assume !(10 == main_~i~0); 5776#L12-2 assume !(0 == main_~i~0); 5775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5774#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5773#L12 assume !(10 == main_~i~0); 5772#L12-2 assume !(0 == main_~i~0); 5771#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5769#L12 assume !(10 == main_~i~0); 5768#L12-2 assume !(0 == main_~i~0); 5767#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5766#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5765#L12 assume !(10 == main_~i~0); 5764#L12-2 assume !(0 == main_~i~0); 5763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5722#L12 assume !(10 == main_~i~0); 5760#L12-2 assume !(0 == main_~i~0); 5759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5711#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2018-12-09 02:42:37,307 INFO L796 eck$LassoCheckResult]: Loop: 5688#L12-2 assume !(0 == main_~i~0); 5689#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5720#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5719#L12 assume !(10 == main_~i~0); 5718#L12-2 assume !(0 == main_~i~0); 5717#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5715#L12 assume !(10 == main_~i~0); 5708#L12-2 assume !(0 == main_~i~0); 5710#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5705#L12 assume !(10 == main_~i~0); 5707#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5758#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5756#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5698#L12 assume !(10 == main_~i~0); 5699#L12-2 assume !(0 == main_~i~0); 5703#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5755#L12 assume !(10 == main_~i~0); 5754#L12-2 assume !(0 == main_~i~0); 5753#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5751#L12 assume !(10 == main_~i~0); 5750#L12-2 assume !(0 == main_~i~0); 5749#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5748#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5747#L12 assume !(10 == main_~i~0); 5746#L12-2 assume !(0 == main_~i~0); 5745#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5744#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5743#L12 assume !(10 == main_~i~0); 5742#L12-2 assume !(0 == main_~i~0); 5741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5740#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5739#L12 assume !(10 == main_~i~0); 5738#L12-2 assume !(0 == main_~i~0); 5737#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5735#L12 assume !(10 == main_~i~0); 5734#L12-2 assume !(0 == main_~i~0); 5733#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5732#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5731#L12 assume !(10 == main_~i~0); 5730#L12-2 assume !(0 == main_~i~0); 5729#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5728#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5727#L12 assume !(10 == main_~i~0); 5726#L12-2 assume !(0 == main_~i~0); 5725#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5724#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2018-12-09 02:42:37,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,307 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2018-12-09 02:42:37,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:37,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:37,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:37,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2018-12-09 02:42:37,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:37,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:37,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 3 times [2018-12-09 02:42:37,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:37,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:37,364 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-09 02:42:37,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:37,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:42:37,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-09 02:42:37,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:37,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:37,398 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-09 02:42:37,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:37,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 02:42:37,546 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 52 [2018-12-09 02:42:37,550 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:37,550 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:37,550 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:37,550 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:37,550 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:37,550 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,550 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:37,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:37,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration18_Loop [2018-12-09 02:42:37,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:37,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:37,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-09 02:42:37,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-09 02:42:37,557 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-09 02:42:37,560 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-09 02:42:37,584 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:37,584 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:37,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:37,601 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:37,601 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:37,604 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:37,620 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:37,622 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:37,635 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:37,635 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:37,635 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:37,635 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:37,635 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:37,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:37,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:37,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:37,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration18_Loop [2018-12-09 02:42:37,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:37,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:37,636 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-09 02:42:37,638 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-09 02:42:37,640 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-09 02:42:37,641 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-09 02:42:37,673 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:37,674 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:37,674 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-09 02:42:37,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:37,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:37,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:37,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:37,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:37,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:37,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:37,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:37,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:37,677 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:37,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:37,677 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:37,678 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:37,678 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-09 02:42:37,678 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:37,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:37,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:37,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:37,772 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-09 02:42:37,772 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-09 02:42:37,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-12-09 02:42:37,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 431 states and 470 transitions. Complement of second has 19 states. [2018-12-09 02:42:37,940 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-09 02:42:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-09 02:42:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-12-09 02:42:37,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2018-12-09 02:42:37,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:37,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2018-12-09 02:42:37,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:37,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2018-12-09 02:42:37,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:37,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 470 transitions. [2018-12-09 02:42:37,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-12-09 02:42:37,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 366 states and 398 transitions. [2018-12-09 02:42:37,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-12-09 02:42:37,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:37,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 398 transitions. [2018-12-09 02:42:37,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:37,947 INFO L705 BuchiCegarLoop]: Abstraction has 366 states and 398 transitions. [2018-12-09 02:42:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 398 transitions. [2018-12-09 02:42:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 314. [2018-12-09 02:42:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-09 02:42:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 337 transitions. [2018-12-09 02:42:37,951 INFO L728 BuchiCegarLoop]: Abstraction has 314 states and 337 transitions. [2018-12-09 02:42:37,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:42:37,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:42:37,952 INFO L87 Difference]: Start difference. First operand 314 states and 337 transitions. Second operand 6 states. [2018-12-09 02:42:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:37,980 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2018-12-09 02:42:37,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:42:37,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 236 transitions. [2018-12-09 02:42:37,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-12-09 02:42:37,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 188 states and 209 transitions. [2018-12-09 02:42:37,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:37,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:37,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 209 transitions. [2018-12-09 02:42:37,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:37,982 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-12-09 02:42:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 209 transitions. [2018-12-09 02:42:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2018-12-09 02:42:37,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 02:42:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-12-09 02:42:37,983 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-12-09 02:42:37,984 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-12-09 02:42:37,984 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-09 02:42:37,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 127 transitions. [2018-12-09 02:42:37,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2018-12-09 02:42:37,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:37,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:37,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:37,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2018-12-09 02:42:37,985 INFO L794 eck$LassoCheckResult]: Stem: 7379#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; 7380#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7395#L12 assume !(10 == main_~i~0); 7389#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7388#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7382#L12 assume !(10 == main_~i~0); 7483#L12-2 assume !(0 == main_~i~0); 7482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7480#L12 assume !(10 == main_~i~0); 7479#L12-2 assume !(0 == main_~i~0); 7478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7477#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7476#L12 assume !(10 == main_~i~0); 7475#L12-2 assume !(0 == main_~i~0); 7474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7473#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7472#L12 assume !(10 == main_~i~0); 7471#L12-2 assume !(0 == main_~i~0); 7470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7468#L12 assume !(10 == main_~i~0); 7467#L12-2 assume !(0 == main_~i~0); 7466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7465#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7464#L12 assume !(10 == main_~i~0); 7463#L12-2 assume !(0 == main_~i~0); 7462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7461#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7460#L12 assume !(10 == main_~i~0); 7459#L12-2 assume !(0 == main_~i~0); 7458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7457#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7456#L12 assume !(10 == main_~i~0); 7455#L12-2 assume !(0 == main_~i~0); 7454#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7453#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7413#L12 assume !(10 == main_~i~0); 7451#L12-2 assume !(0 == main_~i~0); 7450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7398#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2018-12-09 02:42:37,985 INFO L796 eck$LassoCheckResult]: Loop: 7375#L12-2 assume !(0 == main_~i~0); 7376#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7410#L12 assume !(10 == main_~i~0); 7409#L12-2 assume !(0 == main_~i~0); 7408#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7406#L12 assume !(10 == main_~i~0); 7405#L12-2 assume !(0 == main_~i~0); 7404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7403#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7402#L12 assume !(10 == main_~i~0); 7394#L12-2 assume !(0 == main_~i~0); 7397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7396#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7391#L12 assume !(10 == main_~i~0); 7393#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7449#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7385#L12 assume !(10 == main_~i~0); 7386#L12-2 assume !(0 == main_~i~0); 7390#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7446#L12 assume !(10 == main_~i~0); 7445#L12-2 assume !(0 == main_~i~0); 7444#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7443#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7442#L12 assume !(10 == main_~i~0); 7441#L12-2 assume !(0 == main_~i~0); 7440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7438#L12 assume !(10 == main_~i~0); 7437#L12-2 assume !(0 == main_~i~0); 7436#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7435#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7434#L12 assume !(10 == main_~i~0); 7433#L12-2 assume !(0 == main_~i~0); 7432#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7430#L12 assume !(10 == main_~i~0); 7429#L12-2 assume !(0 == main_~i~0); 7428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7427#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7426#L12 assume !(10 == main_~i~0); 7425#L12-2 assume !(0 == main_~i~0); 7424#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7422#L12 assume !(10 == main_~i~0); 7421#L12-2 assume !(0 == main_~i~0); 7420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7419#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7418#L12 assume !(10 == main_~i~0); 7417#L12-2 assume !(0 == main_~i~0); 7416#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7414#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7415#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2018-12-09 02:42:37,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2018-12-09 02:42:37,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:37,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:37,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:37,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:37,995 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2018-12-09 02:42:37,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:37,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:38,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:38,004 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 4 times [2018-12-09 02:42:38,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:38,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:38,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:38,042 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-09 02:42:38,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:38,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 02:42:38,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 02:42:38,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:38,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:38,074 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-09 02:42:38,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:38,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-12-09 02:42:38,239 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 61 [2018-12-09 02:42:38,246 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:38,246 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:38,246 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:38,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:38,247 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:38,247 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:38,247 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:38,247 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:38,247 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration19_Loop [2018-12-09 02:42:38,247 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:38,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:38,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-09 02:42:38,248 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-09 02:42:38,251 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-09 02:42:38,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-09 02:42:38,289 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:38,289 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:38,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,292 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:38,306 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:38,311 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,325 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,339 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:38,339 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,342 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:38,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,374 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:38,375 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:38,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:38,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:38,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:38,376 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:38,376 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:38,376 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:38,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:38,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration19_Loop [2018-12-09 02:42:38,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:38,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:38,376 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-09 02:42:38,378 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-09 02:42:38,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:38,385 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-09 02:42:38,423 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:38,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:38,423 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-09 02:42:38,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:38,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:38,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:38,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:38,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:38,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:38,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:38,426 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-09 02:42:38,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:38,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:38,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:38,427 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:42:38,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:38,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 02:42:38,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:38,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:38,428 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-09 02:42:38,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:38,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:38,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:38,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:38,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:38,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:38,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:38,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:38,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:38,430 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:38,430 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:38,431 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:38,431 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:38,431 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-09 02:42:38,431 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:38,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:38,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:38,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:38,478 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-09 02:42:38,478 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-09 02:42:38,478 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-12-09 02:42:38,578 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 511 states and 566 transitions. Complement of second has 23 states. [2018-12-09 02:42:38,578 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-09 02:42:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-09 02:42:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-12-09 02:42:38,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2018-12-09 02:42:38,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:38,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2018-12-09 02:42:38,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:38,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2018-12-09 02:42:38,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:38,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 566 transitions. [2018-12-09 02:42:38,581 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-12-09 02:42:38,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 410 states and 452 transitions. [2018-12-09 02:42:38,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-12-09 02:42:38,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:38,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 452 transitions. [2018-12-09 02:42:38,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:38,583 INFO L705 BuchiCegarLoop]: Abstraction has 410 states and 452 transitions. [2018-12-09 02:42:38,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 452 transitions. [2018-12-09 02:42:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2018-12-09 02:42:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-09 02:42:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 347 transitions. [2018-12-09 02:42:38,586 INFO L728 BuchiCegarLoop]: Abstraction has 322 states and 347 transitions. [2018-12-09 02:42:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:42:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:42:38,586 INFO L87 Difference]: Start difference. First operand 322 states and 347 transitions. Second operand 7 states. [2018-12-09 02:42:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:38,609 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-12-09 02:42:38,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:42:38,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 264 transitions. [2018-12-09 02:42:38,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-12-09 02:42:38,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 204 states and 229 transitions. [2018-12-09 02:42:38,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:38,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:38,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 229 transitions. [2018-12-09 02:42:38,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:38,611 INFO L705 BuchiCegarLoop]: Abstraction has 204 states and 229 transitions. [2018-12-09 02:42:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 229 transitions. [2018-12-09 02:42:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2018-12-09 02:42:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-09 02:42:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2018-12-09 02:42:38,612 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-12-09 02:42:38,612 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-12-09 02:42:38,612 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-09 02:42:38,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 137 transitions. [2018-12-09 02:42:38,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-12-09 02:42:38,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:38,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:38,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:38,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2018-12-09 02:42:38,613 INFO L794 eck$LassoCheckResult]: Stem: 9219#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; 9220#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9235#L12 assume !(10 == main_~i~0); 9229#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9228#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9221#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9222#L12 assume !(10 == main_~i~0); 9327#L12-2 assume !(0 == main_~i~0); 9326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9324#L12 assume !(10 == main_~i~0); 9323#L12-2 assume !(0 == main_~i~0); 9322#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9320#L12 assume !(10 == main_~i~0); 9319#L12-2 assume !(0 == main_~i~0); 9318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9316#L12 assume !(10 == main_~i~0); 9315#L12-2 assume !(0 == main_~i~0); 9314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9312#L12 assume !(10 == main_~i~0); 9311#L12-2 assume !(0 == main_~i~0); 9310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9308#L12 assume !(10 == main_~i~0); 9307#L12-2 assume !(0 == main_~i~0); 9306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9304#L12 assume !(10 == main_~i~0); 9303#L12-2 assume !(0 == main_~i~0); 9302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9300#L12 assume !(10 == main_~i~0); 9299#L12-2 assume !(0 == main_~i~0); 9298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9257#L12 assume !(10 == main_~i~0); 9295#L12-2 assume !(0 == main_~i~0); 9294#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9238#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2018-12-09 02:42:38,613 INFO L796 eck$LassoCheckResult]: Loop: 9215#L12-2 assume !(0 == main_~i~0); 9216#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9254#L12 assume !(10 == main_~i~0); 9253#L12-2 assume !(0 == main_~i~0); 9252#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9250#L12 assume !(10 == main_~i~0); 9249#L12-2 assume !(0 == main_~i~0); 9248#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9247#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9246#L12 assume !(10 == main_~i~0); 9245#L12-2 assume !(0 == main_~i~0); 9244#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9242#L12 assume !(10 == main_~i~0); 9234#L12-2 assume !(0 == main_~i~0); 9237#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9236#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9231#L12 assume !(10 == main_~i~0); 9233#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9225#L12 assume !(10 == main_~i~0); 9226#L12-2 assume !(0 == main_~i~0); 9230#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9290#L12 assume !(10 == main_~i~0); 9289#L12-2 assume !(0 == main_~i~0); 9288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9286#L12 assume !(10 == main_~i~0); 9285#L12-2 assume !(0 == main_~i~0); 9284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9282#L12 assume !(10 == main_~i~0); 9281#L12-2 assume !(0 == main_~i~0); 9280#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9278#L12 assume !(10 == main_~i~0); 9277#L12-2 assume !(0 == main_~i~0); 9276#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9274#L12 assume !(10 == main_~i~0); 9273#L12-2 assume !(0 == main_~i~0); 9272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9270#L12 assume !(10 == main_~i~0); 9269#L12-2 assume !(0 == main_~i~0); 9268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9266#L12 assume !(10 == main_~i~0); 9265#L12-2 assume !(0 == main_~i~0); 9264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9262#L12 assume !(10 == main_~i~0); 9261#L12-2 assume !(0 == main_~i~0); 9260#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9259#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2018-12-09 02:42:38,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2018-12-09 02:42:38,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:38,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:38,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:38,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:38,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2018-12-09 02:42:38,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:38,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:38,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:38,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:38,630 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 5 times [2018-12-09 02:42:38,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:38,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:38,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:38,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:38,665 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-09 02:42:38,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:38,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,671 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-09 02:42:38,686 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-12-09 02:42:38,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:38,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:38,692 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-09 02:42:38,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:38,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 02:42:38,873 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2018-12-09 02:42:38,883 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:38,883 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:38,883 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:38,883 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:38,883 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:38,883 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:38,883 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:38,883 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:38,883 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration20_Loop [2018-12-09 02:42:38,883 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:38,883 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:38,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-09 02:42:38,887 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-09 02:42:38,890 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-09 02:42:38,891 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-09 02:42:38,928 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:38,928 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,930 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,944 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:38,945 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,949 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:38,949 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:38,978 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:38,978 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_17=0} Honda state: {v_rep~unnamed0~0~false_17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:38,980 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:38,980 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:38,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:38,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:39,013 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:39,014 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:39,014 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:39,014 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:39,014 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:39,014 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:39,014 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:39,014 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:39,014 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:39,014 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration20_Loop [2018-12-09 02:42:39,014 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:39,014 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:39,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-09 02:42:39,016 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-09 02:42:39,019 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-09 02:42:39,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-09 02:42:39,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:39,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:39,060 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-09 02:42:39,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:39,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:39,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:39,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:39,062 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-09 02:42:39,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:39,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,062 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:42:39,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,062 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 02:42:39,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:39,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:39,063 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-09 02:42:39,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:39,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:39,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:39,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:39,065 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-09 02:42:39,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:39,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:39,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:39,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:39,066 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:39,066 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:39,066 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:39,067 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:39,067 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:39,067 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:39,067 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-09 02:42:39,067 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:39,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:39,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:39,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:39,157 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-09 02:42:39,158 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-09 02:42:39,158 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17 Second operand 9 states. [2018-12-09 02:42:39,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 607 states and 682 transitions. Complement of second has 27 states. [2018-12-09 02:42:39,391 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-09 02:42:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 02:42:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-12-09 02:42:39,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2018-12-09 02:42:39,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:39,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2018-12-09 02:42:39,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:39,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2018-12-09 02:42:39,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:39,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 682 transitions. [2018-12-09 02:42:39,395 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-12-09 02:42:39,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 462 states and 516 transitions. [2018-12-09 02:42:39,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-12-09 02:42:39,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:39,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 462 states and 516 transitions. [2018-12-09 02:42:39,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:39,397 INFO L705 BuchiCegarLoop]: Abstraction has 462 states and 516 transitions. [2018-12-09 02:42:39,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 516 transitions. [2018-12-09 02:42:39,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 330. [2018-12-09 02:42:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-09 02:42:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 357 transitions. [2018-12-09 02:42:39,403 INFO L728 BuchiCegarLoop]: Abstraction has 330 states and 357 transitions. [2018-12-09 02:42:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:42:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:42:39,404 INFO L87 Difference]: Start difference. First operand 330 states and 357 transitions. Second operand 8 states. [2018-12-09 02:42:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:39,438 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-12-09 02:42:39,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:42:39,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 292 transitions. [2018-12-09 02:42:39,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-12-09 02:42:39,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 220 states and 249 transitions. [2018-12-09 02:42:39,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:39,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:39,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 249 transitions. [2018-12-09 02:42:39,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:39,442 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-12-09 02:42:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 249 transitions. [2018-12-09 02:42:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 131. [2018-12-09 02:42:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-09 02:42:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-12-09 02:42:39,445 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-12-09 02:42:39,445 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-12-09 02:42:39,445 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-09 02:42:39,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 147 transitions. [2018-12-09 02:42:39,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-12-09 02:42:39,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:39,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:39,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:39,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2018-12-09 02:42:39,447 INFO L794 eck$LassoCheckResult]: Stem: 11228#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; 11229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11240#L12 assume !(10 == main_~i~0); 11238#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11237#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11231#L12 assume !(10 == main_~i~0); 11340#L12-2 assume !(0 == main_~i~0); 11339#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11337#L12 assume !(10 == main_~i~0); 11336#L12-2 assume !(0 == main_~i~0); 11335#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11333#L12 assume !(10 == main_~i~0); 11332#L12-2 assume !(0 == main_~i~0); 11331#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11329#L12 assume !(10 == main_~i~0); 11328#L12-2 assume !(0 == main_~i~0); 11327#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11325#L12 assume !(10 == main_~i~0); 11324#L12-2 assume !(0 == main_~i~0); 11323#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11321#L12 assume !(10 == main_~i~0); 11320#L12-2 assume !(0 == main_~i~0); 11319#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11317#L12 assume !(10 == main_~i~0); 11316#L12-2 assume !(0 == main_~i~0); 11315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11314#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11313#L12 assume !(10 == main_~i~0); 11312#L12-2 assume !(0 == main_~i~0); 11311#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11270#L12 assume !(10 == main_~i~0); 11308#L12-2 assume !(0 == main_~i~0); 11307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11247#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2018-12-09 02:42:39,447 INFO L796 eck$LassoCheckResult]: Loop: 11224#L12-2 assume !(0 == main_~i~0); 11225#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11267#L12 assume !(10 == main_~i~0); 11266#L12-2 assume !(0 == main_~i~0); 11265#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11264#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11263#L12 assume !(10 == main_~i~0); 11262#L12-2 assume !(0 == main_~i~0); 11261#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11259#L12 assume !(10 == main_~i~0); 11258#L12-2 assume !(0 == main_~i~0); 11257#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11255#L12 assume !(10 == main_~i~0); 11254#L12-2 assume !(0 == main_~i~0); 11253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11251#L12 assume !(10 == main_~i~0); 11244#L12-2 assume !(0 == main_~i~0); 11246#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11245#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11241#L12 assume !(10 == main_~i~0); 11243#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11304#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11234#L12 assume !(10 == main_~i~0); 11235#L12-2 assume !(0 == main_~i~0); 11239#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11303#L12 assume !(10 == main_~i~0); 11302#L12-2 assume !(0 == main_~i~0); 11301#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11300#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11299#L12 assume !(10 == main_~i~0); 11298#L12-2 assume !(0 == main_~i~0); 11297#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11296#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11295#L12 assume !(10 == main_~i~0); 11294#L12-2 assume !(0 == main_~i~0); 11293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11291#L12 assume !(10 == main_~i~0); 11290#L12-2 assume !(0 == main_~i~0); 11289#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11287#L12 assume !(10 == main_~i~0); 11286#L12-2 assume !(0 == main_~i~0); 11285#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11284#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11283#L12 assume !(10 == main_~i~0); 11282#L12-2 assume !(0 == main_~i~0); 11281#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11280#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11279#L12 assume !(10 == main_~i~0); 11278#L12-2 assume !(0 == main_~i~0); 11277#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11275#L12 assume !(10 == main_~i~0); 11274#L12-2 assume !(0 == main_~i~0); 11273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2018-12-09 02:42:39,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2018-12-09 02:42:39,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:39,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:39,456 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2018-12-09 02:42:39,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:39,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:39,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:39,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:39,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 6 times [2018-12-09 02:42:39,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:39,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:39,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:39,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:39,514 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-09 02:42:39,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:39,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:39,522 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-09 02:42:39,546 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-12-09 02:42:39,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:39,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:39,553 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-09 02:42:39,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:39,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 02:42:39,757 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 61 [2018-12-09 02:42:39,761 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:39,761 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:39,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:39,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:39,761 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:39,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:39,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:39,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:39,762 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration21_Loop [2018-12-09 02:42:39,762 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:39,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:39,762 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-09 02:42:39,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:39,770 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-09 02:42:39,771 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-09 02:42:39,801 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:39,802 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:39,803 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:39,803 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:39,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:39,806 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:39,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:39,820 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:39,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:39,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:39,838 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:39,851 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:39,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:39,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:39,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:39,851 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:39,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:39,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:39,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:39,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration21_Loop [2018-12-09 02:42:39,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:39,851 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:39,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-09 02:42:39,856 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-09 02:42:39,857 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-09 02:42:39,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-09 02:42:39,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:39,885 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:39,885 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-09 02:42:39,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:39,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,886 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:42:39,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,886 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 02:42:39,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:39,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:39,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-09 02:42:39,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:39,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:39,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:39,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:39,889 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-09 02:42:39,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:39,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:39,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:39,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:39,892 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-09 02:42:39,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:39,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:39,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:39,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:39,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:39,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:39,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:39,894 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:39,895 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:39,895 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:39,895 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:39,895 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:39,895 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:39,895 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-09 02:42:39,896 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:39,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:39,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:39,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:39,956 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-09 02:42:39,956 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-09 02:42:39,956 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19 Second operand 10 states. [2018-12-09 02:42:40,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19. Second operand 10 states. Result 719 states and 818 transitions. Complement of second has 31 states. [2018-12-09 02:42:40,137 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-09 02:42:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-09 02:42:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2018-12-09 02:42:40,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2018-12-09 02:42:40,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:40,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2018-12-09 02:42:40,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:40,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2018-12-09 02:42:40,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:40,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 719 states and 818 transitions. [2018-12-09 02:42:40,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-12-09 02:42:40,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 719 states to 522 states and 590 transitions. [2018-12-09 02:42:40,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-09 02:42:40,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:40,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 590 transitions. [2018-12-09 02:42:40,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:40,144 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 590 transitions. [2018-12-09 02:42:40,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 590 transitions. [2018-12-09 02:42:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 338. [2018-12-09 02:42:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-12-09 02:42:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 367 transitions. [2018-12-09 02:42:40,148 INFO L728 BuchiCegarLoop]: Abstraction has 338 states and 367 transitions. [2018-12-09 02:42:40,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:42:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:42:40,149 INFO L87 Difference]: Start difference. First operand 338 states and 367 transitions. Second operand 9 states. [2018-12-09 02:42:40,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:40,187 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2018-12-09 02:42:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:42:40,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 320 transitions. [2018-12-09 02:42:40,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-12-09 02:42:40,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 236 states and 269 transitions. [2018-12-09 02:42:40,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:40,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:40,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 269 transitions. [2018-12-09 02:42:40,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:40,190 INFO L705 BuchiCegarLoop]: Abstraction has 236 states and 269 transitions. [2018-12-09 02:42:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 269 transitions. [2018-12-09 02:42:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 139. [2018-12-09 02:42:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 02:42:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-12-09 02:42:40,192 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-12-09 02:42:40,192 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-12-09 02:42:40,192 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-09 02:42:40,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 157 transitions. [2018-12-09 02:42:40,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-12-09 02:42:40,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:40,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:40,193 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:40,193 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2018-12-09 02:42:40,193 INFO L794 eck$LassoCheckResult]: Stem: 13422#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; 13423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13434#L12 assume !(10 == main_~i~0); 13432#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13431#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13425#L12 assume !(10 == main_~i~0); 13538#L12-2 assume !(0 == main_~i~0); 13537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13535#L12 assume !(10 == main_~i~0); 13534#L12-2 assume !(0 == main_~i~0); 13533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13531#L12 assume !(10 == main_~i~0); 13530#L12-2 assume !(0 == main_~i~0); 13529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13527#L12 assume !(10 == main_~i~0); 13526#L12-2 assume !(0 == main_~i~0); 13525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13523#L12 assume !(10 == main_~i~0); 13522#L12-2 assume !(0 == main_~i~0); 13521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13520#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13519#L12 assume !(10 == main_~i~0); 13518#L12-2 assume !(0 == main_~i~0); 13517#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13516#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13515#L12 assume !(10 == main_~i~0); 13514#L12-2 assume !(0 == main_~i~0); 13513#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13512#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13511#L12 assume !(10 == main_~i~0); 13510#L12-2 assume !(0 == main_~i~0); 13509#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13508#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13468#L12 assume !(10 == main_~i~0); 13506#L12-2 assume !(0 == main_~i~0); 13505#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13467#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13441#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2018-12-09 02:42:40,193 INFO L796 eck$LassoCheckResult]: Loop: 13418#L12-2 assume !(0 == main_~i~0); 13419#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13465#L12 assume !(10 == main_~i~0); 13464#L12-2 assume !(0 == main_~i~0); 13463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13461#L12 assume !(10 == main_~i~0); 13460#L12-2 assume !(0 == main_~i~0); 13459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13457#L12 assume !(10 == main_~i~0); 13456#L12-2 assume !(0 == main_~i~0); 13455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13453#L12 assume !(10 == main_~i~0); 13452#L12-2 assume !(0 == main_~i~0); 13451#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13450#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13449#L12 assume !(10 == main_~i~0); 13448#L12-2 assume !(0 == main_~i~0); 13447#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13446#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13445#L12 assume !(10 == main_~i~0); 13438#L12-2 assume !(0 == main_~i~0); 13440#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13435#L12 assume !(10 == main_~i~0); 13437#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13428#L12 assume !(10 == main_~i~0); 13429#L12-2 assume !(0 == main_~i~0); 13433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13503#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13501#L12 assume !(10 == main_~i~0); 13500#L12-2 assume !(0 == main_~i~0); 13499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13497#L12 assume !(10 == main_~i~0); 13496#L12-2 assume !(0 == main_~i~0); 13495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13493#L12 assume !(10 == main_~i~0); 13492#L12-2 assume !(0 == main_~i~0); 13491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13489#L12 assume !(10 == main_~i~0); 13488#L12-2 assume !(0 == main_~i~0); 13487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13485#L12 assume !(10 == main_~i~0); 13484#L12-2 assume !(0 == main_~i~0); 13483#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13481#L12 assume !(10 == main_~i~0); 13480#L12-2 assume !(0 == main_~i~0); 13479#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13477#L12 assume !(10 == main_~i~0); 13476#L12-2 assume !(0 == main_~i~0); 13475#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13473#L12 assume !(10 == main_~i~0); 13472#L12-2 assume !(0 == main_~i~0); 13471#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13470#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2018-12-09 02:42:40,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2018-12-09 02:42:40,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:40,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:40,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2018-12-09 02:42:40,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:40,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:40,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:40,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:40,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 7 times [2018-12-09 02:42:40,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:40,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:40,252 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-09 02:42:40,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:40,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:40,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:40,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:40,283 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-09 02:42:40,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:40,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-09 02:42:40,509 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 64 [2018-12-09 02:42:40,514 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:40,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:40,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:40,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:40,514 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:40,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:40,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:40,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:40,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration22_Loop [2018-12-09 02:42:40,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:40,515 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:40,515 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-09 02:42:40,517 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-09 02:42:40,521 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-09 02:42:40,522 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-09 02:42:40,551 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:40,551 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:40,564 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:40,564 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:40,581 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:40,581 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:40,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:40,583 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:40,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:40,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:40,601 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:40,614 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:40,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:40,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:40,614 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:40,614 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:40,614 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:40,614 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:40,614 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:40,614 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration22_Loop [2018-12-09 02:42:40,614 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:40,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:40,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-09 02:42:40,617 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-09 02:42:40,618 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-09 02:42:40,627 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-09 02:42:40,652 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:40,652 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:40,652 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-09 02:42:40,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:40,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:40,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:40,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:40,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:40,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:40,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:40,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 02:42:40,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:40,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:40,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:40,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:40,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:40,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:40,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:40,655 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-09 02:42:40,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:40,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:40,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:40,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:40,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:40,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:40,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:40,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:40,657 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:40,657 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:40,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:40,657 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:40,657 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:40,657 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-09 02:42:40,658 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:40,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:40,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:40,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:40,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-09 02:42:40,775 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-09 02:42:40,775 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21 Second operand 11 states. [2018-12-09 02:42:41,223 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21. Second operand 11 states. Result 847 states and 974 transitions. Complement of second has 35 states. [2018-12-09 02:42:41,223 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-09 02:42:41,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-09 02:42:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-12-09 02:42:41,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2018-12-09 02:42:41,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:41,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2018-12-09 02:42:41,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:41,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2018-12-09 02:42:41,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:41,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 847 states and 974 transitions. [2018-12-09 02:42:41,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2018-12-09 02:42:41,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 847 states to 590 states and 674 transitions. [2018-12-09 02:42:41,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-12-09 02:42:41,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:41,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 674 transitions. [2018-12-09 02:42:41,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:41,231 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 674 transitions. [2018-12-09 02:42:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 674 transitions. [2018-12-09 02:42:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 346. [2018-12-09 02:42:41,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-12-09 02:42:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 377 transitions. [2018-12-09 02:42:41,236 INFO L728 BuchiCegarLoop]: Abstraction has 346 states and 377 transitions. [2018-12-09 02:42:41,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 02:42:41,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:42:41,237 INFO L87 Difference]: Start difference. First operand 346 states and 377 transitions. Second operand 10 states. [2018-12-09 02:42:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:41,271 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2018-12-09 02:42:41,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:42:41,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 348 transitions. [2018-12-09 02:42:41,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-12-09 02:42:41,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 252 states and 289 transitions. [2018-12-09 02:42:41,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:41,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:41,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 289 transitions. [2018-12-09 02:42:41,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:41,273 INFO L705 BuchiCegarLoop]: Abstraction has 252 states and 289 transitions. [2018-12-09 02:42:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 289 transitions. [2018-12-09 02:42:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 147. [2018-12-09 02:42:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-09 02:42:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-12-09 02:42:41,274 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-12-09 02:42:41,274 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-12-09 02:42:41,274 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-09 02:42:41,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 167 transitions. [2018-12-09 02:42:41,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-12-09 02:42:41,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:41,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:41,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:41,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2018-12-09 02:42:41,275 INFO L794 eck$LassoCheckResult]: Stem: 15817#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; 15818#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15829#L12 assume !(10 == main_~i~0); 15827#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15826#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15819#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15820#L12 assume !(10 == main_~i~0); 15937#L12-2 assume !(0 == main_~i~0); 15936#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15935#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15934#L12 assume !(10 == main_~i~0); 15933#L12-2 assume !(0 == main_~i~0); 15932#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15931#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15930#L12 assume !(10 == main_~i~0); 15929#L12-2 assume !(0 == main_~i~0); 15928#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15926#L12 assume !(10 == main_~i~0); 15925#L12-2 assume !(0 == main_~i~0); 15924#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15923#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15922#L12 assume !(10 == main_~i~0); 15921#L12-2 assume !(0 == main_~i~0); 15920#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15919#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15918#L12 assume !(10 == main_~i~0); 15917#L12-2 assume !(0 == main_~i~0); 15916#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15915#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15914#L12 assume !(10 == main_~i~0); 15913#L12-2 assume !(0 == main_~i~0); 15912#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15910#L12 assume !(10 == main_~i~0); 15909#L12-2 assume !(0 == main_~i~0); 15908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15907#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15869#L12 assume !(10 == main_~i~0); 15905#L12-2 assume !(0 == main_~i~0); 15904#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15836#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2018-12-09 02:42:41,275 INFO L796 eck$LassoCheckResult]: Loop: 15813#L12-2 assume !(0 == main_~i~0); 15814#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15865#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15864#L12 assume !(10 == main_~i~0); 15863#L12-2 assume !(0 == main_~i~0); 15862#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15860#L12 assume !(10 == main_~i~0); 15859#L12-2 assume !(0 == main_~i~0); 15858#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15856#L12 assume !(10 == main_~i~0); 15855#L12-2 assume !(0 == main_~i~0); 15854#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15852#L12 assume !(10 == main_~i~0); 15851#L12-2 assume !(0 == main_~i~0); 15850#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15848#L12 assume !(10 == main_~i~0); 15847#L12-2 assume !(0 == main_~i~0); 15846#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15844#L12 assume !(10 == main_~i~0); 15843#L12-2 assume !(0 == main_~i~0); 15842#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15840#L12 assume !(10 == main_~i~0); 15833#L12-2 assume !(0 == main_~i~0); 15835#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15830#L12 assume !(10 == main_~i~0); 15832#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15901#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15823#L12 assume !(10 == main_~i~0); 15824#L12-2 assume !(0 == main_~i~0); 15828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15900#L12 assume !(10 == main_~i~0); 15899#L12-2 assume !(0 == main_~i~0); 15898#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15897#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15896#L12 assume !(10 == main_~i~0); 15895#L12-2 assume !(0 == main_~i~0); 15894#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15892#L12 assume !(10 == main_~i~0); 15891#L12-2 assume !(0 == main_~i~0); 15890#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15888#L12 assume !(10 == main_~i~0); 15887#L12-2 assume !(0 == main_~i~0); 15886#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15884#L12 assume !(10 == main_~i~0); 15883#L12-2 assume !(0 == main_~i~0); 15882#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15881#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15880#L12 assume !(10 == main_~i~0); 15879#L12-2 assume !(0 == main_~i~0); 15878#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15876#L12 assume !(10 == main_~i~0); 15875#L12-2 assume !(0 == main_~i~0); 15874#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15873#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15872#L12 assume !(10 == main_~i~0); 15871#L12-2 assume !(0 == main_~i~0); 15870#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15866#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15867#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2018-12-09 02:42:41,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:41,275 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2018-12-09 02:42:41,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:41,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:41,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:42:41,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:41,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2018-12-09 02:42:41,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:41,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:41,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:41,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 8 times [2018-12-09 02:42:41,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:41,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:41,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:41,333 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-09 02:42:41,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:41,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:41,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 02:42:41,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 02:42:41,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:41,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:41,364 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-09 02:42:41,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:41,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 02:42:41,631 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 69 [2018-12-09 02:42:41,638 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:41,638 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:41,638 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:41,638 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:41,638 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:41,638 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:41,639 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:41,639 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:41,639 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration23_Loop [2018-12-09 02:42:41,639 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:41,639 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:41,639 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-09 02:42:41,640 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-09 02:42:41,642 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-09 02:42:41,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:41,673 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:41,673 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:41,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:41,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:41,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:41,691 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:41,693 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:41,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:41,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:41,695 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:41,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:41,709 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:41,723 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:41,724 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:41,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:41,726 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:41,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:41,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:41,824 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:41,825 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:41,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:41,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:41,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:41,825 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:41,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:41,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:41,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:41,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration23_Loop [2018-12-09 02:42:41,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:41,825 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:41,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:41,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 02:42:41,828 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-09 02:42:41,831 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-09 02:42:41,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:41,859 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:41,860 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-09 02:42:41,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:41,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:41,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:41,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:41,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:41,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:41,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:41,862 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-09 02:42:41,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:41,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:41,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:41,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:41,863 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:41,863 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:41,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:41,864 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-09 02:42:41,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:41,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:41,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:41,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:42:41,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:41,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 02:42:41,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:41,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:41,866 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-09 02:42:41,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:41,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:41,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:41,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:41,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:41,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:41,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:41,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:41,868 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:41,868 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:41,869 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:41,869 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:41,869 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:41,869 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-09 02:42:41,869 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:41,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:41,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:41,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:41,962 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-09 02:42:41,963 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-09 02:42:41,963 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-12-09 02:42:42,201 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 992 states and 1151 transitions. Complement of second has 39 states. [2018-12-09 02:42:42,202 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-09 02:42:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-09 02:42:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2018-12-09 02:42:42,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2018-12-09 02:42:42,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:42,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2018-12-09 02:42:42,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:42,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2018-12-09 02:42:42,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:42,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1151 transitions. [2018-12-09 02:42:42,205 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2018-12-09 02:42:42,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 667 states and 769 transitions. [2018-12-09 02:42:42,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-12-09 02:42:42,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-12-09 02:42:42,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 769 transitions. [2018-12-09 02:42:42,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:42,206 INFO L705 BuchiCegarLoop]: Abstraction has 667 states and 769 transitions. [2018-12-09 02:42:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 769 transitions. [2018-12-09 02:42:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 354. [2018-12-09 02:42:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-12-09 02:42:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 387 transitions. [2018-12-09 02:42:42,209 INFO L728 BuchiCegarLoop]: Abstraction has 354 states and 387 transitions. [2018-12-09 02:42:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:42:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:42:42,209 INFO L87 Difference]: Start difference. First operand 354 states and 387 transitions. Second operand 11 states. [2018-12-09 02:42:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:42,255 INFO L93 Difference]: Finished difference Result 335 states and 376 transitions. [2018-12-09 02:42:42,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:42:42,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 376 transitions. [2018-12-09 02:42:42,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-12-09 02:42:42,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 268 states and 309 transitions. [2018-12-09 02:42:42,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:42,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:42,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 309 transitions. [2018-12-09 02:42:42,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:42,257 INFO L705 BuchiCegarLoop]: Abstraction has 268 states and 309 transitions. [2018-12-09 02:42:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 309 transitions. [2018-12-09 02:42:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 155. [2018-12-09 02:42:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-09 02:42:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2018-12-09 02:42:42,258 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-12-09 02:42:42,258 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-12-09 02:42:42,258 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-09 02:42:42,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 177 transitions. [2018-12-09 02:42:42,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-12-09 02:42:42,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:42,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:42,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:42,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2018-12-09 02:42:42,259 INFO L794 eck$LassoCheckResult]: Stem: 18430#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; 18431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18442#L12 assume !(10 == main_~i~0); 18440#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18439#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18433#L12 assume !(10 == main_~i~0); 18554#L12-2 assume !(0 == main_~i~0); 18553#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18552#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18551#L12 assume !(10 == main_~i~0); 18550#L12-2 assume !(0 == main_~i~0); 18549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18548#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18547#L12 assume !(10 == main_~i~0); 18546#L12-2 assume !(0 == main_~i~0); 18545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18544#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18543#L12 assume !(10 == main_~i~0); 18542#L12-2 assume !(0 == main_~i~0); 18541#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18539#L12 assume !(10 == main_~i~0); 18538#L12-2 assume !(0 == main_~i~0); 18537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18535#L12 assume !(10 == main_~i~0); 18534#L12-2 assume !(0 == main_~i~0); 18533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18531#L12 assume !(10 == main_~i~0); 18530#L12-2 assume !(0 == main_~i~0); 18529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18527#L12 assume !(10 == main_~i~0); 18526#L12-2 assume !(0 == main_~i~0); 18525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18484#L12 assume !(10 == main_~i~0); 18522#L12-2 assume !(0 == main_~i~0); 18521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18483#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18449#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2018-12-09 02:42:42,259 INFO L796 eck$LassoCheckResult]: Loop: 18426#L12-2 assume !(0 == main_~i~0); 18427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18481#L12 assume !(10 == main_~i~0); 18480#L12-2 assume !(0 == main_~i~0); 18479#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18477#L12 assume !(10 == main_~i~0); 18476#L12-2 assume !(0 == main_~i~0); 18475#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18473#L12 assume !(10 == main_~i~0); 18472#L12-2 assume !(0 == main_~i~0); 18471#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18470#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18469#L12 assume !(10 == main_~i~0); 18468#L12-2 assume !(0 == main_~i~0); 18467#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18465#L12 assume !(10 == main_~i~0); 18464#L12-2 assume !(0 == main_~i~0); 18463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18461#L12 assume !(10 == main_~i~0); 18460#L12-2 assume !(0 == main_~i~0); 18459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18457#L12 assume !(10 == main_~i~0); 18456#L12-2 assume !(0 == main_~i~0); 18455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18453#L12 assume !(10 == main_~i~0); 18446#L12-2 assume !(0 == main_~i~0); 18448#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18443#L12 assume !(10 == main_~i~0); 18445#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18520#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18518#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18436#L12 assume !(10 == main_~i~0); 18437#L12-2 assume !(0 == main_~i~0); 18441#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18519#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18517#L12 assume !(10 == main_~i~0); 18516#L12-2 assume !(0 == main_~i~0); 18515#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18514#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18513#L12 assume !(10 == main_~i~0); 18512#L12-2 assume !(0 == main_~i~0); 18511#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18510#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18509#L12 assume !(10 == main_~i~0); 18508#L12-2 assume !(0 == main_~i~0); 18507#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18505#L12 assume !(10 == main_~i~0); 18504#L12-2 assume !(0 == main_~i~0); 18503#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18501#L12 assume !(10 == main_~i~0); 18500#L12-2 assume !(0 == main_~i~0); 18499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18497#L12 assume !(10 == main_~i~0); 18496#L12-2 assume !(0 == main_~i~0); 18495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18493#L12 assume !(10 == main_~i~0); 18492#L12-2 assume !(0 == main_~i~0); 18491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18489#L12 assume !(10 == main_~i~0); 18488#L12-2 assume !(0 == main_~i~0); 18487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18485#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18486#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2018-12-09 02:42:42,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:42,259 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2018-12-09 02:42:42,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:42,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:42,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:42,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2018-12-09 02:42:42,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:42,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 9 times [2018-12-09 02:42:42,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:42,344 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-09 02:42:42,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 02:42:42,345 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 02:42:42,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 02:42:42,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-09 02:42:42,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 02:42:42,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:42,395 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-09 02:42:42,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 02:42:42,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-12-09 02:42:42,627 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 70 [2018-12-09 02:42:42,631 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:42,631 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:42,631 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:42,631 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:42,631 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-09 02:42:42,631 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:42,631 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:42,631 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:42,631 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration24_Loop [2018-12-09 02:42:42,631 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:42,631 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:42,632 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-09 02:42:42,635 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-09 02:42:42,636 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-09 02:42:42,637 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-09 02:42:42,666 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:42,666 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:42,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:42,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:42,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:42,670 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:42,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:42,685 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:42,699 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:42,699 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:42,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:42,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:42,716 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-09 02:42:42,716 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_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/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-09 02:42:42,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-09 02:42:42,719 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:42,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-09 02:42:42,735 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-09 02:42:42,737 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-09 02:42:42,750 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 02:42:42,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 02:42:42,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 02:42:42,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 02:42:42,750 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 02:42:42,750 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 02:42:42,750 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 02:42:42,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 02:42:42,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration24_Loop [2018-12-09 02:42:42,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 02:42:42,750 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 02:42:42,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-09 02:42:42,752 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-09 02:42:42,755 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-09 02:42:42,756 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-09 02:42:42,791 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 02:42:42,791 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 02:42:42,792 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-09 02:42:42,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:42,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:42,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:42,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:42,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:42,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:42,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:42,793 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-09 02:42:42,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:42,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:42,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:42,794 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 02:42:42,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:42,794 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 02:42:42,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:42,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:42,795 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-09 02:42:42,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:42,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:42,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:42,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:42,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 02:42:42,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 02:42:42,796 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 02:42:42,796 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-09 02:42:42,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 02:42:42,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 02:42:42,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 02:42:42,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 02:42:42,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 02:42:42,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 02:42:42,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 02:42:42,797 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 02:42:42,798 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 02:42:42,798 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 02:42:42,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 02:42:42,798 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-09 02:42:42,798 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 02:42:42,798 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-09 02:42:42,798 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-09 02:42:42,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:42,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:42:42,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 02:42:42,916 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-09 02:42:42,916 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-09 02:42:42,916 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25 Second operand 13 states. [2018-12-09 02:42:43,406 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25. Second operand 13 states. Result 1168 states and 1366 transitions. Complement of second has 43 states. [2018-12-09 02:42:43,406 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-09 02:42:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-09 02:42:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 98 transitions. [2018-12-09 02:42:43,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 76 letters. [2018-12-09 02:42:43,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:43,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 119 letters. Loop has 76 letters. [2018-12-09 02:42:43,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:43,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 152 letters. [2018-12-09 02:42:43,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 02:42:43,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1168 states and 1366 transitions. [2018-12-09 02:42:43,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2018-12-09 02:42:43,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1168 states to 767 states and 892 transitions. [2018-12-09 02:42:43,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-12-09 02:42:43,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2018-12-09 02:42:43,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 892 transitions. [2018-12-09 02:42:43,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:43,412 INFO L705 BuchiCegarLoop]: Abstraction has 767 states and 892 transitions. [2018-12-09 02:42:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 892 transitions. [2018-12-09 02:42:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 376. [2018-12-09 02:42:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-09 02:42:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 413 transitions. [2018-12-09 02:42:43,418 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 413 transitions. [2018-12-09 02:42:43,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 02:42:43,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:42:43,418 INFO L87 Difference]: Start difference. First operand 376 states and 413 transitions. Second operand 12 states. [2018-12-09 02:42:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:42:43,454 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2018-12-09 02:42:43,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:42:43,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 404 transitions. [2018-12-09 02:42:43,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2018-12-09 02:42:43,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 284 states and 329 transitions. [2018-12-09 02:42:43,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-09 02:42:43,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-09 02:42:43,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 329 transitions. [2018-12-09 02:42:43,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 02:42:43,456 INFO L705 BuchiCegarLoop]: Abstraction has 284 states and 329 transitions. [2018-12-09 02:42:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 329 transitions. [2018-12-09 02:42:43,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 163. [2018-12-09 02:42:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-09 02:42:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2018-12-09 02:42:43,458 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2018-12-09 02:42:43,458 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2018-12-09 02:42:43,458 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-09 02:42:43,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 187 transitions. [2018-12-09 02:42:43,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-12-09 02:42:43,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 02:42:43,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 02:42:43,459 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-12-09 02:42:43,459 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2018-12-09 02:42:43,459 INFO L794 eck$LassoCheckResult]: Stem: 21306#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; 21307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21318#L12 assume !(10 == main_~i~0); 21316#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21308#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21309#L12 assume !(10 == main_~i~0); 21434#L12-2 assume !(0 == main_~i~0); 21433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21431#L12 assume !(10 == main_~i~0); 21430#L12-2 assume !(0 == main_~i~0); 21429#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21427#L12 assume !(10 == main_~i~0); 21426#L12-2 assume !(0 == main_~i~0); 21425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21423#L12 assume !(10 == main_~i~0); 21422#L12-2 assume !(0 == main_~i~0); 21421#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21420#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21419#L12 assume !(10 == main_~i~0); 21418#L12-2 assume !(0 == main_~i~0); 21417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21416#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21415#L12 assume !(10 == main_~i~0); 21414#L12-2 assume !(0 == main_~i~0); 21413#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21411#L12 assume !(10 == main_~i~0); 21410#L12-2 assume !(0 == main_~i~0); 21409#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21407#L12 assume !(10 == main_~i~0); 21406#L12-2 assume !(0 == main_~i~0); 21405#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21366#L12 assume !(10 == main_~i~0); 21402#L12-2 assume !(0 == main_~i~0); 21401#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21325#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2018-12-09 02:42:43,459 INFO L796 eck$LassoCheckResult]: Loop: 21302#L12-2 assume !(0 == main_~i~0); 21303#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21361#L12 assume !(10 == main_~i~0); 21360#L12-2 assume !(0 == main_~i~0); 21359#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21358#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21357#L12 assume !(10 == main_~i~0); 21356#L12-2 assume !(0 == main_~i~0); 21355#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21354#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21353#L12 assume !(10 == main_~i~0); 21352#L12-2 assume !(0 == main_~i~0); 21351#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21350#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21349#L12 assume !(10 == main_~i~0); 21348#L12-2 assume !(0 == main_~i~0); 21347#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21346#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21345#L12 assume !(10 == main_~i~0); 21344#L12-2 assume !(0 == main_~i~0); 21343#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21341#L12 assume !(10 == main_~i~0); 21340#L12-2 assume !(0 == main_~i~0); 21339#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21337#L12 assume !(10 == main_~i~0); 21336#L12-2 assume !(0 == main_~i~0); 21335#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21333#L12 assume !(10 == main_~i~0); 21332#L12-2 assume !(0 == main_~i~0); 21331#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21329#L12 assume !(10 == main_~i~0); 21322#L12-2 assume !(0 == main_~i~0); 21324#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21323#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21319#L12 assume !(10 == main_~i~0); 21321#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21400#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21312#L12 assume !(10 == main_~i~0); 21313#L12-2 assume !(0 == main_~i~0); 21317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21399#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21397#L12 assume !(10 == main_~i~0); 21396#L12-2 assume !(0 == main_~i~0); 21395#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21393#L12 assume !(10 == main_~i~0); 21392#L12-2 assume !(0 == main_~i~0); 21391#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21389#L12 assume !(10 == main_~i~0); 21388#L12-2 assume !(0 == main_~i~0); 21387#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21385#L12 assume !(10 == main_~i~0); 21384#L12-2 assume !(0 == main_~i~0); 21383#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21381#L12 assume !(10 == main_~i~0); 21380#L12-2 assume !(0 == main_~i~0); 21379#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21377#L12 assume !(10 == main_~i~0); 21376#L12-2 assume !(0 == main_~i~0); 21375#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21373#L12 assume !(10 == main_~i~0); 21372#L12-2 assume !(0 == main_~i~0); 21371#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21369#L12 assume !(10 == main_~i~0); 21368#L12-2 assume !(0 == main_~i~0); 21367#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21363#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21364#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2018-12-09 02:42:43,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 17 times [2018-12-09 02:42:43,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:43,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:43,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:43,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -312487543, now seen corresponding path program 17 times [2018-12-09 02:42:43,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:43,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:43,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:42:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash 799661767, now seen corresponding path program 10 times [2018-12-09 02:42:43,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 02:42:43,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 02:42:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:42:43,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:42:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:42:43,743 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 78 [2018-12-09 02:42:43,856 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2018-12-09 02:42:43,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 02:42:43 BoogieIcfgContainer [2018-12-09 02:42:43,876 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 02:42:43,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:42:43,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:42:43,877 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:42:43,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:42:33" (3/4) ... [2018-12-09 02:42:43,880 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-09 02:42:43,922 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bb05a38d-2ce2-47af-bbe4-d39a53a8614f/bin-2019/uautomizer/witness.graphml [2018-12-09 02:42:43,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:42:43,923 INFO L168 Benchmark]: Toolchain (without parser) took 10854.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 504.4 MB). Free memory was 953.3 MB in the beginning and 815.9 MB in the end (delta: 137.4 MB). Peak memory consumption was 641.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:43,923 INFO L168 Benchmark]: CDTParser took 0.12 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-09 02:42:43,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:43,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.41 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:42:43,924 INFO L168 Benchmark]: Boogie Preprocessor took 10.42 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:43,924 INFO L168 Benchmark]: RCFGBuilder took 158.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:43,924 INFO L168 Benchmark]: BuchiAutomizer took 10493.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.1 GB in the beginning and 815.9 MB in the end (delta: 304.4 MB). Peak memory consumption was 670.9 MB. Max. memory is 11.5 GB. [2018-12-09 02:42:43,924 INFO L168 Benchmark]: Witness Printer took 45.68 ms. Allocated memory is still 1.5 GB. Free memory is still 815.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:42:43,925 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.12 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 123.52 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.5 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.41 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.42 ms. Allocated memory is still 1.0 GB. Free memory was 942.5 MB in the beginning and 939.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10493.34 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 366.5 MB). Free memory was 1.1 GB in the beginning and 815.9 MB in the end (delta: 304.4 MB). Peak memory consumption was 670.9 MB. Max. memory is 11.5 GB. * Witness Printer took 45.68 ms. Allocated memory is still 1.5 GB. Free memory is still 815.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 35 terminating modules (22 trivial, 12 deterministic, 1 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. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 163 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 6.6s. Construction of modules took 1.0s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 34. Automata minimization 0.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 2269 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 163 states and ocurred in iteration 24. Nontrivial modules had stage [12, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 262 SDtfs, 787 SDslu, 9 SDs, 0 SdLazy, 2168 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT9 SILN0 SILU0 SILI10 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax167 hnf100 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq181 hnf93 smp84 dnf134 smp100 tf108 neg93 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: 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@4910eeed=0, \result=0, i=10} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: 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 [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 Loop: [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 [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 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...