./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:21:40,221 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:21:40,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:21:40,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:21:40,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:21:40,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:21:40,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:21:40,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:21:40,233 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:21:40,233 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:21:40,234 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:21:40,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:21:40,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:21:40,236 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:21:40,236 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:21:40,237 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:21:40,238 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:21:40,239 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:21:40,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:21:40,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:21:40,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:21:40,243 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:21:40,244 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:21:40,244 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:21:40,244 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:21:40,245 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:21:40,246 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:21:40,246 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:21:40,247 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:21:40,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:21:40,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:21:40,248 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:21:40,248 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:21:40,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:21:40,249 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:21:40,250 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:21:40,250 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:21:40,260 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:21:40,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:21:40,261 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:21:40,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:21:40,262 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:21:40,262 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:21:40,262 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:21:40,262 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:21:40,262 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:21:40,262 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:21:40,263 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:21:40,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:21:40,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:21:40,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:21:40,264 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:21:40,265 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:21:40,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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b329fcd1c2ada34efa1c491c6d8d75d6e8a1856 [2018-11-10 09:21:40,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:21:40,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:21:40,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:21:40,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:21:40,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:21:40,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2018-11-10 09:21:40,334 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/data/afbdd12f0/0815592ad80a4567814450f73aea36b9/FLAG4c43f6a7c [2018-11-10 09:21:40,736 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:21:40,736 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2018-11-10 09:21:40,740 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/data/afbdd12f0/0815592ad80a4567814450f73aea36b9/FLAG4c43f6a7c [2018-11-10 09:21:40,751 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/data/afbdd12f0/0815592ad80a4567814450f73aea36b9 [2018-11-10 09:21:40,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:21:40,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:21:40,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:21:40,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:21:40,759 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:21:40,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ea8d2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40, skipping insertion in model container [2018-11-10 09:21:40,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:21:40,784 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:21:40,881 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:21:40,883 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:21:40,891 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:21:40,898 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:21:40,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40 WrapperNode [2018-11-10 09:21:40,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:21:40,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:21:40,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:21:40,899 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:21:40,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:21:40,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:21:40,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:21:40,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:21:40,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... [2018-11-10 09:21:40,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:21:40,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:21:40,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:21:40,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:21:40,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:21:40,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:21:41,089 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:21:41,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:41 BoogieIcfgContainer [2018-11-10 09:21:41,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:21:41,090 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:21:41,090 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:21:41,092 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:21:41,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:41,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:21:40" (1/3) ... [2018-11-10 09:21:41,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15b81cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:21:41, skipping insertion in model container [2018-11-10 09:21:41,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:41,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:21:40" (2/3) ... [2018-11-10 09:21:41,094 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15b81cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:21:41, skipping insertion in model container [2018-11-10 09:21:41,094 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:21:41,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:41" (3/3) ... [2018-11-10 09:21:41,095 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq_false-termination_true-no-overflow.c [2018-11-10 09:21:41,138 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:21:41,139 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:21:41,139 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:21:41,139 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:21:41,139 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:21:41,139 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:21:41,140 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:21:41,140 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:21:41,140 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:21:41,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 09:21:41,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 09:21:41,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:41,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:41,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:21:41,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:41,169 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:21:41,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-10 09:21:41,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 09:21:41,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:41,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:41,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 09:21:41,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:41,177 INFO L793 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_~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; 7#L18-1true [2018-11-10 09:21:41,177 INFO L795 eck$LassoCheckResult]: Loop: 7#L18-1true assume true; 4#L11-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8#L12true assume !(main_~i~0 >= 10); 5#L12-2true assume main_~i~0 <= 0;main_~up~0 := 1; 12#L15-1true assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7#L18-1true [2018-11-10 09:21:41,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,182 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 09:21:41,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:41,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,252 INFO L82 PathProgramCache]: Analyzing trace with hash 34544784, now seen corresponding path program 1 times [2018-11-10 09:21:41,252 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:41,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:41,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:41,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984270, now seen corresponding path program 1 times [2018-11-10 09:21:41,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:41,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,329 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:41,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:41,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:41,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:41,330 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:41,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:41,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:41,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 09:21:41,331 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:41,331 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:41,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,431 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:41,432 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:41,440 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:41,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:41,468 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:41,482 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:41,482 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:41,483 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:41,483 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:41,483 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:41,483 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,483 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:41,483 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:41,483 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-10 09:21:41,483 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:41,483 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:41,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,541 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:41,546 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:41,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:41,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:41,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:41,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:41,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:41,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:41,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:41,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:41,556 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:41,561 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:41,561 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:41,562 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:41,562 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:41,563 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:41,563 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-10 09:21:41,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:41,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:41,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:41,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:41,621 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:21:41,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-11-10 09:21:41,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 38 states and 52 transitions. Complement of second has 8 states. [2018-11-10 09:21:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-10 09:21:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 09:21:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 09:21:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 09:21:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:41,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 52 transitions. [2018-11-10 09:21:41,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 09:21:41,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 22 states and 32 transitions. [2018-11-10 09:21:41,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 09:21:41,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-10 09:21:41,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2018-11-10 09:21:41,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:41,685 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-10 09:21:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2018-11-10 09:21:41,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-10 09:21:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 09:21:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-10 09:21:41,703 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-10 09:21:41,703 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-10 09:21:41,703 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:21:41,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 31 transitions. [2018-11-10 09:21:41,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 09:21:41,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:41,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:41,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 09:21:41,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:41,704 INFO L793 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 99#L18-1 assume true; 106#L11-1 [2018-11-10 09:21:41,704 INFO L795 eck$LassoCheckResult]: Loop: 106#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 107#L12 assume !(main_~i~0 >= 10); 100#L12-2 assume !(main_~i~0 <= 0); 102#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 111#L18-1 assume true; 106#L11-1 [2018-11-10 09:21:41,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-10 09:21:41,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:41,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash 40240796, now seen corresponding path program 1 times [2018-11-10 09:21:41,708 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:41,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:41,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:41,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 150939450, now seen corresponding path program 1 times [2018-11-10 09:21:41,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:41,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:41,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:41,760 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:41,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:41,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:41,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:41,760 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:41,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:41,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:41,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 09:21:41,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:41,760 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:41,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,808 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:41,809 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:41,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:41,836 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:41,836 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,841 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:41,841 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:41,858 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:41,859 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:41,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:41,892 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:41,892 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:41,905 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:41,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:41,928 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:41,943 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:41,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:41,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:41,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:41,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:41,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:41,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:41,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:41,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-10 09:21:41,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:41,944 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:41,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:41,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,012 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:42,012 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:42,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:42,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:42,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:42,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:42,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:42,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:42,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:42,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:42,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:42,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:42,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:42,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:42,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:42,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:42,038 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:42,039 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:42,039 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:42,039 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:42,039 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:42,039 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-10 09:21:42,040 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:42,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:21:42,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 31 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-10 09:21:42,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 31 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 48 states and 70 transitions. Complement of second has 7 states. [2018-11-10 09:21:42,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:21:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-10 09:21:42,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 09:21:42,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 09:21:42,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 09:21:42,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 70 transitions. [2018-11-10 09:21:42,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 09:21:42,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 56 transitions. [2018-11-10 09:21:42,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 09:21:42,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 09:21:42,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 56 transitions. [2018-11-10 09:21:42,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:42,132 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-10 09:21:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 56 transitions. [2018-11-10 09:21:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-10 09:21:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 09:21:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2018-11-10 09:21:42,134 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2018-11-10 09:21:42,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:42,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:42,136 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 3 states. [2018-11-10 09:21:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:42,144 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2018-11-10 09:21:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:42,144 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 63 transitions. [2018-11-10 09:21:42,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 09:21:42,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 56 transitions. [2018-11-10 09:21:42,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 09:21:42,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 09:21:42,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 56 transitions. [2018-11-10 09:21:42,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:42,146 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 56 transitions. [2018-11-10 09:21:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 56 transitions. [2018-11-10 09:21:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-11-10 09:21:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 09:21:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-11-10 09:21:42,148 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-11-10 09:21:42,149 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-11-10 09:21:42,149 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:21:42,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2018-11-10 09:21:42,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 09:21:42,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:42,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:42,150 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 09:21:42,150 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:42,150 INFO L793 eck$LassoCheckResult]: Stem: 304#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 295#L18-1 assume true; 300#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 301#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 296#L12-2 assume !(main_~i~0 <= 0); 297#L15-1 [2018-11-10 09:21:42,150 INFO L795 eck$LassoCheckResult]: Loop: 297#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 305#L18-1 assume true; 306#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 323#L12 assume !(main_~i~0 >= 10); 321#L12-2 assume !(main_~i~0 <= 0); 297#L15-1 [2018-11-10 09:21:42,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash 889541489, now seen corresponding path program 1 times [2018-11-10 09:21:42,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 55602088, now seen corresponding path program 1 times [2018-11-10 09:21:42,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1966752200, now seen corresponding path program 1 times [2018-11-10 09:21:42,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,184 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:42,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:42,185 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:42,185 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:42,185 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:42,185 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:42,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:42,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 09:21:42,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:42,186 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:42,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,244 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:42,244 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:42,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:42,262 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:42,262 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:42,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:42,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:42,288 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:42,288 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:42,294 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,328 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:42,328 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:42,445 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:42,446 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:42,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:42,446 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:42,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:42,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:42,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:42,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:42,447 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-10 09:21:42,447 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:42,447 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:42,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,483 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:42,483 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:42,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:42,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:42,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:42,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:42,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:42,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:42,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:42,494 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:42,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:42,497 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:21:42,497 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:42,497 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:42,497 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:42,498 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:21:42,498 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:42,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:21:42,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 46 transitions. cyclomatic complexity: 17 Second operand 4 states. [2018-11-10 09:21:42,563 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 46 transitions. cyclomatic complexity: 17. Second operand 4 states. Result 71 states and 104 transitions. Complement of second has 7 states. [2018-11-10 09:21:42,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 09:21:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 5 letters. [2018-11-10 09:21:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-10 09:21:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 10 letters. [2018-11-10 09:21:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 104 transitions. [2018-11-10 09:21:42,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 09:21:42,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 67 states and 97 transitions. [2018-11-10 09:21:42,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-10 09:21:42,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 09:21:42,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 97 transitions. [2018-11-10 09:21:42,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:42,571 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 97 transitions. [2018-11-10 09:21:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 97 transitions. [2018-11-10 09:21:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-11-10 09:21:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 09:21:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2018-11-10 09:21:42,575 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-10 09:21:42,575 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-10 09:21:42,575 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:21:42,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 90 transitions. [2018-11-10 09:21:42,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-10 09:21:42,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:42,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:42,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:42,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:42,577 INFO L793 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 455#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 456#L18-1 assume true; 481#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 493#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 477#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 478#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 465#L18-1 [2018-11-10 09:21:42,577 INFO L795 eck$LassoCheckResult]: Loop: 465#L18-1 assume true; 466#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 479#L12 assume !(main_~i~0 >= 10); 480#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 491#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 465#L18-1 [2018-11-10 09:21:42,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1805982350, now seen corresponding path program 1 times [2018-11-10 09:21:42,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:42,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:42,587 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:42,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,587 INFO L82 PathProgramCache]: Analyzing trace with hash 34544786, now seen corresponding path program 1 times [2018-11-10 09:21:42,587 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:42,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:21:42,596 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:42,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:42,596 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. cyclomatic complexity: 36 Second operand 3 states. [2018-11-10 09:21:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:42,603 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2018-11-10 09:21:42,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:42,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 79 transitions. [2018-11-10 09:21:42,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 09:21:42,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 51 states and 70 transitions. [2018-11-10 09:21:42,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-10 09:21:42,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-10 09:21:42,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 70 transitions. [2018-11-10 09:21:42,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:42,605 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 70 transitions. [2018-11-10 09:21:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 70 transitions. [2018-11-10 09:21:42,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-10 09:21:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 09:21:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2018-11-10 09:21:42,607 INFO L728 BuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2018-11-10 09:21:42,608 INFO L608 BuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2018-11-10 09:21:42,608 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:21:42,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 69 transitions. [2018-11-10 09:21:42,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 09:21:42,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:42,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:42,609 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 09:21:42,609 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:42,609 INFO L793 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 580#L18-1 assume true; 604#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 602#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 600#L12-2 assume !(main_~i~0 <= 0); 595#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 596#L18-1 assume true; 617#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 614#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 584#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 585#L15-1 [2018-11-10 09:21:42,609 INFO L795 eck$LassoCheckResult]: Loop: 585#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 598#L18-1 assume true; 616#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 613#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 594#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 585#L15-1 [2018-11-10 09:21:42,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1966752264, now seen corresponding path program 1 times [2018-11-10 09:21:42,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:42,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 09:21:42,625 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:42,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash 53754982, now seen corresponding path program 1 times [2018-11-10 09:21:42,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:42,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:21:42,633 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:42,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:21:42,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:21:42,633 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. cyclomatic complexity: 24 Second operand 3 states. [2018-11-10 09:21:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:42,646 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2018-11-10 09:21:42,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:21:42,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. [2018-11-10 09:21:42,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 09:21:42,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2018-11-10 09:21:42,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 09:21:42,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-10 09:21:42,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2018-11-10 09:21:42,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:42,648 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2018-11-10 09:21:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2018-11-10 09:21:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-11-10 09:21:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 09:21:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-10 09:21:42,651 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-10 09:21:42,651 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-10 09:21:42,651 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:21:42,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2018-11-10 09:21:42,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-10 09:21:42,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:42,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:42,652 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:42,652 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:42,652 INFO L793 eck$LassoCheckResult]: Stem: 705#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 696#L18-1 assume true; 706#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 730#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 729#L12-2 assume !(main_~i~0 <= 0); 712#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 713#L18-1 assume true; 726#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 722#L12 assume !(main_~i~0 >= 10); 718#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 715#L15-1 [2018-11-10 09:21:42,653 INFO L795 eck$LassoCheckResult]: Loop: 715#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 716#L18-1 assume true; 721#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 720#L12 assume !(main_~i~0 >= 10); 719#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 715#L15-1 [2018-11-10 09:21:42,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1966752202, now seen corresponding path program 1 times [2018-11-10 09:21:42,653 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:42,671 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:42,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:42,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 09:21:42,697 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:42,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,697 INFO L82 PathProgramCache]: Analyzing trace with hash 53755044, now seen corresponding path program 2 times [2018-11-10 09:21:42,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:42,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:42,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:42,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:42,723 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:42,723 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:42,723 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:42,723 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:42,723 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:42,723 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,723 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:42,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:42,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 09:21:42,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:42,724 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:42,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,762 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:42,762 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,764 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:42,764 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,782 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:42,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:42,836 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:42,837 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:42,837 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:42,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:42,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:42,837 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:42,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:42,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:42,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:42,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-10 09:21:42,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:42,838 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:42,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:42,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-11-10 09:21:42,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-11-10 09:21:42,898 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:42,898 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:42,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:42,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:42,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:42,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:42,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:42,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:42,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:42,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:42,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:42,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:42,905 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:21:42,905 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:42,905 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:42,905 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:42,905 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:21:42,906 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:42,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:42,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:42,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:42,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-11-10 09:21:42,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 3 states. [2018-11-10 09:21:42,972 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 123 states and 158 transitions. Complement of second has 7 states. [2018-11-10 09:21:42,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 09:21:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 09:21:42,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-10 09:21:42,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 09:21:42,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-10 09:21:42,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:42,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 158 transitions. [2018-11-10 09:21:42,977 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-10 09:21:42,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 111 states and 142 transitions. [2018-11-10 09:21:42,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 09:21:42,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 09:21:42,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 142 transitions. [2018-11-10 09:21:42,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:42,978 INFO L705 BuchiCegarLoop]: Abstraction has 111 states and 142 transitions. [2018-11-10 09:21:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 142 transitions. [2018-11-10 09:21:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-11-10 09:21:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-10 09:21:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2018-11-10 09:21:42,982 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 127 transitions. [2018-11-10 09:21:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:21:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:21:42,983 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand 4 states. [2018-11-10 09:21:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:43,005 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2018-11-10 09:21:43,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:21:43,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 151 transitions. [2018-11-10 09:21:43,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 09:21:43,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 102 states and 128 transitions. [2018-11-10 09:21:43,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2018-11-10 09:21:43,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-11-10 09:21:43,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 128 transitions. [2018-11-10 09:21:43,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:43,007 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2018-11-10 09:21:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 128 transitions. [2018-11-10 09:21:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2018-11-10 09:21:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-10 09:21:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 111 transitions. [2018-11-10 09:21:43,011 INFO L728 BuchiCegarLoop]: Abstraction has 87 states and 111 transitions. [2018-11-10 09:21:43,011 INFO L608 BuchiCegarLoop]: Abstraction has 87 states and 111 transitions. [2018-11-10 09:21:43,011 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:21:43,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 111 transitions. [2018-11-10 09:21:43,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 09:21:43,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:43,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:43,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:43,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:43,012 INFO L793 eck$LassoCheckResult]: Stem: 1195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1186#L18-1 assume true; 1230#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1229#L12 assume !(main_~i~0 >= 10); 1228#L12-2 assume !(main_~i~0 <= 0); 1227#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1226#L18-1 assume true; 1225#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1224#L12 assume !(main_~i~0 >= 10); 1223#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1222#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 1209#L18-1 [2018-11-10 09:21:43,012 INFO L795 eck$LassoCheckResult]: Loop: 1209#L18-1 assume true; 1239#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1236#L12 assume !(main_~i~0 >= 10); 1233#L12-2 assume !(main_~i~0 <= 0); 1234#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 1209#L18-1 [2018-11-10 09:21:43,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1649122717, now seen corresponding path program 1 times [2018-11-10 09:21:43,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash 34544846, now seen corresponding path program 2 times [2018-11-10 09:21:43,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:43,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1224546388, now seen corresponding path program 2 times [2018-11-10 09:21:43,023 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:43,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,056 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:43,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:43,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:43,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:43,056 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:43,056 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,056 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:43,056 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:43,056 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 09:21:43,056 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:43,056 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:43,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,098 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:43,098 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,110 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:43,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,137 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:43,152 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:43,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:43,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:43,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:43,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:43,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:43,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:43,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-10 09:21:43,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:43,153 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:43,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,188 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:43,188 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:43,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:43,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:43,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:43,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:43,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:43,194 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:43,194 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:43,195 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:43,195 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:43,195 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-10 09:21:43,195 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:43,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:43,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:43,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:43,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 09:21:43,226 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 111 transitions. cyclomatic complexity: 32 Second operand 4 states. [2018-11-10 09:21:43,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 111 transitions. cyclomatic complexity: 32. Second operand 4 states. Result 122 states and 153 transitions. Complement of second has 7 states. [2018-11-10 09:21:43,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 09:21:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 09:21:43,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-10 09:21:43,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:43,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 09:21:43,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:43,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-10 09:21:43,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:43,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 153 transitions. [2018-11-10 09:21:43,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:21:43,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 93 states and 119 transitions. [2018-11-10 09:21:43,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 09:21:43,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 09:21:43,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 119 transitions. [2018-11-10 09:21:43,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:43,245 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 119 transitions. [2018-11-10 09:21:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 119 transitions. [2018-11-10 09:21:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-11-10 09:21:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 09:21:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2018-11-10 09:21:43,248 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2018-11-10 09:21:43,248 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 96 transitions. [2018-11-10 09:21:43,248 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 09:21:43,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 96 transitions. [2018-11-10 09:21:43,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:21:43,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:43,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:43,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:21:43,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:43,249 INFO L793 eck$LassoCheckResult]: Stem: 1479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1469#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1470#L18-1 assume true; 1509#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1506#L12 assume !(main_~i~0 >= 10); 1505#L12-2 assume !(main_~i~0 <= 0); 1503#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1502#L18-1 assume true; 1501#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1498#L12 assume !(main_~i~0 >= 10); 1497#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1496#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 1495#L18-1 assume true; 1489#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1539#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1520#L12-2 [2018-11-10 09:21:43,249 INFO L795 eck$LassoCheckResult]: Loop: 1520#L12-2 assume !(main_~i~0 <= 0); 1517#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1480#L18-1 assume true; 1481#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1535#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1520#L12-2 [2018-11-10 09:21:43,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1116042950, now seen corresponding path program 1 times [2018-11-10 09:21:43,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:43,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:43,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:21:43,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:21:43,266 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:43,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,266 INFO L82 PathProgramCache]: Analyzing trace with hash 50740226, now seen corresponding path program 1 times [2018-11-10 09:21:43,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:43,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,291 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:43,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:43,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:43,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:43,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:43,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:43,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:43,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-10 09:21:43,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:43,291 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:43,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,324 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:43,324 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,328 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:43,329 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,345 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,345 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,360 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:43,360 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,379 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:43,379 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,383 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:43,400 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,496 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:43,498 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:43,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:43,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:43,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:43,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:43,498 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,498 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:43,498 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:43,498 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-10 09:21:43,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:43,498 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:43,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,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-11-10 09:21:43,531 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:43,531 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:43,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:43,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:43,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:43,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:43,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:43,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:43,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:43,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:43,539 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:43,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:43,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:43,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:43,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:43,544 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:43,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:43,546 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:21:43,546 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:43,546 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:43,546 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:43,547 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:21:43,547 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:43,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:43,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:43,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:43,577 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:21:43,577 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 96 transitions. cyclomatic complexity: 27 Second operand 5 states. [2018-11-10 09:21:43,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 96 transitions. cyclomatic complexity: 27. Second operand 5 states. Result 156 states and 206 transitions. Complement of second has 7 states. [2018-11-10 09:21:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:21:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 09:21:43,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 09:21:43,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:43,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 09:21:43,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:43,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 09:21:43,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:43,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 206 transitions. [2018-11-10 09:21:43,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 09:21:43,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 122 states and 156 transitions. [2018-11-10 09:21:43,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-10 09:21:43,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 09:21:43,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 156 transitions. [2018-11-10 09:21:43,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:43,596 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 156 transitions. [2018-11-10 09:21:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 156 transitions. [2018-11-10 09:21:43,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2018-11-10 09:21:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 09:21:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2018-11-10 09:21:43,599 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2018-11-10 09:21:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:21:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:21:43,599 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 4 states. [2018-11-10 09:21:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:43,614 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-11-10 09:21:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:21:43,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 140 transitions. [2018-11-10 09:21:43,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-10 09:21:43,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 110 states and 136 transitions. [2018-11-10 09:21:43,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 09:21:43,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-10 09:21:43,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 136 transitions. [2018-11-10 09:21:43,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:43,617 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 136 transitions. [2018-11-10 09:21:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 136 transitions. [2018-11-10 09:21:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 90. [2018-11-10 09:21:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-10 09:21:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2018-11-10 09:21:43,619 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 113 transitions. [2018-11-10 09:21:43,619 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 113 transitions. [2018-11-10 09:21:43,619 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 09:21:43,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 113 transitions. [2018-11-10 09:21:43,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 09:21:43,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:43,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:43,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 1, 1, 1] [2018-11-10 09:21:43,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 09:21:43,620 INFO L793 eck$LassoCheckResult]: Stem: 1994#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1986#L18-1 assume true; 2025#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2023#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2024#L12-2 assume !(main_~i~0 <= 0); 2030#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2029#L18-1 assume true; 2028#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2027#L12 assume !(main_~i~0 >= 10); 2015#L12-2 assume !(main_~i~0 <= 0); 2019#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2018#L18-1 assume true; 2017#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2014#L12 assume !(main_~i~0 >= 10); 2011#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2012#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 1995#L18-1 assume true; 1996#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2062#L12 assume !(main_~i~0 >= 10); 2031#L12-2 assume !(main_~i~0 <= 0); 2032#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 2004#L18-1 assume true; 2005#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2044#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2036#L12-2 [2018-11-10 09:21:43,621 INFO L795 eck$LassoCheckResult]: Loop: 2036#L12-2 assume !(main_~i~0 <= 0); 2000#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2001#L18-1 assume true; 2048#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2042#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2036#L12-2 [2018-11-10 09:21:43,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1899546534, now seen corresponding path program 2 times [2018-11-10 09:21:43,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:43,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:43,646 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:43,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:43,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:43,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:43,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:43,669 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:21:43,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:43,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 09:21:43,696 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:43,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash 50740226, now seen corresponding path program 2 times [2018-11-10 09:21:43,696 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:43,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:43,721 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:43,721 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:43,721 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:43,721 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:43,721 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:43,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:43,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:43,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration9_Loop [2018-11-10 09:21:43,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:43,721 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:43,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,758 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:43,758 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,760 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,760 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,776 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:43,776 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,779 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,781 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:43,781 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,798 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,813 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:43,813 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:43,817 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:43,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:43,930 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:43,931 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:43,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:43,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:43,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:43,932 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:43,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:43,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:43,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:43,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration9_Loop [2018-11-10 09:21:43,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:43,932 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:43,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:43,963 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:43,963 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:43,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:43,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:43,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:43,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:43,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:43,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:43,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:43,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:43,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:43,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:43,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:43,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:43,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:43,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:43,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:43,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:43,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:43,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:43,974 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:43,976 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:43,976 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:21:43,976 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:43,976 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:43,976 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:43,977 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 09:21:43,977 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:44,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,025 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:21:44,025 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 113 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-10 09:21:44,040 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 113 transitions. cyclomatic complexity: 31. Second operand 5 states. Result 128 states and 166 transitions. Complement of second has 7 states. [2018-11-10 09:21:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:21:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 09:21:44,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 09:21:44,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:44,042 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:21:44,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:21:44,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 113 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-10 09:21:44,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 113 transitions. cyclomatic complexity: 31. Second operand 5 states. Result 159 states and 193 transitions. Complement of second has 9 states. [2018-11-10 09:21:44,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:21:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-10 09:21:44,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 09:21:44,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:44,100 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:21:44,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,125 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 09:21:44,125 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 90 states and 113 transitions. cyclomatic complexity: 31 Second operand 5 states. [2018-11-10 09:21:44,138 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 90 states and 113 transitions. cyclomatic complexity: 31. Second operand 5 states. Result 139 states and 181 transitions. Complement of second has 8 states. [2018-11-10 09:21:44,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 09:21:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 09:21:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-10 09:21:44,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 09:21:44,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:44,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 30 letters. Loop has 5 letters. [2018-11-10 09:21:44,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:44,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 25 letters. Loop has 10 letters. [2018-11-10 09:21:44,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:44,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 181 transitions. [2018-11-10 09:21:44,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-10 09:21:44,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 105 states and 131 transitions. [2018-11-10 09:21:44,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-10 09:21:44,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-10 09:21:44,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 131 transitions. [2018-11-10 09:21:44,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:44,143 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 131 transitions. [2018-11-10 09:21:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 131 transitions. [2018-11-10 09:21:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 58. [2018-11-10 09:21:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 09:21:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2018-11-10 09:21:44,145 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 72 transitions. [2018-11-10 09:21:44,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:21:44,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:21:44,145 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 5 states. [2018-11-10 09:21:44,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:44,162 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-10 09:21:44,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:21:44,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 90 transitions. [2018-11-10 09:21:44,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-10 09:21:44,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 72 states and 88 transitions. [2018-11-10 09:21:44,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 09:21:44,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 09:21:44,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 88 transitions. [2018-11-10 09:21:44,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:44,164 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-11-10 09:21:44,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 88 transitions. [2018-11-10 09:21:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-10 09:21:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 09:21:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-10 09:21:44,165 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-10 09:21:44,165 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-10 09:21:44,165 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 09:21:44,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 84 transitions. [2018-11-10 09:21:44,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-10 09:21:44,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:44,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:44,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 09:21:44,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 3, 2, 1, 1] [2018-11-10 09:21:44,167 INFO L793 eck$LassoCheckResult]: Stem: 3035#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3025#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3026#L18-1 assume true; 3069#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3083#L12 assume !(main_~i~0 >= 10); 3055#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3051#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3036#L18-1 assume true; 3037#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3057#L12 assume !(main_~i~0 >= 10); 3054#L12-2 assume !(main_~i~0 <= 0); 3050#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3048#L18-1 assume true; 3049#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3085#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3031#L12-2 [2018-11-10 09:21:44,167 INFO L795 eck$LassoCheckResult]: Loop: 3031#L12-2 assume !(main_~i~0 <= 0); 3032#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3038#L18-1 assume true; 3029#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3030#L12 assume !(main_~i~0 >= 10); 3033#L12-2 assume !(main_~i~0 <= 0); 3034#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3046#L18-1 assume true; 3092#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3041#L12 assume !(main_~i~0 >= 10); 3042#L12-2 assume !(main_~i~0 <= 0); 3089#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3088#L18-1 assume true; 3086#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3084#L12 assume !(main_~i~0 >= 10); 3081#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3044#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3045#L18-1 assume true; 3087#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3039#L12 assume !(main_~i~0 >= 10); 3040#L12-2 assume !(main_~i~0 <= 0); 3082#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3047#L18-1 assume true; 3027#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3028#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3031#L12-2 [2018-11-10 09:21:44,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash 830858632, now seen corresponding path program 1 times [2018-11-10 09:21:44,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 09:21:44,222 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:44,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash -18108604, now seen corresponding path program 1 times [2018-11-10 09:21:44,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:44,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,241 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 09:21:44,277 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:44,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:21:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:21:44,277 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-10 09:21:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:44,325 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-10 09:21:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:21:44,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 116 transitions. [2018-11-10 09:21:44,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-10 09:21:44,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 94 states and 114 transitions. [2018-11-10 09:21:44,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 09:21:44,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-10 09:21:44,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 114 transitions. [2018-11-10 09:21:44,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:44,326 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-11-10 09:21:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 114 transitions. [2018-11-10 09:21:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2018-11-10 09:21:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 09:21:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2018-11-10 09:21:44,328 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 95 transitions. [2018-11-10 09:21:44,328 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 95 transitions. [2018-11-10 09:21:44,328 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 09:21:44,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 95 transitions. [2018-11-10 09:21:44,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-10 09:21:44,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:44,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:44,329 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 2, 1, 1, 1, 1] [2018-11-10 09:21:44,329 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 3, 3, 1, 1] [2018-11-10 09:21:44,329 INFO L793 eck$LassoCheckResult]: Stem: 3323#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3315#L18-1 assume true; 3357#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3329#L12 assume !(main_~i~0 >= 10); 3330#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3341#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3324#L18-1 assume true; 3325#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3369#L12 assume !(main_~i~0 >= 10); 3368#L12-2 assume !(main_~i~0 <= 0); 3367#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3366#L18-1 assume true; 3338#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3365#L12 assume !(main_~i~0 >= 10); 3364#L12-2 assume !(main_~i~0 <= 0); 3339#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3336#L18-1 assume true; 3337#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3372#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3320#L12-2 [2018-11-10 09:21:44,329 INFO L795 eck$LassoCheckResult]: Loop: 3320#L12-2 assume !(main_~i~0 <= 0); 3321#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3387#L18-1 assume true; 3386#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3385#L12 assume !(main_~i~0 >= 10); 3382#L12-2 assume !(main_~i~0 <= 0); 3381#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3380#L18-1 assume true; 3379#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3378#L12 assume !(main_~i~0 >= 10); 3374#L12-2 assume !(main_~i~0 <= 0); 3377#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3376#L18-1 assume true; 3375#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3373#L12 assume !(main_~i~0 >= 10); 3370#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3331#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3332#L18-1 assume true; 3316#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3317#L12 assume !(main_~i~0 >= 10); 3389#L12-2 assume !(main_~i~0 <= 0); 3390#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3334#L18-1 assume true; 3335#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3327#L12 assume !(main_~i~0 >= 10); 3328#L12-2 assume !(main_~i~0 <= 0); 3371#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3388#L18-1 assume true; 3383#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3384#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3320#L12-2 [2018-11-10 09:21:44,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1406239909, now seen corresponding path program 2 times [2018-11-10 09:21:44,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:44,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,361 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:44,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:44,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:44,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 09:21:44,406 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:44,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1261607137, now seen corresponding path program 2 times [2018-11-10 09:21:44,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,440 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:44,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:44,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:44,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 09:21:44,473 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:21:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:21:44,473 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. cyclomatic complexity: 21 Second operand 6 states. [2018-11-10 09:21:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:44,502 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2018-11-10 09:21:44,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:21:44,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 133 transitions. [2018-11-10 09:21:44,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2018-11-10 09:21:44,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 109 states and 131 transitions. [2018-11-10 09:21:44,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-10 09:21:44,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-10 09:21:44,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 109 states and 131 transitions. [2018-11-10 09:21:44,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:44,504 INFO L705 BuchiCegarLoop]: Abstraction has 109 states and 131 transitions. [2018-11-10 09:21:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 131 transitions. [2018-11-10 09:21:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2018-11-10 09:21:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 09:21:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2018-11-10 09:21:44,506 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-11-10 09:21:44,506 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 106 transitions. [2018-11-10 09:21:44,506 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 09:21:44,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 106 transitions. [2018-11-10 09:21:44,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-10 09:21:44,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:44,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:44,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 1, 1, 1, 1] [2018-11-10 09:21:44,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 4, 3, 1, 1] [2018-11-10 09:21:44,510 INFO L793 eck$LassoCheckResult]: Stem: 3669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3660#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3661#L18-1 assume true; 3699#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3747#L12 assume !(main_~i~0 >= 10); 3684#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3682#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3670#L18-1 assume true; 3671#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3717#L12 assume !(main_~i~0 >= 10); 3716#L12-2 assume !(main_~i~0 <= 0); 3715#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3714#L18-1 assume true; 3713#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3712#L12 assume !(main_~i~0 >= 10); 3711#L12-2 assume !(main_~i~0 <= 0); 3710#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3709#L18-1 assume true; 3680#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3708#L12 assume !(main_~i~0 >= 10); 3707#L12-2 assume !(main_~i~0 <= 0); 3681#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3678#L18-1 assume true; 3679#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3720#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3666#L12-2 [2018-11-10 09:21:44,510 INFO L795 eck$LassoCheckResult]: Loop: 3666#L12-2 assume !(main_~i~0 <= 0); 3667#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3733#L18-1 assume true; 3732#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3731#L12 assume !(main_~i~0 >= 10); 3730#L12-2 assume !(main_~i~0 <= 0); 3729#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3728#L18-1 assume true; 3727#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3726#L12 assume !(main_~i~0 >= 10); 3722#L12-2 assume !(main_~i~0 <= 0); 3725#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3724#L18-1 assume true; 3723#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3721#L12 assume !(main_~i~0 >= 10); 3718#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3675#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3676#L18-1 assume true; 3662#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3663#L12 assume !(main_~i~0 >= 10); 3673#L12-2 assume !(main_~i~0 <= 0); 3719#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3746#L18-1 assume true; 3745#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3744#L12 assume !(main_~i~0 >= 10); 3743#L12-2 assume !(main_~i~0 <= 0); 3742#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3741#L18-1 assume true; 3740#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3739#L12 assume !(main_~i~0 >= 10); 3738#L12-2 assume !(main_~i~0 <= 0); 3737#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 3736#L18-1 assume true; 3734#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3735#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3666#L12-2 [2018-11-10 09:21:44,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1151963496, now seen corresponding path program 3 times [2018-11-10 09:21:44,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,544 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:21:44,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 09:21:44,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:44,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 09:21:44,600 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:44,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1075535908, now seen corresponding path program 3 times [2018-11-10 09:21:44,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,637 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:21:44,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 09:21:44,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:44,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-10 09:21:44,700 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:44,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:21:44,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:21:44,701 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. cyclomatic complexity: 22 Second operand 7 states. [2018-11-10 09:21:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:44,731 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2018-11-10 09:21:44,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:21:44,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 150 transitions. [2018-11-10 09:21:44,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-10 09:21:44,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 124 states and 148 transitions. [2018-11-10 09:21:44,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 09:21:44,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 09:21:44,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 148 transitions. [2018-11-10 09:21:44,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:44,734 INFO L705 BuchiCegarLoop]: Abstraction has 124 states and 148 transitions. [2018-11-10 09:21:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 148 transitions. [2018-11-10 09:21:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2018-11-10 09:21:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 09:21:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-11-10 09:21:44,736 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-11-10 09:21:44,736 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-11-10 09:21:44,736 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 09:21:44,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 117 transitions. [2018-11-10 09:21:44,737 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-10 09:21:44,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:44,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:44,738 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 1, 1, 1, 1] [2018-11-10 09:21:44,738 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 7, 7, 5, 3, 1, 1] [2018-11-10 09:21:44,738 INFO L793 eck$LassoCheckResult]: Stem: 4072#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4063#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 4064#L18-1 assume true; 4104#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4160#L12 assume !(main_~i~0 >= 10); 4089#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4087#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4073#L18-1 assume true; 4074#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4126#L12 assume !(main_~i~0 >= 10); 4125#L12-2 assume !(main_~i~0 <= 0); 4124#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4123#L18-1 assume true; 4122#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4121#L12 assume !(main_~i~0 >= 10); 4120#L12-2 assume !(main_~i~0 <= 0); 4119#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4118#L18-1 assume true; 4117#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4116#L12 assume !(main_~i~0 >= 10); 4115#L12-2 assume !(main_~i~0 <= 0); 4114#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4113#L18-1 assume true; 4083#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4112#L12 assume !(main_~i~0 >= 10); 4111#L12-2 assume !(main_~i~0 <= 0); 4085#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4082#L18-1 assume true; 4084#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4129#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4069#L12-2 [2018-11-10 09:21:44,738 INFO L795 eck$LassoCheckResult]: Loop: 4069#L12-2 assume !(main_~i~0 <= 0); 4070#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4144#L18-1 assume true; 4143#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4142#L12 assume !(main_~i~0 >= 10); 4139#L12-2 assume !(main_~i~0 <= 0); 4138#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4137#L18-1 assume true; 4136#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4135#L12 assume !(main_~i~0 >= 10); 4131#L12-2 assume !(main_~i~0 <= 0); 4134#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4133#L18-1 assume true; 4132#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4130#L12 assume !(main_~i~0 >= 10); 4127#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4128#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4159#L18-1 assume true; 4158#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4076#L12 assume !(main_~i~0 >= 10); 4077#L12-2 assume !(main_~i~0 <= 0); 4079#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4080#L18-1 assume true; 4065#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4066#L12 assume !(main_~i~0 >= 10); 4157#L12-2 assume !(main_~i~0 <= 0); 4156#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4155#L18-1 assume true; 4154#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4153#L12 assume !(main_~i~0 >= 10); 4152#L12-2 assume !(main_~i~0 <= 0); 4151#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4150#L18-1 assume true; 4149#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4148#L12 assume !(main_~i~0 >= 10); 4147#L12-2 assume !(main_~i~0 <= 0); 4146#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4145#L18-1 assume true; 4140#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4141#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4069#L12-2 [2018-11-10 09:21:44,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1641757563, now seen corresponding path program 4 times [2018-11-10 09:21:44,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,772 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:21:44,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:21:44,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:44,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:44,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 09:21:44,804 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:44,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1406582209, now seen corresponding path program 4 times [2018-11-10 09:21:44,804 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:44,839 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:44,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:21:44,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:21:44,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:44,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 76 proven. 46 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:44,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:44,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 09:21:44,885 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:21:44,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:21:44,885 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. cyclomatic complexity: 23 Second operand 8 states. [2018-11-10 09:21:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:44,966 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2018-11-10 09:21:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:21:44,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 167 transitions. [2018-11-10 09:21:44,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 09:21:44,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 165 transitions. [2018-11-10 09:21:44,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 09:21:44,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 09:21:44,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 165 transitions. [2018-11-10 09:21:44,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:44,970 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 165 transitions. [2018-11-10 09:21:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 165 transitions. [2018-11-10 09:21:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 108. [2018-11-10 09:21:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 09:21:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2018-11-10 09:21:44,971 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 128 transitions. [2018-11-10 09:21:44,971 INFO L608 BuchiCegarLoop]: Abstraction has 108 states and 128 transitions. [2018-11-10 09:21:44,972 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 09:21:44,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 128 transitions. [2018-11-10 09:21:44,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2018-11-10 09:21:44,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:44,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:44,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 5, 1, 1, 1, 1] [2018-11-10 09:21:44,974 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 8, 8, 6, 3, 1, 1] [2018-11-10 09:21:44,974 INFO L793 eck$LassoCheckResult]: Stem: 4532#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4523#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 4524#L18-1 assume true; 4563#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4630#L12 assume !(main_~i~0 >= 10); 4548#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4546#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4533#L18-1 assume true; 4534#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4591#L12 assume !(main_~i~0 >= 10); 4590#L12-2 assume !(main_~i~0 <= 0); 4589#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4588#L18-1 assume true; 4587#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4586#L12 assume !(main_~i~0 >= 10); 4585#L12-2 assume !(main_~i~0 <= 0); 4584#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4583#L18-1 assume true; 4582#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4581#L12 assume !(main_~i~0 >= 10); 4580#L12-2 assume !(main_~i~0 <= 0); 4579#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4578#L18-1 assume true; 4577#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4576#L12 assume !(main_~i~0 >= 10); 4575#L12-2 assume !(main_~i~0 <= 0); 4574#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4573#L18-1 assume true; 4543#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4572#L12 assume !(main_~i~0 >= 10); 4571#L12-2 assume !(main_~i~0 <= 0); 4545#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4542#L18-1 assume true; 4544#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4594#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4529#L12-2 [2018-11-10 09:21:44,975 INFO L795 eck$LassoCheckResult]: Loop: 4529#L12-2 assume !(main_~i~0 <= 0); 4530#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4609#L18-1 assume true; 4608#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4607#L12 assume !(main_~i~0 >= 10); 4604#L12-2 assume !(main_~i~0 <= 0); 4603#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4602#L18-1 assume true; 4601#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4600#L12 assume !(main_~i~0 >= 10); 4596#L12-2 assume !(main_~i~0 <= 0); 4599#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4598#L18-1 assume true; 4597#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4595#L12 assume !(main_~i~0 >= 10); 4592#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4593#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4629#L18-1 assume true; 4628#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4536#L12 assume !(main_~i~0 >= 10); 4537#L12-2 assume !(main_~i~0 <= 0); 4539#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4540#L18-1 assume true; 4525#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4526#L12 assume !(main_~i~0 >= 10); 4627#L12-2 assume !(main_~i~0 <= 0); 4626#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4625#L18-1 assume true; 4624#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4623#L12 assume !(main_~i~0 >= 10); 4622#L12-2 assume !(main_~i~0 <= 0); 4621#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4620#L18-1 assume true; 4619#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4618#L12 assume !(main_~i~0 >= 10); 4617#L12-2 assume !(main_~i~0 <= 0); 4616#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4615#L18-1 assume true; 4614#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4613#L12 assume !(main_~i~0 >= 10); 4612#L12-2 assume !(main_~i~0 <= 0); 4611#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 4610#L18-1 assume true; 4605#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4606#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4529#L12-2 [2018-11-10 09:21:44,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:44,975 INFO L82 PathProgramCache]: Analyzing trace with hash 328197448, now seen corresponding path program 5 times [2018-11-10 09:21:44,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:44,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:44,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,033 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:45,044 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:21:45,052 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-10 09:21:45,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:45,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 23 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 09:21:45,073 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:45,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1786021628, now seen corresponding path program 5 times [2018-11-10 09:21:45,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:45,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 92 proven. 70 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,124 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:21:45,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-10 09:21:45,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:45,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 92 proven. 70 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 09:21:45,172 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:45,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:21:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:21:45,173 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-10 09:21:45,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:45,219 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2018-11-10 09:21:45,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:21:45,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 184 transitions. [2018-11-10 09:21:45,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2018-11-10 09:21:45,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 154 states and 182 transitions. [2018-11-10 09:21:45,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 09:21:45,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-10 09:21:45,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 182 transitions. [2018-11-10 09:21:45,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:45,223 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 182 transitions. [2018-11-10 09:21:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 182 transitions. [2018-11-10 09:21:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 118. [2018-11-10 09:21:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-10 09:21:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-11-10 09:21:45,226 INFO L728 BuchiCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-10 09:21:45,226 INFO L608 BuchiCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-11-10 09:21:45,226 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 09:21:45,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 139 transitions. [2018-11-10 09:21:45,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-10 09:21:45,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:45,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:45,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 7, 7, 6, 1, 1, 1, 1] [2018-11-10 09:21:45,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 9, 9, 7, 3, 1, 1] [2018-11-10 09:21:45,228 INFO L793 eck$LassoCheckResult]: Stem: 5049#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5040#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5041#L18-1 assume true; 5081#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5157#L12 assume !(main_~i~0 >= 10); 5065#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5063#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5050#L18-1 assume true; 5051#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5113#L12 assume !(main_~i~0 >= 10); 5112#L12-2 assume !(main_~i~0 <= 0); 5111#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5110#L18-1 assume true; 5109#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5108#L12 assume !(main_~i~0 >= 10); 5107#L12-2 assume !(main_~i~0 <= 0); 5106#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5105#L18-1 assume true; 5104#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5103#L12 assume !(main_~i~0 >= 10); 5102#L12-2 assume !(main_~i~0 <= 0); 5101#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5100#L18-1 assume true; 5099#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5098#L12 assume !(main_~i~0 >= 10); 5097#L12-2 assume !(main_~i~0 <= 0); 5096#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5095#L18-1 assume true; 5094#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5093#L12 assume !(main_~i~0 >= 10); 5092#L12-2 assume !(main_~i~0 <= 0); 5091#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5090#L18-1 assume true; 5061#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5089#L12 assume !(main_~i~0 >= 10); 5088#L12-2 assume !(main_~i~0 <= 0); 5062#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5059#L18-1 assume true; 5060#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5116#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5046#L12-2 [2018-11-10 09:21:45,228 INFO L795 eck$LassoCheckResult]: Loop: 5046#L12-2 assume !(main_~i~0 <= 0); 5047#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5131#L18-1 assume true; 5130#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5129#L12 assume !(main_~i~0 >= 10); 5126#L12-2 assume !(main_~i~0 <= 0); 5125#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5124#L18-1 assume true; 5123#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5122#L12 assume !(main_~i~0 >= 10); 5118#L12-2 assume !(main_~i~0 <= 0); 5121#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5120#L18-1 assume true; 5119#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5117#L12 assume !(main_~i~0 >= 10); 5114#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5115#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5156#L18-1 assume true; 5155#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5053#L12 assume !(main_~i~0 >= 10); 5054#L12-2 assume !(main_~i~0 <= 0); 5056#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5057#L18-1 assume true; 5042#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5043#L12 assume !(main_~i~0 >= 10); 5154#L12-2 assume !(main_~i~0 <= 0); 5153#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5152#L18-1 assume true; 5151#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5150#L12 assume !(main_~i~0 >= 10); 5149#L12-2 assume !(main_~i~0 <= 0); 5148#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5147#L18-1 assume true; 5146#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5145#L12 assume !(main_~i~0 >= 10); 5144#L12-2 assume !(main_~i~0 <= 0); 5143#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5142#L18-1 assume true; 5141#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5140#L12 assume !(main_~i~0 >= 10); 5139#L12-2 assume !(main_~i~0 <= 0); 5138#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5137#L18-1 assume true; 5136#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5135#L12 assume !(main_~i~0 >= 10); 5134#L12-2 assume !(main_~i~0 <= 0); 5133#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5132#L18-1 assume true; 5127#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5128#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5046#L12-2 [2018-11-10 09:21:45,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash 321803163, now seen corresponding path program 6 times [2018-11-10 09:21:45,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 27 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,307 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:21:45,326 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-10 09:21:45,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:45,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 27 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 09:21:45,357 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:45,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1354386081, now seen corresponding path program 6 times [2018-11-10 09:21:45,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:45,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 108 proven. 99 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,440 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:45,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:21:45,457 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-10 09:21:45,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:45,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 108 proven. 99 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-10 09:21:45,490 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:45,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:21:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:21:45,490 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. cyclomatic complexity: 25 Second operand 10 states. [2018-11-10 09:21:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:45,531 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2018-11-10 09:21:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:21:45,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 201 transitions. [2018-11-10 09:21:45,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-10 09:21:45,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 169 states and 199 transitions. [2018-11-10 09:21:45,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-10 09:21:45,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-10 09:21:45,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 199 transitions. [2018-11-10 09:21:45,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:45,533 INFO L705 BuchiCegarLoop]: Abstraction has 169 states and 199 transitions. [2018-11-10 09:21:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 199 transitions. [2018-11-10 09:21:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2018-11-10 09:21:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 09:21:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2018-11-10 09:21:45,536 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 150 transitions. [2018-11-10 09:21:45,536 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 150 transitions. [2018-11-10 09:21:45,536 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 09:21:45,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 150 transitions. [2018-11-10 09:21:45,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2018-11-10 09:21:45,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:45,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:45,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 8, 7, 1, 1, 1, 1] [2018-11-10 09:21:45,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 10, 10, 8, 3, 1, 1] [2018-11-10 09:21:45,537 INFO L793 eck$LassoCheckResult]: Stem: 5623#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5615#L18-1 assume true; 5655#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5741#L12 assume !(main_~i~0 >= 10); 5640#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5638#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5624#L18-1 assume true; 5625#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5692#L12 assume !(main_~i~0 >= 10); 5691#L12-2 assume !(main_~i~0 <= 0); 5690#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5689#L18-1 assume true; 5688#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5687#L12 assume !(main_~i~0 >= 10); 5686#L12-2 assume !(main_~i~0 <= 0); 5685#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5684#L18-1 assume true; 5683#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5682#L12 assume !(main_~i~0 >= 10); 5681#L12-2 assume !(main_~i~0 <= 0); 5680#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5679#L18-1 assume true; 5678#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5677#L12 assume !(main_~i~0 >= 10); 5676#L12-2 assume !(main_~i~0 <= 0); 5675#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5674#L18-1 assume true; 5673#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5672#L12 assume !(main_~i~0 >= 10); 5671#L12-2 assume !(main_~i~0 <= 0); 5670#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5669#L18-1 assume true; 5668#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5667#L12 assume !(main_~i~0 >= 10); 5666#L12-2 assume !(main_~i~0 <= 0); 5665#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5664#L18-1 assume true; 5635#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5663#L12 assume !(main_~i~0 >= 10); 5662#L12-2 assume !(main_~i~0 <= 0); 5636#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5633#L18-1 assume true; 5634#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5695#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5620#L12-2 [2018-11-10 09:21:45,537 INFO L795 eck$LassoCheckResult]: Loop: 5620#L12-2 assume !(main_~i~0 <= 0); 5621#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5710#L18-1 assume true; 5709#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5708#L12 assume !(main_~i~0 >= 10); 5705#L12-2 assume !(main_~i~0 <= 0); 5704#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5703#L18-1 assume true; 5702#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5701#L12 assume !(main_~i~0 >= 10); 5697#L12-2 assume !(main_~i~0 <= 0); 5700#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 5699#L18-1 assume true; 5698#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5696#L12 assume !(main_~i~0 >= 10); 5693#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 5694#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5740#L18-1 assume true; 5739#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5627#L12 assume !(main_~i~0 >= 10); 5628#L12-2 assume !(main_~i~0 <= 0); 5630#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5631#L18-1 assume true; 5616#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5617#L12 assume !(main_~i~0 >= 10); 5738#L12-2 assume !(main_~i~0 <= 0); 5737#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5736#L18-1 assume true; 5735#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5734#L12 assume !(main_~i~0 >= 10); 5733#L12-2 assume !(main_~i~0 <= 0); 5732#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5731#L18-1 assume true; 5730#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5729#L12 assume !(main_~i~0 >= 10); 5728#L12-2 assume !(main_~i~0 <= 0); 5727#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5726#L18-1 assume true; 5725#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5724#L12 assume !(main_~i~0 >= 10); 5723#L12-2 assume !(main_~i~0 <= 0); 5722#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5721#L18-1 assume true; 5720#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5719#L12 assume !(main_~i~0 >= 10); 5718#L12-2 assume !(main_~i~0 <= 0); 5717#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5716#L18-1 assume true; 5715#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5714#L12 assume !(main_~i~0 >= 10); 5713#L12-2 assume !(main_~i~0 <= 0); 5712#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 5711#L18-1 assume true; 5706#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5707#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 5620#L12-2 [2018-11-10 09:21:45,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1762058536, now seen corresponding path program 7 times [2018-11-10 09:21:45,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:45,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 31 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:45,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 31 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 09:21:45,633 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:45,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1747322396, now seen corresponding path program 7 times [2018-11-10 09:21:45,633 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:45,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 124 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,691 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,712 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 124 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 09:21:45,728 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:45,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:21:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:21:45,729 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. cyclomatic complexity: 26 Second operand 11 states. [2018-11-10 09:21:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:45,775 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2018-11-10 09:21:45,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:21:45,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 218 transitions. [2018-11-10 09:21:45,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-10 09:21:45,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 184 states and 216 transitions. [2018-11-10 09:21:45,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-10 09:21:45,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 09:21:45,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 216 transitions. [2018-11-10 09:21:45,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:45,779 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 216 transitions. [2018-11-10 09:21:45,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 216 transitions. [2018-11-10 09:21:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 138. [2018-11-10 09:21:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-10 09:21:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2018-11-10 09:21:45,782 INFO L728 BuchiCegarLoop]: Abstraction has 138 states and 161 transitions. [2018-11-10 09:21:45,782 INFO L608 BuchiCegarLoop]: Abstraction has 138 states and 161 transitions. [2018-11-10 09:21:45,782 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 09:21:45,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 161 transitions. [2018-11-10 09:21:45,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-10 09:21:45,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:45,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:45,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 8, 1, 1, 1, 1] [2018-11-10 09:21:45,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 11, 11, 9, 3, 1, 1] [2018-11-10 09:21:45,788 INFO L793 eck$LassoCheckResult]: Stem: 6255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 6246#L18-1 assume true; 6284#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6382#L12 assume !(main_~i~0 >= 10); 6269#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6267#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6256#L18-1 assume true; 6257#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6327#L12 assume !(main_~i~0 >= 10); 6326#L12-2 assume !(main_~i~0 <= 0); 6325#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6324#L18-1 assume true; 6323#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6322#L12 assume !(main_~i~0 >= 10); 6321#L12-2 assume !(main_~i~0 <= 0); 6320#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6319#L18-1 assume true; 6318#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6317#L12 assume !(main_~i~0 >= 10); 6316#L12-2 assume !(main_~i~0 <= 0); 6315#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6314#L18-1 assume true; 6313#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6312#L12 assume !(main_~i~0 >= 10); 6311#L12-2 assume !(main_~i~0 <= 0); 6310#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6309#L18-1 assume true; 6308#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6307#L12 assume !(main_~i~0 >= 10); 6306#L12-2 assume !(main_~i~0 <= 0); 6305#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6304#L18-1 assume true; 6303#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6302#L12 assume !(main_~i~0 >= 10); 6301#L12-2 assume !(main_~i~0 <= 0); 6300#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6299#L18-1 assume true; 6298#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6297#L12 assume !(main_~i~0 >= 10); 6296#L12-2 assume !(main_~i~0 <= 0); 6295#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6294#L18-1 assume true; 6265#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6293#L12 assume !(main_~i~0 >= 10); 6292#L12-2 assume !(main_~i~0 <= 0); 6266#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6263#L18-1 assume true; 6264#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6333#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6332#L12-2 [2018-11-10 09:21:45,788 INFO L795 eck$LassoCheckResult]: Loop: 6332#L12-2 assume !(main_~i~0 <= 0); 6250#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6331#L18-1 assume true; 6330#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6328#L12 assume !(main_~i~0 >= 10); 6329#L12-2 assume !(main_~i~0 <= 0); 6381#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6380#L18-1 assume true; 6379#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6378#L12 assume !(main_~i~0 >= 10); 6374#L12-2 assume !(main_~i~0 <= 0); 6377#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6376#L18-1 assume true; 6375#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6373#L12 assume !(main_~i~0 >= 10); 6247#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6248#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6261#L18-1 assume true; 6251#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6252#L12 assume !(main_~i~0 >= 10); 6259#L12-2 assume !(main_~i~0 <= 0); 6371#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6372#L18-1 assume true; 6370#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6369#L12 assume !(main_~i~0 >= 10); 6368#L12-2 assume !(main_~i~0 <= 0); 6367#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6366#L18-1 assume true; 6365#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6364#L12 assume !(main_~i~0 >= 10); 6363#L12-2 assume !(main_~i~0 <= 0); 6362#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6361#L18-1 assume true; 6360#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6359#L12 assume !(main_~i~0 >= 10); 6358#L12-2 assume !(main_~i~0 <= 0); 6357#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6356#L18-1 assume true; 6355#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6354#L12 assume !(main_~i~0 >= 10); 6353#L12-2 assume !(main_~i~0 <= 0); 6352#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6351#L18-1 assume true; 6350#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6349#L12 assume !(main_~i~0 >= 10); 6348#L12-2 assume !(main_~i~0 <= 0); 6347#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6346#L18-1 assume true; 6345#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6344#L12 assume !(main_~i~0 >= 10); 6343#L12-2 assume !(main_~i~0 <= 0); 6342#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6341#L18-1 assume true; 6340#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6339#L12 assume !(main_~i~0 >= 10); 6338#L12-2 assume !(main_~i~0 <= 0); 6337#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 6336#L18-1 assume true; 6334#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6335#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6332#L12-2 [2018-11-10 09:21:45,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2045131845, now seen corresponding path program 8 times [2018-11-10 09:21:45,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:45,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 35 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,877 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:45,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:45,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:45,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:45,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 35 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:21:45,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:45,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 09:21:45,925 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:21:45,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:45,925 INFO L82 PathProgramCache]: Analyzing trace with hash -666582913, now seen corresponding path program 8 times [2018-11-10 09:21:45,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:45,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:45,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 140 proven. 172 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:45,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:45,998 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:46,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:46,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:46,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:46,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 140 proven. 172 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 09:21:46,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:46,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 09:21:46,063 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:21:46,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 09:21:46,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 09:21:46,063 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. cyclomatic complexity: 27 Second operand 12 states. [2018-11-10 09:21:46,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:46,192 INFO L93 Difference]: Finished difference Result 285 states and 326 transitions. [2018-11-10 09:21:46,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:21:46,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 326 transitions. [2018-11-10 09:21:46,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 108 [2018-11-10 09:21:46,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 281 states and 322 transitions. [2018-11-10 09:21:46,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-10 09:21:46,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2018-11-10 09:21:46,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 281 states and 322 transitions. [2018-11-10 09:21:46,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:46,196 INFO L705 BuchiCegarLoop]: Abstraction has 281 states and 322 transitions. [2018-11-10 09:21:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states and 322 transitions. [2018-11-10 09:21:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 221. [2018-11-10 09:21:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 09:21:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 254 transitions. [2018-11-10 09:21:46,200 INFO L728 BuchiCegarLoop]: Abstraction has 221 states and 254 transitions. [2018-11-10 09:21:46,200 INFO L608 BuchiCegarLoop]: Abstraction has 221 states and 254 transitions. [2018-11-10 09:21:46,200 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 09:21:46,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 254 transitions. [2018-11-10 09:21:46,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:46,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:46,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:46,202 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:46,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 12, 12, 10, 3, 1, 1] [2018-11-10 09:21:46,202 INFO L793 eck$LassoCheckResult]: Stem: 7027#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7017#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 7018#L18-1 assume true; 7021#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7022#L12 assume !(main_~i~0 >= 10); 7025#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 7026#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7040#L18-1 assume true; 7147#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7146#L12 assume !(main_~i~0 >= 10); 7145#L12-2 assume !(main_~i~0 <= 0); 7144#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7143#L18-1 assume true; 7142#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7141#L12 assume !(main_~i~0 >= 10); 7140#L12-2 assume !(main_~i~0 <= 0); 7139#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7138#L18-1 assume true; 7137#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7136#L12 assume !(main_~i~0 >= 10); 7135#L12-2 assume !(main_~i~0 <= 0); 7134#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7133#L18-1 assume true; 7132#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7131#L12 assume !(main_~i~0 >= 10); 7130#L12-2 assume !(main_~i~0 <= 0); 7129#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7128#L18-1 assume true; 7127#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7126#L12 assume !(main_~i~0 >= 10); 7125#L12-2 assume !(main_~i~0 <= 0); 7124#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7123#L18-1 assume true; 7122#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7121#L12 assume !(main_~i~0 >= 10); 7120#L12-2 assume !(main_~i~0 <= 0); 7119#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7118#L18-1 assume true; 7117#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7116#L12 assume !(main_~i~0 >= 10); 7115#L12-2 assume !(main_~i~0 <= 0); 7114#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7113#L18-1 assume true; 7112#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7111#L12 assume !(main_~i~0 >= 10); 7110#L12-2 assume !(main_~i~0 <= 0); 7109#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7108#L18-1 assume true; 7054#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7057#L12 assume !(main_~i~0 >= 10); 7056#L12-2 assume !(main_~i~0 <= 0); 7055#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7052#L18-1 assume true; 7053#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7048#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 7049#L12-2 [2018-11-10 09:21:46,202 INFO L795 eck$LassoCheckResult]: Loop: 7049#L12-2 assume !(main_~i~0 <= 0); 7036#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 7037#L18-1 assume true; 7042#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7043#L12 assume !(main_~i~0 >= 10); 7165#L12-2 assume !(main_~i~0 <= 0); 7163#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 7161#L18-1 assume true; 7159#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7157#L12 assume !(main_~i~0 >= 10); 7153#L12-2 assume !(main_~i~0 <= 0); 7154#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 7193#L18-1 assume true; 7192#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7155#L12 assume !(main_~i~0 >= 10); 7107#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 7061#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7106#L18-1 assume true; 7105#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7104#L12 assume !(main_~i~0 >= 10); 7103#L12-2 assume !(main_~i~0 <= 0); 7102#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7101#L18-1 assume true; 7100#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7099#L12 assume !(main_~i~0 >= 10); 7098#L12-2 assume !(main_~i~0 <= 0); 7097#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7096#L18-1 assume true; 7095#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7094#L12 assume !(main_~i~0 >= 10); 7093#L12-2 assume !(main_~i~0 <= 0); 7092#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7091#L18-1 assume true; 7090#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7089#L12 assume !(main_~i~0 >= 10); 7088#L12-2 assume !(main_~i~0 <= 0); 7087#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7086#L18-1 assume true; 7085#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7084#L12 assume !(main_~i~0 >= 10); 7083#L12-2 assume !(main_~i~0 <= 0); 7082#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7081#L18-1 assume true; 7080#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7079#L12 assume !(main_~i~0 >= 10); 7078#L12-2 assume !(main_~i~0 <= 0); 7077#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7076#L18-1 assume true; 7075#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7074#L12 assume !(main_~i~0 >= 10); 7073#L12-2 assume !(main_~i~0 <= 0); 7072#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7071#L18-1 assume true; 7070#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7069#L12 assume !(main_~i~0 >= 10); 7068#L12-2 assume !(main_~i~0 <= 0); 7067#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7066#L18-1 assume true; 7064#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7062#L12 assume !(main_~i~0 >= 10); 7060#L12-2 assume !(main_~i~0 <= 0); 7058#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 7059#L18-1 assume true; 7065#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7063#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 7049#L12-2 [2018-11-10 09:21:46,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:46,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 9 times [2018-11-10 09:21:46,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:46,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:46,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 841278148, now seen corresponding path program 9 times [2018-11-10 09:21:46,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:46,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:46,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 273528477, now seen corresponding path program 3 times [2018-11-10 09:21:46,221 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:46,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:46,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:46,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 845 proven. 18 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:46,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:46,273 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:21:46,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-10 09:21:46,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:46,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 1037 proven. 30 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2018-11-10 09:21:46,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:46,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13] total 13 [2018-11-10 09:21:46,531 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 55 [2018-11-10 09:21:46,538 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:46,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:46,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:46,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:46,538 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:46,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:46,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:46,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:46,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-10 09:21:46,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:46,538 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:46,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,570 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:46,570 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:46,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:46,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:46,589 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:46,589 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:46,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:46,592 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:46,594 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:46,594 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:46,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:46,611 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:46,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:46,629 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:46,632 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:46,646 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:46,646 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:46,646 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:46,646 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:46,646 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:46,646 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:46,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:46,646 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:46,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-10 09:21:46,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:46,646 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:46,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:46,677 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:46,677 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:46,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:46,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:46,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:46,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:46,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:46,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:46,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:46,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:46,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:46,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:46,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:46,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:46,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:46,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:46,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:46,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:46,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:46,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:46,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:46,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:46,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:46,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:46,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:46,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:46,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:46,686 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:46,686 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:46,687 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:46,687 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:46,687 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:46,687 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:46,687 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2018-11-10 09:21:46,687 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:46,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:46,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:46,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:46,790 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-10 09:21:46,790 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 221 states and 254 transitions. cyclomatic complexity: 37 Second operand 7 states. [2018-11-10 09:21:46,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 221 states and 254 transitions. cyclomatic complexity: 37. Second operand 7 states. Result 853 states and 956 transitions. Complement of second has 19 states. [2018-11-10 09:21:46,946 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-11-10 09:21:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 09:21:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2018-11-10 09:21:46,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 55 letters. Loop has 65 letters. [2018-11-10 09:21:46,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:46,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 120 letters. Loop has 65 letters. [2018-11-10 09:21:46,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:46,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 57 transitions. Stem has 55 letters. Loop has 130 letters. [2018-11-10 09:21:46,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:46,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 853 states and 956 transitions. [2018-11-10 09:21:46,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2018-11-10 09:21:46,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 853 states to 716 states and 803 transitions. [2018-11-10 09:21:46,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2018-11-10 09:21:46,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2018-11-10 09:21:46,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 716 states and 803 transitions. [2018-11-10 09:21:46,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:46,954 INFO L705 BuchiCegarLoop]: Abstraction has 716 states and 803 transitions. [2018-11-10 09:21:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states and 803 transitions. [2018-11-10 09:21:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 656. [2018-11-10 09:21:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-10 09:21:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 738 transitions. [2018-11-10 09:21:46,961 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 738 transitions. [2018-11-10 09:21:46,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:21:46,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:21:46,961 INFO L87 Difference]: Start difference. First operand 656 states and 738 transitions. Second operand 13 states. [2018-11-10 09:21:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:46,982 INFO L93 Difference]: Finished difference Result 378 states and 422 transitions. [2018-11-10 09:21:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:21:46,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 378 states and 422 transitions. [2018-11-10 09:21:46,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:46,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 378 states to 346 states and 390 transitions. [2018-11-10 09:21:46,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2018-11-10 09:21:46,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2018-11-10 09:21:46,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 346 states and 390 transitions. [2018-11-10 09:21:46,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:46,986 INFO L705 BuchiCegarLoop]: Abstraction has 346 states and 390 transitions. [2018-11-10 09:21:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states and 390 transitions. [2018-11-10 09:21:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 226. [2018-11-10 09:21:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-10 09:21:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 258 transitions. [2018-11-10 09:21:46,990 INFO L728 BuchiCegarLoop]: Abstraction has 226 states and 258 transitions. [2018-11-10 09:21:46,990 INFO L608 BuchiCegarLoop]: Abstraction has 226 states and 258 transitions. [2018-11-10 09:21:46,990 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 09:21:46,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 258 transitions. [2018-11-10 09:21:46,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:46,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:46,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:46,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:46,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 14, 13, 13, 10, 4, 1, 1] [2018-11-10 09:21:46,992 INFO L793 eck$LassoCheckResult]: Stem: 9912#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9902#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 9903#L18-1 assume true; 9981#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9923#L12 assume !(main_~i~0 >= 10); 9924#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10092#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 9927#L18-1 assume true; 9906#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9907#L12 assume !(main_~i~0 >= 10); 9910#L12-2 assume !(main_~i~0 <= 0); 9911#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 9925#L18-1 assume true; 10087#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10086#L12 assume !(main_~i~0 >= 10); 10085#L12-2 assume !(main_~i~0 <= 0); 10084#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10083#L18-1 assume true; 10082#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10081#L12 assume !(main_~i~0 >= 10); 10080#L12-2 assume !(main_~i~0 <= 0); 10079#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10078#L18-1 assume true; 10077#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10076#L12 assume !(main_~i~0 >= 10); 10075#L12-2 assume !(main_~i~0 <= 0); 10074#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10073#L18-1 assume true; 10072#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10071#L12 assume !(main_~i~0 >= 10); 10070#L12-2 assume !(main_~i~0 <= 0); 10069#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10068#L18-1 assume true; 10067#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10066#L12 assume !(main_~i~0 >= 10); 10065#L12-2 assume !(main_~i~0 <= 0); 10064#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10063#L18-1 assume true; 10062#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10061#L12 assume !(main_~i~0 >= 10); 10060#L12-2 assume !(main_~i~0 <= 0); 10059#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10058#L18-1 assume true; 10057#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10056#L12 assume !(main_~i~0 >= 10); 10055#L12-2 assume !(main_~i~0 <= 0); 10054#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10053#L18-1 assume true; 9998#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10052#L12 assume !(main_~i~0 >= 10); 10051#L12-2 assume !(main_~i~0 <= 0); 10050#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 9997#L18-1 assume true; 9996#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9995#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 9988#L12-2 [2018-11-10 09:21:46,992 INFO L795 eck$LassoCheckResult]: Loop: 9988#L12-2 assume !(main_~i~0 <= 0); 9987#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 9932#L18-1 assume true; 9933#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9918#L12 assume !(main_~i~0 >= 10); 9919#L12-2 assume !(main_~i~0 <= 0); 10095#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10091#L18-1 assume true; 10088#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10089#L12 assume !(main_~i~0 >= 10); 10096#L12-2 assume !(main_~i~0 <= 0); 10099#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10098#L18-1 assume true; 10097#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9916#L12 assume !(main_~i~0 >= 10); 9917#L12-2 assume !(main_~i~0 <= 0); 10127#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10126#L18-1 assume true; 10125#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10100#L12 assume !(main_~i~0 >= 10); 10048#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10003#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10047#L18-1 assume true; 10046#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10045#L12 assume !(main_~i~0 >= 10); 10044#L12-2 assume !(main_~i~0 <= 0); 10043#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10042#L18-1 assume true; 10041#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10040#L12 assume !(main_~i~0 >= 10); 10039#L12-2 assume !(main_~i~0 <= 0); 10038#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10037#L18-1 assume true; 10036#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10035#L12 assume !(main_~i~0 >= 10); 10034#L12-2 assume !(main_~i~0 <= 0); 10033#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10032#L18-1 assume true; 10031#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10030#L12 assume !(main_~i~0 >= 10); 10029#L12-2 assume !(main_~i~0 <= 0); 10028#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10027#L18-1 assume true; 10026#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10025#L12 assume !(main_~i~0 >= 10); 10024#L12-2 assume !(main_~i~0 <= 0); 10023#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10022#L18-1 assume true; 10021#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10020#L12 assume !(main_~i~0 >= 10); 10019#L12-2 assume !(main_~i~0 <= 0); 10018#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10017#L18-1 assume true; 10016#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10015#L12 assume !(main_~i~0 >= 10); 10014#L12-2 assume !(main_~i~0 <= 0); 10013#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10012#L18-1 assume true; 10011#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10010#L12 assume !(main_~i~0 >= 10); 10009#L12-2 assume !(main_~i~0 <= 0); 10008#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 10007#L18-1 assume true; 10006#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10004#L12 assume !(main_~i~0 >= 10); 10002#L12-2 assume !(main_~i~0 <= 0); 10001#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 9999#L18-1 assume true; 10000#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10005#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 9988#L12-2 [2018-11-10 09:21:46,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 10 times [2018-11-10 09:21:46,992 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:46,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:46,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:47,001 INFO L82 PathProgramCache]: Analyzing trace with hash 575979297, now seen corresponding path program 10 times [2018-11-10 09:21:47,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:47,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:47,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:47,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1577282280, now seen corresponding path program 4 times [2018-11-10 09:21:47,010 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:47,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:47,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 947 proven. 34 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:47,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:47,065 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:47,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:21:47,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:21:47,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:47,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 947 proven. 34 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:47,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:47,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-10 09:21:47,279 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 58 [2018-11-10 09:21:47,291 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:47,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:47,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:47,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:47,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:47,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:47,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:47,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:47,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-10 09:21:47,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:47,291 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:47,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,338 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:47,338 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:47,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:47,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:47,357 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:47,357 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:47,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:47,359 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:47,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:47,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:47,380 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:47,394 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:47,394 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:47,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:47,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:47,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:47,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:47,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:47,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:47,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-10 09:21:47,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:47,395 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:47,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:47,423 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:47,423 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:47,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-11-10 09:21:47,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:47,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:47,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:47,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:47,425 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:47,425 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:47,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:47,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:47,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:47,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:47,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:47,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:47,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:47,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:47,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:47,429 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:47,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:47,430 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:47,430 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:47,430 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:47,430 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:47,430 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2018-11-10 09:21:47,430 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:47,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:47,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:47,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:47,514 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-11-10 09:21:47,514 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 258 transitions. cyclomatic complexity: 36 Second operand 8 states. [2018-11-10 09:21:47,641 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 258 transitions. cyclomatic complexity: 36. Second operand 8 states. Result 1039 states and 1154 transitions. Complement of second has 23 states. [2018-11-10 09:21:47,641 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-11-10 09:21:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 09:21:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2018-11-10 09:21:47,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 55 letters. Loop has 70 letters. [2018-11-10 09:21:47,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:47,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 125 letters. Loop has 70 letters. [2018-11-10 09:21:47,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:47,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 55 letters. Loop has 140 letters. [2018-11-10 09:21:47,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:47,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1039 states and 1154 transitions. [2018-11-10 09:21:47,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2018-11-10 09:21:47,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1039 states to 821 states and 916 transitions. [2018-11-10 09:21:47,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2018-11-10 09:21:47,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 333 [2018-11-10 09:21:47,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 821 states and 916 transitions. [2018-11-10 09:21:47,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:47,651 INFO L705 BuchiCegarLoop]: Abstraction has 821 states and 916 transitions. [2018-11-10 09:21:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states and 916 transitions. [2018-11-10 09:21:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 725. [2018-11-10 09:21:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-11-10 09:21:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 813 transitions. [2018-11-10 09:21:47,661 INFO L728 BuchiCegarLoop]: Abstraction has 725 states and 813 transitions. [2018-11-10 09:21:47,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:21:47,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:21:47,661 INFO L87 Difference]: Start difference. First operand 725 states and 813 transitions. Second operand 7 states. [2018-11-10 09:21:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:47,695 INFO L93 Difference]: Finished difference Result 398 states and 440 transitions. [2018-11-10 09:21:47,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:21:47,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 440 transitions. [2018-11-10 09:21:47,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:47,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 356 states and 398 transitions. [2018-11-10 09:21:47,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2018-11-10 09:21:47,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2018-11-10 09:21:47,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 398 transitions. [2018-11-10 09:21:47,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:47,698 INFO L705 BuchiCegarLoop]: Abstraction has 356 states and 398 transitions. [2018-11-10 09:21:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 398 transitions. [2018-11-10 09:21:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 231. [2018-11-10 09:21:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-11-10 09:21:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 262 transitions. [2018-11-10 09:21:47,702 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 262 transitions. [2018-11-10 09:21:47,702 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 262 transitions. [2018-11-10 09:21:47,702 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 09:21:47,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 262 transitions. [2018-11-10 09:21:47,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:47,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:47,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:47,704 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:47,704 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 15, 14, 14, 10, 5, 1, 1] [2018-11-10 09:21:47,704 INFO L793 eck$LassoCheckResult]: Stem: 13109#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13099#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 13100#L18-1 assume true; 13172#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13293#L12 assume !(main_~i~0 >= 10); 13291#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 13292#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13124#L18-1 assume true; 13103#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13104#L12 assume !(main_~i~0 >= 10); 13107#L12-2 assume !(main_~i~0 <= 0); 13108#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13122#L18-1 assume true; 13289#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13288#L12 assume !(main_~i~0 >= 10); 13287#L12-2 assume !(main_~i~0 <= 0); 13286#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13285#L18-1 assume true; 13284#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13283#L12 assume !(main_~i~0 >= 10); 13282#L12-2 assume !(main_~i~0 <= 0); 13281#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13280#L18-1 assume true; 13279#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13278#L12 assume !(main_~i~0 >= 10); 13277#L12-2 assume !(main_~i~0 <= 0); 13276#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13275#L18-1 assume true; 13274#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13273#L12 assume !(main_~i~0 >= 10); 13272#L12-2 assume !(main_~i~0 <= 0); 13271#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13270#L18-1 assume true; 13269#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13268#L12 assume !(main_~i~0 >= 10); 13267#L12-2 assume !(main_~i~0 <= 0); 13266#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13265#L18-1 assume true; 13264#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13263#L12 assume !(main_~i~0 >= 10); 13262#L12-2 assume !(main_~i~0 <= 0); 13261#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13260#L18-1 assume true; 13259#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13258#L12 assume !(main_~i~0 >= 10); 13257#L12-2 assume !(main_~i~0 <= 0); 13256#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13255#L18-1 assume true; 13200#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13254#L12 assume !(main_~i~0 >= 10); 13253#L12-2 assume !(main_~i~0 <= 0); 13252#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13199#L18-1 assume true; 13198#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13197#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 13184#L12-2 [2018-11-10 09:21:47,704 INFO L795 eck$LassoCheckResult]: Loop: 13184#L12-2 assume !(main_~i~0 <= 0); 13185#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13129#L18-1 assume true; 13130#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13115#L12 assume !(main_~i~0 >= 10); 13116#L12-2 assume !(main_~i~0 <= 0); 13298#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13299#L18-1 assume true; 13294#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13295#L12 assume !(main_~i~0 >= 10); 13300#L12-2 assume !(main_~i~0 <= 0); 13306#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13296#L18-1 assume true; 13297#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13305#L12 assume !(main_~i~0 >= 10); 13304#L12-2 assume !(main_~i~0 <= 0); 13303#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13302#L18-1 assume true; 13301#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13113#L12 assume !(main_~i~0 >= 10); 13114#L12-2 assume !(main_~i~0 <= 0); 13329#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 13328#L18-1 assume true; 13327#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13307#L12 assume !(main_~i~0 >= 10); 13250#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 13205#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13249#L18-1 assume true; 13248#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13247#L12 assume !(main_~i~0 >= 10); 13246#L12-2 assume !(main_~i~0 <= 0); 13245#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13244#L18-1 assume true; 13243#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13242#L12 assume !(main_~i~0 >= 10); 13241#L12-2 assume !(main_~i~0 <= 0); 13240#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13239#L18-1 assume true; 13238#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13237#L12 assume !(main_~i~0 >= 10); 13236#L12-2 assume !(main_~i~0 <= 0); 13235#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13234#L18-1 assume true; 13233#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13232#L12 assume !(main_~i~0 >= 10); 13231#L12-2 assume !(main_~i~0 <= 0); 13230#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13229#L18-1 assume true; 13228#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13227#L12 assume !(main_~i~0 >= 10); 13226#L12-2 assume !(main_~i~0 <= 0); 13225#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13224#L18-1 assume true; 13223#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13222#L12 assume !(main_~i~0 >= 10); 13221#L12-2 assume !(main_~i~0 <= 0); 13220#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13219#L18-1 assume true; 13218#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13217#L12 assume !(main_~i~0 >= 10); 13216#L12-2 assume !(main_~i~0 <= 0); 13215#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13214#L18-1 assume true; 13213#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13212#L12 assume !(main_~i~0 >= 10); 13211#L12-2 assume !(main_~i~0 <= 0); 13210#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13209#L18-1 assume true; 13208#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13206#L12 assume !(main_~i~0 >= 10); 13204#L12-2 assume !(main_~i~0 <= 0); 13203#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 13201#L18-1 assume true; 13202#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 13184#L12-2 [2018-11-10 09:21:47,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 11 times [2018-11-10 09:21:47,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:47,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:47,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash 6362340, now seen corresponding path program 11 times [2018-11-10 09:21:47,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:47,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:47,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:47,722 INFO L82 PathProgramCache]: Analyzing trace with hash 28945789, now seen corresponding path program 5 times [2018-11-10 09:21:47,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:47,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:47,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:47,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 1049 proven. 55 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:47,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:47,778 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:21:47,845 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2018-11-10 09:21:47,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:47,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 1049 proven. 55 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:47,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:47,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 09:21:48,153 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 61 [2018-11-10 09:21:48,162 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:48,162 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:48,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:48,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:48,163 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:48,163 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:48,163 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:48,163 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:48,163 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-10 09:21:48,163 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:48,163 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:48,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,195 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:48,196 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:48,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:48,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:48,215 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:48,215 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:48,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:48,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:48,234 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:48,234 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:48,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:48,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:48,240 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:48,240 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:48,256 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:48,256 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:48,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:48,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:48,276 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:48,290 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:48,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:48,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:48,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:48,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:48,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:48,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:48,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:48,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-10 09:21:48,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:48,291 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:48,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:48,322 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:48,322 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:48,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:48,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:48,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:48,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:48,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:48,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:48,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:48,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:48,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:48,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:48,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:48,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:48,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:48,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:48,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:48,327 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:48,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:48,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:48,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:48,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:48,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:48,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:48,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:48,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:48,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:48,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:48,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:48,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:48,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:48,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:48,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:48,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:48,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:48,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:48,331 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:48,331 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:48,331 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:48,331 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:48,331 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:48,332 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2018-11-10 09:21:48,332 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:48,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:48,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:48,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:48,428 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-11-10 09:21:48,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 231 states and 262 transitions. cyclomatic complexity: 35 Second operand 9 states. [2018-11-10 09:21:48,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 231 states and 262 transitions. cyclomatic complexity: 35. Second operand 9 states. Result 1265 states and 1394 transitions. Complement of second has 27 states. [2018-11-10 09:21:48,690 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-11-10 09:21:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:21:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-10 09:21:48,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 81 transitions. Stem has 55 letters. Loop has 75 letters. [2018-11-10 09:21:48,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:48,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 81 transitions. Stem has 130 letters. Loop has 75 letters. [2018-11-10 09:21:48,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:48,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 81 transitions. Stem has 55 letters. Loop has 150 letters. [2018-11-10 09:21:48,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:48,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1265 states and 1394 transitions. [2018-11-10 09:21:48,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2018-11-10 09:21:48,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1265 states to 946 states and 1050 transitions. [2018-11-10 09:21:48,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-10 09:21:48,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2018-11-10 09:21:48,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1050 transitions. [2018-11-10 09:21:48,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:48,699 INFO L705 BuchiCegarLoop]: Abstraction has 946 states and 1050 transitions. [2018-11-10 09:21:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1050 transitions. [2018-11-10 09:21:48,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 804. [2018-11-10 09:21:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-10 09:21:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 899 transitions. [2018-11-10 09:21:48,708 INFO L728 BuchiCegarLoop]: Abstraction has 804 states and 899 transitions. [2018-11-10 09:21:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:21:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:21:48,708 INFO L87 Difference]: Start difference. First operand 804 states and 899 transitions. Second operand 8 states. [2018-11-10 09:21:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:48,741 INFO L93 Difference]: Finished difference Result 418 states and 458 transitions. [2018-11-10 09:21:48,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:21:48,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 458 transitions. [2018-11-10 09:21:48,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:48,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 366 states and 406 transitions. [2018-11-10 09:21:48,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 243 [2018-11-10 09:21:48,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 243 [2018-11-10 09:21:48,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 406 transitions. [2018-11-10 09:21:48,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:48,744 INFO L705 BuchiCegarLoop]: Abstraction has 366 states and 406 transitions. [2018-11-10 09:21:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 406 transitions. [2018-11-10 09:21:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 236. [2018-11-10 09:21:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-10 09:21:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 266 transitions. [2018-11-10 09:21:48,749 INFO L728 BuchiCegarLoop]: Abstraction has 236 states and 266 transitions. [2018-11-10 09:21:48,749 INFO L608 BuchiCegarLoop]: Abstraction has 236 states and 266 transitions. [2018-11-10 09:21:48,749 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 09:21:48,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 236 states and 266 transitions. [2018-11-10 09:21:48,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:48,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:48,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:48,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:48,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 16, 15, 15, 10, 6, 1, 1] [2018-11-10 09:21:48,751 INFO L793 eck$LassoCheckResult]: Stem: 16675#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 16666#L18-1 assume true; 16701#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16798#L12 assume !(main_~i~0 >= 10); 16669#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 16670#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16689#L18-1 assume true; 16797#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16796#L12 assume !(main_~i~0 >= 10); 16795#L12-2 assume !(main_~i~0 <= 0); 16794#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16793#L18-1 assume true; 16792#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16791#L12 assume !(main_~i~0 >= 10); 16790#L12-2 assume !(main_~i~0 <= 0); 16789#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16788#L18-1 assume true; 16787#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16786#L12 assume !(main_~i~0 >= 10); 16785#L12-2 assume !(main_~i~0 <= 0); 16784#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16783#L18-1 assume true; 16782#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16781#L12 assume !(main_~i~0 >= 10); 16780#L12-2 assume !(main_~i~0 <= 0); 16779#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16778#L18-1 assume true; 16777#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16776#L12 assume !(main_~i~0 >= 10); 16775#L12-2 assume !(main_~i~0 <= 0); 16774#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16773#L18-1 assume true; 16772#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16771#L12 assume !(main_~i~0 >= 10); 16770#L12-2 assume !(main_~i~0 <= 0); 16769#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16768#L18-1 assume true; 16767#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16766#L12 assume !(main_~i~0 >= 10); 16765#L12-2 assume !(main_~i~0 <= 0); 16764#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16763#L18-1 assume true; 16762#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16761#L12 assume !(main_~i~0 >= 10); 16760#L12-2 assume !(main_~i~0 <= 0); 16759#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16758#L18-1 assume true; 16703#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16757#L12 assume !(main_~i~0 >= 10); 16756#L12-2 assume !(main_~i~0 <= 0); 16755#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16702#L18-1 assume true; 16699#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16695#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 16696#L12-2 [2018-11-10 09:21:48,751 INFO L795 eck$LassoCheckResult]: Loop: 16696#L12-2 assume !(main_~i~0 <= 0); 16684#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 16685#L18-1 assume true; 16691#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16692#L12 assume !(main_~i~0 >= 10); 16842#L12-2 assume !(main_~i~0 <= 0); 16841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 16840#L18-1 assume true; 16839#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16838#L12 assume !(main_~i~0 >= 10); 16837#L12-2 assume !(main_~i~0 <= 0); 16836#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 16835#L18-1 assume true; 16834#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16833#L12 assume !(main_~i~0 >= 10); 16832#L12-2 assume !(main_~i~0 <= 0); 16831#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 16830#L18-1 assume true; 16829#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16828#L12 assume !(main_~i~0 >= 10); 16827#L12-2 assume !(main_~i~0 <= 0); 16826#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 16825#L18-1 assume true; 16824#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16807#L12 assume !(main_~i~0 >= 10); 16808#L12-2 assume !(main_~i~0 <= 0); 16803#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 16801#L18-1 assume true; 16802#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16806#L12 assume !(main_~i~0 >= 10); 16753#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 16707#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16752#L18-1 assume true; 16751#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16750#L12 assume !(main_~i~0 >= 10); 16749#L12-2 assume !(main_~i~0 <= 0); 16748#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16747#L18-1 assume true; 16746#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16745#L12 assume !(main_~i~0 >= 10); 16744#L12-2 assume !(main_~i~0 <= 0); 16743#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16742#L18-1 assume true; 16741#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16740#L12 assume !(main_~i~0 >= 10); 16739#L12-2 assume !(main_~i~0 <= 0); 16738#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16737#L18-1 assume true; 16736#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16735#L12 assume !(main_~i~0 >= 10); 16734#L12-2 assume !(main_~i~0 <= 0); 16733#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16732#L18-1 assume true; 16731#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16730#L12 assume !(main_~i~0 >= 10); 16729#L12-2 assume !(main_~i~0 <= 0); 16728#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16727#L18-1 assume true; 16726#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16725#L12 assume !(main_~i~0 >= 10); 16724#L12-2 assume !(main_~i~0 <= 0); 16723#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16722#L18-1 assume true; 16721#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16720#L12 assume !(main_~i~0 >= 10); 16719#L12-2 assume !(main_~i~0 <= 0); 16718#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16717#L18-1 assume true; 16716#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16715#L12 assume !(main_~i~0 >= 10); 16714#L12-2 assume !(main_~i~0 <= 0); 16713#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16712#L18-1 assume true; 16710#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16708#L12 assume !(main_~i~0 >= 10); 16706#L12-2 assume !(main_~i~0 <= 0); 16704#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 16705#L18-1 assume true; 16711#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 16709#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 16696#L12-2 [2018-11-10 09:21:48,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 12 times [2018-11-10 09:21:48,751 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:48,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:48,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:48,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:48,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1652744449, now seen corresponding path program 12 times [2018-11-10 09:21:48,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:48,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:48,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:48,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:48,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:48,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash -572604408, now seen corresponding path program 6 times [2018-11-10 09:21:48,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:48,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:48,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 1151 proven. 81 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:48,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:48,830 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:48,840 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 09:21:48,887 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-11-10 09:21:48,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:48,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 1274 proven. 147 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 09:21:48,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:48,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 13 [2018-11-10 09:21:49,133 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 65 [2018-11-10 09:21:49,143 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:49,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:49,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:49,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:49,143 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:49,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:49,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:49,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:49,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-10 09:21:49,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:49,143 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:49,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,171 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:49,171 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:49,175 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:49,175 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:49,191 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:49,191 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:49,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:49,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:49,198 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:49,198 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:49,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:49,214 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:49,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:49,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:49,234 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:49,248 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:49,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:49,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:49,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:49,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:49,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:49,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:49,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:49,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-10 09:21:49,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:49,249 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:49,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,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-11-10 09:21:49,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:49,279 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:49,280 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:49,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:49,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:49,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:49,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:49,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:49,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:49,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:49,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:49,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:49,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:49,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:49,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:49,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:49,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:49,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:49,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:49,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:49,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:49,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:49,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:49,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:49,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:49,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:49,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:49,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:49,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:49,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:49,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:49,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:49,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:49,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:49,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:49,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:49,287 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:49,288 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:49,288 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:49,289 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:49,289 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:49,289 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:49,289 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2018-11-10 09:21:49,289 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:49,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:49,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:49,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 384 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:49,369 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-11-10 09:21:49,369 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 236 states and 266 transitions. cyclomatic complexity: 34 Second operand 10 states. [2018-11-10 09:21:49,576 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 236 states and 266 transitions. cyclomatic complexity: 34. Second operand 10 states. Result 1531 states and 1676 transitions. Complement of second has 31 states. [2018-11-10 09:21:49,577 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-11-10 09:21:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 09:21:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2018-11-10 09:21:49,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 93 transitions. Stem has 55 letters. Loop has 80 letters. [2018-11-10 09:21:49,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:49,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 93 transitions. Stem has 135 letters. Loop has 80 letters. [2018-11-10 09:21:49,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:49,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 93 transitions. Stem has 55 letters. Loop has 160 letters. [2018-11-10 09:21:49,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:49,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1531 states and 1676 transitions. [2018-11-10 09:21:49,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2018-11-10 09:21:49,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1531 states to 1091 states and 1205 transitions. [2018-11-10 09:21:49,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 426 [2018-11-10 09:21:49,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2018-11-10 09:21:49,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1091 states and 1205 transitions. [2018-11-10 09:21:49,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:49,587 INFO L705 BuchiCegarLoop]: Abstraction has 1091 states and 1205 transitions. [2018-11-10 09:21:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states and 1205 transitions. [2018-11-10 09:21:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 893. [2018-11-10 09:21:49,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-11-10 09:21:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 996 transitions. [2018-11-10 09:21:49,595 INFO L728 BuchiCegarLoop]: Abstraction has 893 states and 996 transitions. [2018-11-10 09:21:49,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:21:49,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:21:49,596 INFO L87 Difference]: Start difference. First operand 893 states and 996 transitions. Second operand 13 states. [2018-11-10 09:21:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:49,630 INFO L93 Difference]: Finished difference Result 438 states and 476 transitions. [2018-11-10 09:21:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:21:49,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 476 transitions. [2018-11-10 09:21:49,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:49,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 376 states and 414 transitions. [2018-11-10 09:21:49,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2018-11-10 09:21:49,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2018-11-10 09:21:49,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 376 states and 414 transitions. [2018-11-10 09:21:49,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:49,635 INFO L705 BuchiCegarLoop]: Abstraction has 376 states and 414 transitions. [2018-11-10 09:21:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states and 414 transitions. [2018-11-10 09:21:49,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 241. [2018-11-10 09:21:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-10 09:21:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 270 transitions. [2018-11-10 09:21:49,639 INFO L728 BuchiCegarLoop]: Abstraction has 241 states and 270 transitions. [2018-11-10 09:21:49,639 INFO L608 BuchiCegarLoop]: Abstraction has 241 states and 270 transitions. [2018-11-10 09:21:49,639 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 09:21:49,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 270 transitions. [2018-11-10 09:21:49,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:49,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:49,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:49,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:49,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 17, 16, 16, 10, 7, 1, 1] [2018-11-10 09:21:49,641 INFO L793 eck$LassoCheckResult]: Stem: 20664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20654#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 20655#L18-1 assume true; 20715#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20673#L12 assume !(main_~i~0 >= 10); 20674#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20856#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20677#L18-1 assume true; 20861#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20860#L12 assume !(main_~i~0 >= 10); 20662#L12-2 assume !(main_~i~0 <= 0); 20663#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20675#L18-1 assume true; 20852#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20851#L12 assume !(main_~i~0 >= 10); 20850#L12-2 assume !(main_~i~0 <= 0); 20849#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20848#L18-1 assume true; 20847#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20846#L12 assume !(main_~i~0 >= 10); 20845#L12-2 assume !(main_~i~0 <= 0); 20844#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20843#L18-1 assume true; 20842#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20841#L12 assume !(main_~i~0 >= 10); 20840#L12-2 assume !(main_~i~0 <= 0); 20839#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20838#L18-1 assume true; 20837#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20836#L12 assume !(main_~i~0 >= 10); 20835#L12-2 assume !(main_~i~0 <= 0); 20834#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20833#L18-1 assume true; 20832#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20831#L12 assume !(main_~i~0 >= 10); 20830#L12-2 assume !(main_~i~0 <= 0); 20829#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20828#L18-1 assume true; 20827#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20826#L12 assume !(main_~i~0 >= 10); 20825#L12-2 assume !(main_~i~0 <= 0); 20824#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20823#L18-1 assume true; 20822#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20821#L12 assume !(main_~i~0 >= 10); 20820#L12-2 assume !(main_~i~0 <= 0); 20819#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20818#L18-1 assume true; 20763#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20817#L12 assume !(main_~i~0 >= 10); 20816#L12-2 assume !(main_~i~0 <= 0); 20815#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20762#L18-1 assume true; 20761#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20760#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20736#L12-2 [2018-11-10 09:21:49,641 INFO L795 eck$LassoCheckResult]: Loop: 20736#L12-2 assume !(main_~i~0 <= 0); 20737#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20682#L18-1 assume true; 20683#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20668#L12 assume !(main_~i~0 >= 10); 20669#L12-2 assume !(main_~i~0 <= 0); 20894#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20893#L18-1 assume true; 20892#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20667#L12 assume !(main_~i~0 >= 10); 20660#L12-2 assume !(main_~i~0 <= 0); 20661#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20665#L18-1 assume true; 20656#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20657#L12 assume !(main_~i~0 >= 10); 20891#L12-2 assume !(main_~i~0 <= 0); 20890#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20889#L18-1 assume true; 20888#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20887#L12 assume !(main_~i~0 >= 10); 20886#L12-2 assume !(main_~i~0 <= 0); 20885#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20884#L18-1 assume true; 20883#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20882#L12 assume !(main_~i~0 >= 10); 20881#L12-2 assume !(main_~i~0 <= 0); 20880#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20879#L18-1 assume true; 20878#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20866#L12 assume !(main_~i~0 >= 10); 20863#L12-2 assume !(main_~i~0 <= 0); 20864#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20877#L18-1 assume true; 20854#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20855#L12 assume !(main_~i~0 >= 10); 20813#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20768#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20812#L18-1 assume true; 20811#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20810#L12 assume !(main_~i~0 >= 10); 20809#L12-2 assume !(main_~i~0 <= 0); 20808#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20807#L18-1 assume true; 20806#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20805#L12 assume !(main_~i~0 >= 10); 20804#L12-2 assume !(main_~i~0 <= 0); 20803#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20802#L18-1 assume true; 20801#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20800#L12 assume !(main_~i~0 >= 10); 20799#L12-2 assume !(main_~i~0 <= 0); 20798#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20797#L18-1 assume true; 20796#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20795#L12 assume !(main_~i~0 >= 10); 20794#L12-2 assume !(main_~i~0 <= 0); 20793#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20792#L18-1 assume true; 20791#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20790#L12 assume !(main_~i~0 >= 10); 20789#L12-2 assume !(main_~i~0 <= 0); 20788#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20787#L18-1 assume true; 20786#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20785#L12 assume !(main_~i~0 >= 10); 20784#L12-2 assume !(main_~i~0 <= 0); 20783#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20782#L18-1 assume true; 20781#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20780#L12 assume !(main_~i~0 >= 10); 20779#L12-2 assume !(main_~i~0 <= 0); 20778#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20777#L18-1 assume true; 20776#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20775#L12 assume !(main_~i~0 >= 10); 20774#L12-2 assume !(main_~i~0 <= 0); 20773#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20772#L18-1 assume true; 20771#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20769#L12 assume !(main_~i~0 >= 10); 20767#L12-2 assume !(main_~i~0 <= 0); 20766#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 20764#L18-1 assume true; 20765#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20770#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20736#L12-2 [2018-11-10 09:21:49,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 13 times [2018-11-10 09:21:49,642 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:49,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:49,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:49,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:49,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:49,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2065506052, now seen corresponding path program 13 times [2018-11-10 09:21:49,650 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:49,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:49,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:49,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:49,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1967557725, now seen corresponding path program 7 times [2018-11-10 09:21:49,662 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:49,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:49,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1253 proven. 112 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:49,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:49,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:49,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:49,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 1253 proven. 112 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:49,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:49,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-10 09:21:49,994 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 67 [2018-11-10 09:21:50,000 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:50,000 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:50,001 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:50,001 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:50,001 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:50,001 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:50,001 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:50,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:50,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-10 09:21:50,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:50,001 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:50,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,038 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:50,039 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:50,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:50,041 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:50,059 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:50,059 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:50,063 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:50,077 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:50,077 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:50,077 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:50,077 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:50,077 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:50,077 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:50,077 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:50,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:50,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-10 09:21:50,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:50,077 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:50,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-11-10 09:21:50,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:50,113 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:50,113 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:50,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:50,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:50,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:50,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:50,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:50,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:50,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:50,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:50,116 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:50,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:50,117 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:50,117 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:50,117 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:50,117 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:50,118 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2018-11-10 09:21:50,118 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:50,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:50,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:50,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 464 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:50,291 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-11-10 09:21:50,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241 states and 270 transitions. cyclomatic complexity: 33 Second operand 11 states. [2018-11-10 09:21:50,711 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241 states and 270 transitions. cyclomatic complexity: 33. Second operand 11 states. Result 1837 states and 2000 transitions. Complement of second has 35 states. [2018-11-10 09:21:50,712 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-11-10 09:21:50,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-10 09:21:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2018-11-10 09:21:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 105 transitions. Stem has 55 letters. Loop has 85 letters. [2018-11-10 09:21:50,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:50,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 105 transitions. Stem has 140 letters. Loop has 85 letters. [2018-11-10 09:21:50,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:50,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 105 transitions. Stem has 55 letters. Loop has 170 letters. [2018-11-10 09:21:50,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:50,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1837 states and 2000 transitions. [2018-11-10 09:21:50,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2018-11-10 09:21:50,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1837 states to 1256 states and 1381 transitions. [2018-11-10 09:21:50,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 490 [2018-11-10 09:21:50,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2018-11-10 09:21:50,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1256 states and 1381 transitions. [2018-11-10 09:21:50,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:50,724 INFO L705 BuchiCegarLoop]: Abstraction has 1256 states and 1381 transitions. [2018-11-10 09:21:50,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states and 1381 transitions. [2018-11-10 09:21:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 992. [2018-11-10 09:21:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-10 09:21:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1104 transitions. [2018-11-10 09:21:50,732 INFO L728 BuchiCegarLoop]: Abstraction has 992 states and 1104 transitions. [2018-11-10 09:21:50,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:21:50,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:21:50,733 INFO L87 Difference]: Start difference. First operand 992 states and 1104 transitions. Second operand 10 states. [2018-11-10 09:21:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:50,778 INFO L93 Difference]: Finished difference Result 458 states and 494 transitions. [2018-11-10 09:21:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:21:50,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 458 states and 494 transitions. [2018-11-10 09:21:50,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:50,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 458 states to 386 states and 422 transitions. [2018-11-10 09:21:50,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2018-11-10 09:21:50,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2018-11-10 09:21:50,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 422 transitions. [2018-11-10 09:21:50,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:50,782 INFO L705 BuchiCegarLoop]: Abstraction has 386 states and 422 transitions. [2018-11-10 09:21:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 422 transitions. [2018-11-10 09:21:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 246. [2018-11-10 09:21:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-10 09:21:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 274 transitions. [2018-11-10 09:21:50,786 INFO L728 BuchiCegarLoop]: Abstraction has 246 states and 274 transitions. [2018-11-10 09:21:50,787 INFO L608 BuchiCegarLoop]: Abstraction has 246 states and 274 transitions. [2018-11-10 09:21:50,787 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 09:21:50,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 274 transitions. [2018-11-10 09:21:50,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:50,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:50,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:50,788 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:50,788 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 18, 17, 17, 10, 8, 1, 1] [2018-11-10 09:21:50,788 INFO L793 eck$LassoCheckResult]: Stem: 25118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 25109#L18-1 assume true; 25163#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25127#L12 assume !(main_~i~0 >= 10); 25116#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 25117#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25130#L18-1 assume true; 25315#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25314#L12 assume !(main_~i~0 >= 10); 25313#L12-2 assume !(main_~i~0 <= 0); 25312#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25311#L18-1 assume true; 25310#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25309#L12 assume !(main_~i~0 >= 10); 25308#L12-2 assume !(main_~i~0 <= 0); 25307#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25306#L18-1 assume true; 25305#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25304#L12 assume !(main_~i~0 >= 10); 25303#L12-2 assume !(main_~i~0 <= 0); 25302#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25301#L18-1 assume true; 25300#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25299#L12 assume !(main_~i~0 >= 10); 25298#L12-2 assume !(main_~i~0 <= 0); 25297#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25296#L18-1 assume true; 25295#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25294#L12 assume !(main_~i~0 >= 10); 25293#L12-2 assume !(main_~i~0 <= 0); 25292#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25291#L18-1 assume true; 25290#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25289#L12 assume !(main_~i~0 >= 10); 25288#L12-2 assume !(main_~i~0 <= 0); 25287#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25286#L18-1 assume true; 25285#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25284#L12 assume !(main_~i~0 >= 10); 25283#L12-2 assume !(main_~i~0 <= 0); 25282#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25281#L18-1 assume true; 25280#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25279#L12 assume !(main_~i~0 >= 10); 25278#L12-2 assume !(main_~i~0 <= 0); 25277#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25276#L18-1 assume true; 25223#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25275#L12 assume !(main_~i~0 >= 10); 25274#L12-2 assume !(main_~i~0 <= 0); 25273#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25222#L18-1 assume true; 25219#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25218#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 25189#L12-2 [2018-11-10 09:21:50,788 INFO L795 eck$LassoCheckResult]: Loop: 25189#L12-2 assume !(main_~i~0 <= 0); 25190#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25135#L18-1 assume true; 25136#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25122#L12 assume !(main_~i~0 >= 10); 25123#L12-2 assume !(main_~i~0 <= 0); 25353#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25352#L18-1 assume true; 25351#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25121#L12 assume !(main_~i~0 >= 10); 25114#L12-2 assume !(main_~i~0 <= 0); 25115#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25119#L18-1 assume true; 25110#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25111#L12 assume !(main_~i~0 >= 10); 25350#L12-2 assume !(main_~i~0 <= 0); 25349#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25348#L18-1 assume true; 25347#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25346#L12 assume !(main_~i~0 >= 10); 25345#L12-2 assume !(main_~i~0 <= 0); 25344#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25343#L18-1 assume true; 25342#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25341#L12 assume !(main_~i~0 >= 10); 25340#L12-2 assume !(main_~i~0 <= 0); 25339#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25338#L18-1 assume true; 25337#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25336#L12 assume !(main_~i~0 >= 10); 25335#L12-2 assume !(main_~i~0 <= 0); 25334#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25332#L18-1 assume true; 25330#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25323#L12 assume !(main_~i~0 >= 10); 25324#L12-2 assume !(main_~i~0 <= 0); 25333#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 25319#L18-1 assume true; 25316#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25317#L12 assume !(main_~i~0 >= 10); 25271#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 25226#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25270#L18-1 assume true; 25269#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25268#L12 assume !(main_~i~0 >= 10); 25267#L12-2 assume !(main_~i~0 <= 0); 25266#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25265#L18-1 assume true; 25264#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25263#L12 assume !(main_~i~0 >= 10); 25262#L12-2 assume !(main_~i~0 <= 0); 25261#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25260#L18-1 assume true; 25259#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25258#L12 assume !(main_~i~0 >= 10); 25257#L12-2 assume !(main_~i~0 <= 0); 25256#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25255#L18-1 assume true; 25254#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25253#L12 assume !(main_~i~0 >= 10); 25252#L12-2 assume !(main_~i~0 <= 0); 25251#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25250#L18-1 assume true; 25249#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25248#L12 assume !(main_~i~0 >= 10); 25247#L12-2 assume !(main_~i~0 <= 0); 25246#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25245#L18-1 assume true; 25244#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25243#L12 assume !(main_~i~0 >= 10); 25242#L12-2 assume !(main_~i~0 <= 0); 25241#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25240#L18-1 assume true; 25239#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25238#L12 assume !(main_~i~0 >= 10); 25237#L12-2 assume !(main_~i~0 <= 0); 25236#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25235#L18-1 assume true; 25234#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25233#L12 assume !(main_~i~0 >= 10); 25232#L12-2 assume !(main_~i~0 <= 0); 25231#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25230#L18-1 assume true; 25229#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25228#L12 assume !(main_~i~0 >= 10); 25225#L12-2 assume !(main_~i~0 <= 0); 25224#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 25220#L18-1 assume true; 25221#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 25227#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 25189#L12-2 [2018-11-10 09:21:50,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 14 times [2018-11-10 09:21:50,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:50,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:50,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:50,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:50,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:50,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2074596639, now seen corresponding path program 14 times [2018-11-10 09:21:50,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:50,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:50,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:50,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:50,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:50,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:50,806 INFO L82 PathProgramCache]: Analyzing trace with hash 334114088, now seen corresponding path program 8 times [2018-11-10 09:21:50,807 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:50,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:50,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:50,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:50,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 1355 proven. 148 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:50,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:50,875 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:50,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:21:50,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:21:50,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:50,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 1355 proven. 148 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:50,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:50,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 09:21:51,148 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 70 [2018-11-10 09:21:51,153 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:51,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:51,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:51,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:51,154 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:51,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:51,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:51,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:51,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-10 09:21:51,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:51,154 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:51,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,189 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:51,189 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:51,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:51,190 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:51,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:51,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:51,342 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:51,343 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:51,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:51,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:51,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:51,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:51,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:51,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:51,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:51,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-10 09:21:51,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:51,343 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:51,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:51,373 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:51,373 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:51,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:51,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:51,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:51,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:51,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:51,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:51,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:51,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:51,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:51,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:51,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:51,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:51,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:51,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:51,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:51,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:51,378 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:51,379 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:51,379 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:51,379 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:51,379 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:51,379 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:51,379 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-11-10 09:21:51,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:51,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:51,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:51,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:51,473 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 549 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:51,473 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-11-10 09:21:51,473 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 246 states and 274 transitions. cyclomatic complexity: 32 Second operand 12 states. [2018-11-10 09:21:51,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 246 states and 274 transitions. cyclomatic complexity: 32. Second operand 12 states. Result 2183 states and 2366 transitions. Complement of second has 39 states. [2018-11-10 09:21:51,764 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-11-10 09:21:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-10 09:21:51,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 117 transitions. [2018-11-10 09:21:51,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 117 transitions. Stem has 55 letters. Loop has 90 letters. [2018-11-10 09:21:51,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:51,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 117 transitions. Stem has 145 letters. Loop has 90 letters. [2018-11-10 09:21:51,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:51,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 117 transitions. Stem has 55 letters. Loop has 180 letters. [2018-11-10 09:21:51,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:51,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2183 states and 2366 transitions. [2018-11-10 09:21:51,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 106 [2018-11-10 09:21:51,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2183 states to 1441 states and 1578 transitions. [2018-11-10 09:21:51,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2018-11-10 09:21:51,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 573 [2018-11-10 09:21:51,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1441 states and 1578 transitions. [2018-11-10 09:21:51,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:51,779 INFO L705 BuchiCegarLoop]: Abstraction has 1441 states and 1578 transitions. [2018-11-10 09:21:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states and 1578 transitions. [2018-11-10 09:21:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1101. [2018-11-10 09:21:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2018-11-10 09:21:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1223 transitions. [2018-11-10 09:21:51,790 INFO L728 BuchiCegarLoop]: Abstraction has 1101 states and 1223 transitions. [2018-11-10 09:21:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:21:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:21:51,790 INFO L87 Difference]: Start difference. First operand 1101 states and 1223 transitions. Second operand 11 states. [2018-11-10 09:21:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:51,856 INFO L93 Difference]: Finished difference Result 478 states and 512 transitions. [2018-11-10 09:21:51,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:21:51,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 478 states and 512 transitions. [2018-11-10 09:21:51,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:51,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 478 states to 396 states and 430 transitions. [2018-11-10 09:21:51,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 273 [2018-11-10 09:21:51,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 273 [2018-11-10 09:21:51,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 396 states and 430 transitions. [2018-11-10 09:21:51,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:51,860 INFO L705 BuchiCegarLoop]: Abstraction has 396 states and 430 transitions. [2018-11-10 09:21:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states and 430 transitions. [2018-11-10 09:21:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 251. [2018-11-10 09:21:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-10 09:21:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 278 transitions. [2018-11-10 09:21:51,863 INFO L728 BuchiCegarLoop]: Abstraction has 251 states and 278 transitions. [2018-11-10 09:21:51,864 INFO L608 BuchiCegarLoop]: Abstraction has 251 states and 278 transitions. [2018-11-10 09:21:51,864 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-10 09:21:51,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 278 transitions. [2018-11-10 09:21:51,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:51,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:51,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:51,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 9, 1, 1, 1, 1] [2018-11-10 09:21:51,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [19, 19, 18, 18, 10, 9, 1, 1] [2018-11-10 09:21:51,865 INFO L793 eck$LassoCheckResult]: Stem: 30091#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 30081#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 30082#L18-1 assume true; 30133#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30102#L12 assume !(main_~i~0 >= 10); 30103#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 30328#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30092#L18-1 assume true; 30093#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30330#L12 assume !(main_~i~0 >= 10); 30089#L12-2 assume !(main_~i~0 <= 0); 30090#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30329#L18-1 assume true; 30327#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30326#L12 assume !(main_~i~0 >= 10); 30325#L12-2 assume !(main_~i~0 <= 0); 30324#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30323#L18-1 assume true; 30322#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30321#L12 assume !(main_~i~0 >= 10); 30319#L12-2 assume !(main_~i~0 <= 0); 30317#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30315#L18-1 assume true; 30314#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30312#L12 assume !(main_~i~0 >= 10); 30310#L12-2 assume !(main_~i~0 <= 0); 30308#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30306#L18-1 assume true; 30304#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30302#L12 assume !(main_~i~0 >= 10); 30300#L12-2 assume !(main_~i~0 <= 0); 30298#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30296#L18-1 assume true; 30294#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30292#L12 assume !(main_~i~0 >= 10); 30290#L12-2 assume !(main_~i~0 <= 0); 30288#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30286#L18-1 assume true; 30284#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30282#L12 assume !(main_~i~0 >= 10); 30280#L12-2 assume !(main_~i~0 <= 0); 30278#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30276#L18-1 assume true; 30274#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30272#L12 assume !(main_~i~0 >= 10); 30270#L12-2 assume !(main_~i~0 <= 0); 30268#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30264#L18-1 assume true; 30201#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30259#L12 assume !(main_~i~0 >= 10); 30256#L12-2 assume !(main_~i~0 <= 0); 30253#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30200#L18-1 assume true; 30199#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30198#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 30165#L12-2 [2018-11-10 09:21:51,865 INFO L795 eck$LassoCheckResult]: Loop: 30165#L12-2 assume !(main_~i~0 <= 0); 30164#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30110#L18-1 assume true; 30111#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30096#L12 assume !(main_~i~0 >= 10); 30097#L12-2 assume !(main_~i~0 <= 0); 30320#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30318#L18-1 assume true; 30316#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30095#L12 assume !(main_~i~0 >= 10); 30087#L12-2 assume !(main_~i~0 <= 0); 30088#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30099#L18-1 assume true; 30083#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30084#L12 assume !(main_~i~0 >= 10); 30313#L12-2 assume !(main_~i~0 <= 0); 30311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30309#L18-1 assume true; 30307#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30305#L12 assume !(main_~i~0 >= 10); 30303#L12-2 assume !(main_~i~0 <= 0); 30301#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30299#L18-1 assume true; 30297#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30295#L12 assume !(main_~i~0 >= 10); 30293#L12-2 assume !(main_~i~0 <= 0); 30291#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30289#L18-1 assume true; 30287#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30285#L12 assume !(main_~i~0 >= 10); 30283#L12-2 assume !(main_~i~0 <= 0); 30281#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30279#L18-1 assume true; 30277#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30275#L12 assume !(main_~i~0 >= 10); 30273#L12-2 assume !(main_~i~0 <= 0); 30271#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30269#L18-1 assume true; 30267#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30265#L12 assume !(main_~i~0 >= 10); 30266#L12-2 assume !(main_~i~0 <= 0); 30260#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 30261#L18-1 assume true; 30254#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30255#L12 assume !(main_~i~0 >= 10); 30251#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 30206#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30250#L18-1 assume true; 30249#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30248#L12 assume !(main_~i~0 >= 10); 30247#L12-2 assume !(main_~i~0 <= 0); 30246#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30245#L18-1 assume true; 30244#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30243#L12 assume !(main_~i~0 >= 10); 30242#L12-2 assume !(main_~i~0 <= 0); 30241#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30240#L18-1 assume true; 30239#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30238#L12 assume !(main_~i~0 >= 10); 30237#L12-2 assume !(main_~i~0 <= 0); 30236#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30235#L18-1 assume true; 30234#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30233#L12 assume !(main_~i~0 >= 10); 30232#L12-2 assume !(main_~i~0 <= 0); 30231#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30230#L18-1 assume true; 30229#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30228#L12 assume !(main_~i~0 >= 10); 30227#L12-2 assume !(main_~i~0 <= 0); 30226#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30225#L18-1 assume true; 30224#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30223#L12 assume !(main_~i~0 >= 10); 30222#L12-2 assume !(main_~i~0 <= 0); 30221#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30220#L18-1 assume true; 30219#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30218#L12 assume !(main_~i~0 >= 10); 30217#L12-2 assume !(main_~i~0 <= 0); 30216#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30215#L18-1 assume true; 30214#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30213#L12 assume !(main_~i~0 >= 10); 30212#L12-2 assume !(main_~i~0 <= 0); 30211#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30210#L18-1 assume true; 30209#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30208#L12 assume !(main_~i~0 >= 10); 30205#L12-2 assume !(main_~i~0 <= 0); 30204#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 30202#L18-1 assume true; 30203#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 30207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 30165#L12-2 [2018-11-10 09:21:51,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1717339400, now seen corresponding path program 15 times [2018-11-10 09:21:51,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:51,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:51,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:51,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:51,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:51,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1181417764, now seen corresponding path program 15 times [2018-11-10 09:21:51,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:51,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:51,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:51,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2064493763, now seen corresponding path program 9 times [2018-11-10 09:21:51,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:51,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:51,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:51,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:51,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 1457 proven. 189 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2018-11-10 09:21:51,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:21:51,958 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:21:51,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:21:52,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-10 09:21:52,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:21:52,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 1466 proven. 354 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-10 09:21:52,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:21:52,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 13 [2018-11-10 09:21:52,284 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 72 [2018-11-10 09:21:52,289 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:52,289 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:52,289 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:52,289 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:52,289 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 09:21:52,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:52,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:52,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:52,290 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-10 09:21:52,290 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:52,290 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:52,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,322 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:52,322 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:52,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:52,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:52,342 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:52,342 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:52,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:52,346 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:52,348 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 09:21:52,349 INFO L446 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_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:52,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 09:21:52,364 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/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-11-10 09:21:52,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 09:21:52,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 09:21:52,489 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 09:21:52,490 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:21:52,490 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:21:52,490 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:21:52,490 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:21:52,490 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:21:52,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:21:52,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:21:52,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:21:52,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-10 09:21:52,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:21:52,490 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:21:52,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:21:52,518 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:21:52,518 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:21:52,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:52,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:21:52,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:21:52,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:52,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:21:52,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:21:52,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:21:52,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:21:52,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:21:52,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:21:52,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:21:52,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:21:52,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:21:52,524 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:21:52,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:21:52,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:21:52,525 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:21:52,525 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 09:21:52,526 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:21:52,526 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-10 09:21:52,526 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 09:21:52,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:52,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:21:52,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:21:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 639 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-11-10 09:21:52,708 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-11-10 09:21:52,708 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 251 states and 278 transitions. cyclomatic complexity: 31 Second operand 13 states. [2018-11-10 09:21:53,332 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 251 states and 278 transitions. cyclomatic complexity: 31. Second operand 13 states. Result 2436 states and 2621 transitions. Complement of second has 43 states. [2018-11-10 09:21:53,334 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-11-10 09:21:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 09:21:53,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 126 transitions. [2018-11-10 09:21:53,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 126 transitions. Stem has 55 letters. Loop has 95 letters. [2018-11-10 09:21:53,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:53,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 126 transitions. Stem has 150 letters. Loop has 95 letters. [2018-11-10 09:21:53,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:53,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 126 transitions. Stem has 55 letters. Loop has 190 letters. [2018-11-10 09:21:53,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:21:53,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2436 states and 2621 transitions. [2018-11-10 09:21:53,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:53,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2436 states to 1481 states and 1601 transitions. [2018-11-10 09:21:53,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 602 [2018-11-10 09:21:53,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 604 [2018-11-10 09:21:53,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1481 states and 1601 transitions. [2018-11-10 09:21:53,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:53,349 INFO L705 BuchiCegarLoop]: Abstraction has 1481 states and 1601 transitions. [2018-11-10 09:21:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states and 1601 transitions. [2018-11-10 09:21:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 603. [2018-11-10 09:21:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-11-10 09:21:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 654 transitions. [2018-11-10 09:21:53,358 INFO L728 BuchiCegarLoop]: Abstraction has 603 states and 654 transitions. [2018-11-10 09:21:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 09:21:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 09:21:53,359 INFO L87 Difference]: Start difference. First operand 603 states and 654 transitions. Second operand 13 states. [2018-11-10 09:21:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:21:53,449 INFO L93 Difference]: Finished difference Result 588 states and 607 transitions. [2018-11-10 09:21:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:21:53,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 588 states and 607 transitions. [2018-11-10 09:21:53,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:53,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 588 states to 404 states and 423 transitions. [2018-11-10 09:21:53,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2018-11-10 09:21:53,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-10 09:21:53,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 404 states and 423 transitions. [2018-11-10 09:21:53,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:21:53,453 INFO L705 BuchiCegarLoop]: Abstraction has 404 states and 423 transitions. [2018-11-10 09:21:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 423 transitions. [2018-11-10 09:21:53,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 208. [2018-11-10 09:21:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-10 09:21:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2018-11-10 09:21:53,457 INFO L728 BuchiCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-11-10 09:21:53,457 INFO L608 BuchiCegarLoop]: Abstraction has 208 states and 223 transitions. [2018-11-10 09:21:53,457 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-10 09:21:53,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 223 transitions. [2018-11-10 09:21:53,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 101 [2018-11-10 09:21:53,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:21:53,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:21:53,458 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 09:21:53,458 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 20, 19, 19, 10, 10, 1, 1] [2018-11-10 09:21:53,458 INFO L793 eck$LassoCheckResult]: Stem: 34974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 34964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 34965#L18-1 assume true; 34984#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 34982#L12 assume !(main_~i~0 >= 10); 34983#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 34989#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 34988#L18-1 assume true; 35040#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35039#L12 assume !(main_~i~0 >= 10); 35038#L12-2 assume !(main_~i~0 <= 0); 35037#L15-1 [2018-11-10 09:21:53,458 INFO L795 eck$LassoCheckResult]: Loop: 35037#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35036#L18-1 assume true; 35035#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35034#L12 assume !(main_~i~0 >= 10); 35033#L12-2 assume !(main_~i~0 <= 0); 35032#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35031#L18-1 assume true; 35030#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35029#L12 assume !(main_~i~0 >= 10); 35028#L12-2 assume !(main_~i~0 <= 0); 35027#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35026#L18-1 assume true; 35025#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35024#L12 assume !(main_~i~0 >= 10); 35023#L12-2 assume !(main_~i~0 <= 0); 35022#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35021#L18-1 assume true; 35020#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35019#L12 assume !(main_~i~0 >= 10); 35018#L12-2 assume !(main_~i~0 <= 0); 35017#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35016#L18-1 assume true; 35015#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35014#L12 assume !(main_~i~0 >= 10); 35013#L12-2 assume !(main_~i~0 <= 0); 35012#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35011#L18-1 assume true; 35010#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35009#L12 assume !(main_~i~0 >= 10); 35008#L12-2 assume !(main_~i~0 <= 0); 35007#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35006#L18-1 assume true; 35005#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35004#L12 assume !(main_~i~0 >= 10); 35003#L12-2 assume !(main_~i~0 <= 0); 35002#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35001#L18-1 assume true; 35000#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 34999#L12 assume !(main_~i~0 >= 10); 34998#L12-2 assume !(main_~i~0 <= 0); 34997#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 34996#L18-1 assume true; 34995#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 34993#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 34994#L12-2 assume !(main_~i~0 <= 0); 34980#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 34981#L18-1 assume true; 34972#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 34973#L12 assume !(main_~i~0 >= 10); 35091#L12-2 assume !(main_~i~0 <= 0); 35090#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35089#L18-1 assume true; 35088#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35087#L12 assume !(main_~i~0 >= 10); 35086#L12-2 assume !(main_~i~0 <= 0); 35085#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35084#L18-1 assume true; 35083#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35082#L12 assume !(main_~i~0 >= 10); 35081#L12-2 assume !(main_~i~0 <= 0); 35080#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35079#L18-1 assume true; 35078#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35077#L12 assume !(main_~i~0 >= 10); 35076#L12-2 assume !(main_~i~0 <= 0); 35075#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35074#L18-1 assume true; 35073#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35072#L12 assume !(main_~i~0 >= 10); 35071#L12-2 assume !(main_~i~0 <= 0); 35070#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35069#L18-1 assume true; 35068#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35067#L12 assume !(main_~i~0 >= 10); 35066#L12-2 assume !(main_~i~0 <= 0); 35065#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35064#L18-1 assume true; 35063#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35062#L12 assume !(main_~i~0 >= 10); 35061#L12-2 assume !(main_~i~0 <= 0); 35060#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35059#L18-1 assume true; 35058#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35057#L12 assume !(main_~i~0 >= 10); 35056#L12-2 assume !(main_~i~0 <= 0); 35055#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35054#L18-1 assume true; 35053#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35052#L12 assume !(main_~i~0 >= 10); 35051#L12-2 assume !(main_~i~0 <= 0); 35050#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 35049#L18-1 assume true; 35047#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35045#L12 assume !(main_~i~0 >= 10); 35043#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 35041#L15-1 assume main_~up~0 >= 1;main_~i~0 := main_~i~0 + 1; 35042#L18-1 assume true; 35048#L11-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 35046#L12 assume !(main_~i~0 >= 10); 35044#L12-2 assume !(main_~i~0 <= 0); 35037#L15-1 [2018-11-10 09:21:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash -250850182, now seen corresponding path program 1 times [2018-11-10 09:21:53,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:53,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:53,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:53,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:53,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:53,462 INFO L82 PathProgramCache]: Analyzing trace with hash 912088513, now seen corresponding path program 16 times [2018-11-10 09:21:53,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:53,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:53,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:21:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:53,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:21:53,472 INFO L82 PathProgramCache]: Analyzing trace with hash -58302022, now seen corresponding path program 10 times [2018-11-10 09:21:53,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:21:53,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:21:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:53,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:21:53,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:21:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:21:53,741 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 74 [2018-11-10 09:21:53,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:21:53 BoogieIcfgContainer [2018-11-10 09:21:53,777 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:21:53,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:21:53,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:21:53,777 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:21:53,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:21:41" (3/4) ... [2018-11-10 09:21:53,780 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 09:21:53,821 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_343d774e-bd50-49eb-9b3f-a2ad1fbdfaf2/bin-2019/uautomizer/witness.graphml [2018-11-10 09:21:53,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:21:53,822 INFO L168 Benchmark]: Toolchain (without parser) took 13068.01 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 235.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:53,823 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:21:53,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.27 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:53,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.32 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:21:53,823 INFO L168 Benchmark]: Boogie Preprocessor took 9.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:53,823 INFO L168 Benchmark]: RCFGBuilder took 161.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:53,824 INFO L168 Benchmark]: BuchiAutomizer took 12687.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.7 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:53,824 INFO L168 Benchmark]: Witness Printer took 44.51 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-10 09:21:53,825 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.27 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.32 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 9.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 161.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12687.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.7 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. * Witness Printer took 44.51 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 35 terminating modules (21 trivial, 13 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 1 and consists of 5 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 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 -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. 21 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 208 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 7.9s. Construction of modules took 1.4s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 35. Automata minimization 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 3430 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 251 states and ocurred in iteration 23. Nontrivial modules had stage [13, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1512/4270 HoareTripleCheckerStatistics: 428 SDtfs, 767 SDslu, 502 SDs, 0 SdLazy, 2614 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc0 concLT8 SILN0 SILU0 SILI10 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf96 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq129 hnf96 smp100 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 18]: 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=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2e0bf0e3=0, \result=0, i=1} - 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) Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [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) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...