./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-aa41828 [2018-11-22 22:33:15,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:33:15,979 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:33:15,986 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:33:15,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:33:15,987 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:33:15,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:33:15,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:33:15,989 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:33:15,990 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:33:15,991 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:33:15,991 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:33:15,992 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:33:15,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:33:15,993 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:33:15,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:33:15,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:33:15,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:33:15,996 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:33:15,997 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:33:15,998 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:33:15,999 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:33:16,000 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:33:16,001 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:33:16,001 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:33:16,002 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:33:16,002 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:33:16,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:33:16,003 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:33:16,004 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:33:16,004 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:33:16,005 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:33:16,005 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:33:16,005 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:33:16,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:33:16,006 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:33:16,006 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 22:33:16,013 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:33:16,013 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:33:16,014 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:33:16,014 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:33:16,014 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:33:16,014 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:33:16,014 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:33:16,014 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:33:16,015 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:33:16,015 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:33:16,016 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:33:16,016 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:33:16,016 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:33:16,016 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:33:16,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:33:16,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:33:16,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:33:16,017 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:33:16,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:33:16,017 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:33:16,017 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:33:16,018 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:33:16,018 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_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:16,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:33:16,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:33:16,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:33:16,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:33:16,051 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:33:16,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2018-11-22 22:33:16,085 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/data/8e5b4d4a2/2e82f5c033894427b26e386dc61d8ee4/FLAG3f58122a7 [2018-11-22 22:33:16,473 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:33:16,473 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq_false-termination_true-no-overflow.c [2018-11-22 22:33:16,477 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/data/8e5b4d4a2/2e82f5c033894427b26e386dc61d8ee4/FLAG3f58122a7 [2018-11-22 22:33:16,485 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/data/8e5b4d4a2/2e82f5c033894427b26e386dc61d8ee4 [2018-11-22 22:33:16,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:33:16,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:33:16,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:33:16,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:33:16,491 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:33:16,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f711c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16, skipping insertion in model container [2018-11-22 22:33:16,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:33:16,514 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:33:16,612 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:33:16,614 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:33:16,623 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:33:16,631 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:33:16,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16 WrapperNode [2018-11-22 22:33:16,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:33:16,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:33:16,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:33:16,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:33:16,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:33:16,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:33:16,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:33:16,651 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:33:16,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... [2018-11-22 22:33:16,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:33:16,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:33:16,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:33:16,697 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:33:16,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:16,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:33:16,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:33:16,833 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:33:16,834 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 22:33:16,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:33:16 BoogieIcfgContainer [2018-11-22 22:33:16,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:33:16,834 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:33:16,834 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:33:16,837 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:33:16,837 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:33:16,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:33:16" (1/3) ... [2018-11-22 22:33:16,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dbe9602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:33:16, skipping insertion in model container [2018-11-22 22:33:16,838 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:33:16,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:33:16" (2/3) ... [2018-11-22 22:33:16,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5dbe9602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:33:16, skipping insertion in model container [2018-11-22 22:33:16,839 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:33:16,839 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:33:16" (3/3) ... [2018-11-22 22:33:16,840 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq_false-termination_true-no-overflow.c [2018-11-22 22:33:16,876 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:33:16,877 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:33:16,877 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:33:16,877 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:33:16,877 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:33:16,877 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:33:16,877 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:33:16,877 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:33:16,877 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:33:16,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-22 22:33:16,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:33:16,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:16,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:16,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:33:16,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:16,912 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:33:16,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-22 22:33:16,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:33:16,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:16,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:16,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:33:16,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:16,918 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5#L18-1true [2018-11-22 22:33:16,918 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume main_~i~0 >= 10;main_~up~0 := 0; 3#L12-2true assume main_~i~0 <= 0;main_~up~0 := 1; 9#L15-1true assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2018-11-22 22:33:16,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:16,922 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-22 22:33:16,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:16,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:16,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2018-11-22 22:33:16,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:33:17,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:33:17,034 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:33:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:33:17,045 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-11-22 22:33:17,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:17,090 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-22 22:33:17,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:33:17,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-22 22:33:17,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:33:17,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 13 transitions. [2018-11-22 22:33:17,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-22 22:33:17,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-22 22:33:17,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-11-22 22:33:17,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:33:17,100 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-22 22:33:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-11-22 22:33:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-22 22:33:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-22 22:33:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-11-22 22:33:17,125 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-22 22:33:17,125 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-22 22:33:17,125 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:33:17,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 13 transitions. [2018-11-22 22:33:17,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:33:17,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:17,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:17,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:33:17,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:17,127 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 38#L18-1 [2018-11-22 22:33:17,127 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 35#L12-2 assume !(main_~i~0 <= 0); 36#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2018-11-22 22:33:17,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-22 22:33:17,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2018-11-22 22:33:17,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2018-11-22 22:33:17,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,215 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:17,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:17,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:17,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:17,216 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:17,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:17,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:17,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:17,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-22 22:33:17,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:17,217 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:17,230 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-22 22:33:17,240 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-22 22:33:17,242 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-22 22:33:17,244 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-22 22:33:17,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:17,313 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,320 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:17,320 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:17,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:17,342 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:17,358 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:17,358 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:17,358 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:17,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:17,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:17,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:17,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:17,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:17,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-22 22:33:17,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:17,359 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:17,360 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-22 22:33:17,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,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-22 22:33:17,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:17,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:17,452 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-22 22:33:17,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:17,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:17,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:17,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:17,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:17,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:17,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:17,461 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:17,464 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:17,464 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:33:17,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:17,466 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:17,466 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:17,467 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:33:17,467 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:17,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:17,502 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-22 22:33:17,504 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-22 22:33:17,505 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-22 22:33:17,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 31 transitions. Complement of second has 5 states. [2018-11-22 22:33:17,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 22:33:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 22:33:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-22 22:33:17,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-22 22:33:17,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:17,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:33:17,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:17,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2018-11-22 22:33:17,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:17,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 31 transitions. [2018-11-22 22:33:17,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:33:17,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 31 transitions. [2018-11-22 22:33:17,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-22 22:33:17,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-22 22:33:17,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 31 transitions. [2018-11-22 22:33:17,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:17,544 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-22 22:33:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 31 transitions. [2018-11-22 22:33:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-22 22:33:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 22:33:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2018-11-22 22:33:17,546 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-22 22:33:17,546 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 30 transitions. [2018-11-22 22:33:17,547 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:33:17,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 30 transitions. [2018-11-22 22:33:17,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-22 22:33:17,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:17,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:17,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:33:17,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:17,548 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 112#L12-2 assume !(main_~i~0 <= 0); 120#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-11-22 22:33:17,548 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 117#L12-2 assume !(main_~i~0 <= 0); 118#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-11-22 22:33:17,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,549 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2018-11-22 22:33:17,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,562 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-22 22:33:17,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:33:17,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:33:17,562 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:17,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2018-11-22 22:33:17,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,573 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-22 22:33:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:33:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:33:17,573 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:33:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:33:17,574 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-22 22:33:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:17,585 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2018-11-22 22:33:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:33:17,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2018-11-22 22:33:17,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-22 22:33:17,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2018-11-22 22:33:17,587 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-22 22:33:17,587 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-22 22:33:17,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2018-11-22 22:33:17,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:17,587 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-22 22:33:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2018-11-22 22:33:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-22 22:33:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 22:33:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2018-11-22 22:33:17,589 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-22 22:33:17,589 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2018-11-22 22:33:17,589 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:33:17,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2018-11-22 22:33:17,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-22 22:33:17,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:17,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:17,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:33:17,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:17,590 INFO L794 eck$LassoCheckResult]: Stem: 156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 157#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 161#L12 assume !(main_~i~0 >= 10); 169#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 165#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2018-11-22 22:33:17,590 INFO L796 eck$LassoCheckResult]: Loop: 166#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 170#L12 assume !(main_~i~0 >= 10); 168#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 167#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 166#L18-1 [2018-11-22 22:33:17,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,590 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2018-11-22 22:33:17,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2018-11-22 22:33:17,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2018-11-22 22:33:17,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,620 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-22 22:33:17,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:33:17,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:33:17,633 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:17,633 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:17,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:17,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:17,633 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:17,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:17,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:17,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:17,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-22 22:33:17,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:17,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:17,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:17,691 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:17,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:17,712 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:17,712 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,715 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:17,715 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:17,738 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:17,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:17,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:17,745 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:17,745 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:17,761 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:17,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:17,789 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:17,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:17,816 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:17,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:17,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:17,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:17,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:17,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:17,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:17,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:17,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-22 22:33:17,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:17,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:17,819 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-22 22:33:17,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:17,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:17,864 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:17,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:33:17,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:17,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:17,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:17,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:17,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:17,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:17,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:17,873 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-22 22:33:17,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:17,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:17,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:17,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:17,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:17,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:17,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:17,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:17,877 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-22 22:33:17,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:17,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:17,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:17,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:17,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:17,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:17,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:17,884 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-22 22:33:17,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:17,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:17,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:17,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:17,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:17,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:17,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:17,889 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:17,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:17,891 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:17,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:17,892 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:17,892 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:17,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-22 22:33:17,892 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:17,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:17,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:17,922 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-22 22:33:17,922 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-22 22:33:17,923 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11 Second operand 4 states. [2018-11-22 22:33:17,944 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 36 states and 52 transitions. Complement of second has 7 states. [2018-11-22 22:33:17,944 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-22 22:33:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:33:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-22 22:33:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:33:17,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-22 22:33:17,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 22:33:17,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:17,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 52 transitions. [2018-11-22 22:33:17,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-22 22:33:17,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 34 states and 50 transitions. [2018-11-22 22:33:17,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-22 22:33:17,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-22 22:33:17,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2018-11-22 22:33:17,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:17,948 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-11-22 22:33:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2018-11-22 22:33:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-11-22 22:33:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 22:33:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 45 transitions. [2018-11-22 22:33:17,951 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-22 22:33:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:33:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:33:17,951 INFO L87 Difference]: Start difference. First operand 30 states and 45 transitions. Second operand 4 states. [2018-11-22 22:33:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:17,967 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-11-22 22:33:17,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:33:17,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2018-11-22 22:33:17,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-22 22:33:17,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 40 transitions. [2018-11-22 22:33:17,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-22 22:33:17,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-22 22:33:17,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 40 transitions. [2018-11-22 22:33:17,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:17,969 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-11-22 22:33:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 40 transitions. [2018-11-22 22:33:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-11-22 22:33:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 22:33:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-11-22 22:33:17,970 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-11-22 22:33:17,970 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-11-22 22:33:17,971 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:33:17,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2018-11-22 22:33:17,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-22 22:33:17,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:17,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:17,972 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 22:33:17,972 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:17,972 INFO L794 eck$LassoCheckResult]: Stem: 326#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 331#L12 assume !(main_~i~0 >= 10); 338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 337#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2018-11-22 22:33:17,972 INFO L796 eck$LassoCheckResult]: Loop: 328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 329#L12 assume !(main_~i~0 >= 10); 322#L12-2 assume !(main_~i~0 <= 0); 323#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 328#L18-1 [2018-11-22 22:33:17,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2018-11-22 22:33:17,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:17,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2018-11-22 22:33:17,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:17,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2018-11-22 22:33:17,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:17,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:17,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:17,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,007 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:18,007 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:18,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:18,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:18,007 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:18,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:18,007 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:18,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:18,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-22 22:33:18,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:18,007 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:18,008 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-22 22:33:18,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:18,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-22 22:33:18,023 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-22 22:33:18,056 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:18,057 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,077 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:18,077 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=1} Honda state: {ULTIMATE.start_main_~up~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:18,094 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,098 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:18,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,122 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:18,135 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:18,135 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:18,135 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:18,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:18,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:18,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:18,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:18,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:18,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-22 22:33:18,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:18,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:18,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:18,139 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-22 22:33:18,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:18,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-22 22:33:18,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:18,183 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:18,183 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-22 22:33:18,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:18,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:18,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:18,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:18,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:18,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:18,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:18,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:18,186 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-22 22:33:18,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:18,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:18,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:18,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:18,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:18,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:18,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:18,190 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:18,194 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:18,195 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:18,195 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:18,195 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:18,195 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:18,195 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-22 22:33:18,196 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:18,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,235 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-22 22:33:18,236 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-22 22:33:18,236 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-22 22:33:18,264 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 27 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-11-22 22:33:18,264 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-22 22:33:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 22:33:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-22 22:33:18,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 22:33:18,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-22 22:33:18,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-22 22:33:18,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-11-22 22:33:18,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-22 22:33:18,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 40 transitions. [2018-11-22 22:33:18,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-22 22:33:18,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 22:33:18,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 40 transitions. [2018-11-22 22:33:18,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:18,267 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-11-22 22:33:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 40 transitions. [2018-11-22 22:33:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-22 22:33:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 22:33:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2018-11-22 22:33:18,269 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2018-11-22 22:33:18,269 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2018-11-22 22:33:18,269 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 22:33:18,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2018-11-22 22:33:18,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-22 22:33:18,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:18,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:18,270 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-22 22:33:18,270 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:18,270 INFO L794 eck$LassoCheckResult]: Stem: 427#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 440#L12 assume !(main_~i~0 >= 10); 443#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 442#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 441#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 433#L12 assume !(main_~i~0 >= 10); 423#L12-2 [2018-11-22 22:33:18,270 INFO L796 eck$LassoCheckResult]: Loop: 423#L12-2 assume !(main_~i~0 <= 0); 424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 434#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 447#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 423#L12-2 [2018-11-22 22:33:18,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918576, now seen corresponding path program 4 times [2018-11-22 22:33:18,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:18,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:18,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:18,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2018-11-22 22:33:18,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:18,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:18,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:18,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash -912839815, now seen corresponding path program 1 times [2018-11-22 22:33:18,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:18,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:33:18,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:33:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:33:18,314 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:18,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:18,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:18,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:18,315 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:18,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:18,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:18,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:18,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-22 22:33:18,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:18,315 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:18,316 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-22 22:33:18,317 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-22 22:33:18,319 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-22 22:33:18,323 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-22 22:33:18,361 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:18,361 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:18,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,377 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:18,378 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,396 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:18,396 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:18,400 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,415 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:18,431 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,518 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:18,519 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:18,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:18,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:18,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:18,519 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:18,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:18,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:18,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:18,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-22 22:33:18,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:18,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:18,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:18,523 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-22 22:33:18,527 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-22 22:33:18,528 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-22 22:33:18,565 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:18,565 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:18,566 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-22 22:33:18,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:18,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:18,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:18,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:18,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:18,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:18,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:18,575 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-22 22:33:18,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:18,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:18,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:18,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:18,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:18,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:18,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:18,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:18,581 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-22 22:33:18,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:18,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:18,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:18,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:18,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:18,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:18,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:18,586 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-22 22:33:18,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:18,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:18,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:18,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:18,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:18,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:18,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:18,590 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:18,592 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:18,592 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:33:18,594 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:18,594 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:18,595 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:18,596 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:33:18,596 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:18,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,687 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-22 22:33:18,687 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-22 22:33:18,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-22 22:33:18,719 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 39 states and 58 transitions. Complement of second has 7 states. [2018-11-22 22:33:18,720 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-22 22:33:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-22 22:33:18,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:33:18,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,721 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:33:18,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,750 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-22 22:33:18,750 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-22 22:33:18,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-22 22:33:18,793 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 77 states and 108 transitions. Complement of second has 9 states. [2018-11-22 22:33:18,794 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-22 22:33:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-22 22:33:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:33:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,795 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:33:18,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:18,822 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-22 22:33:18,822 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-22 22:33:18,823 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-22 22:33:18,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand 5 states. Result 53 states and 81 transitions. Complement of second has 8 states. [2018-11-22 22:33:18,840 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-22 22:33:18,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-22 22:33:18,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:33:18,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 22:33:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-22 22:33:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:18,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 81 transitions. [2018-11-22 22:33:18,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-22 22:33:18,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 42 states and 60 transitions. [2018-11-22 22:33:18,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-22 22:33:18,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-22 22:33:18,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 60 transitions. [2018-11-22 22:33:18,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:18,859 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-11-22 22:33:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 60 transitions. [2018-11-22 22:33:18,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2018-11-22 22:33:18,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-22 22:33:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2018-11-22 22:33:18,861 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2018-11-22 22:33:18,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:33:18,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:33:18,861 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 3 states. [2018-11-22 22:33:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:18,868 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2018-11-22 22:33:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:33:18,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2018-11-22 22:33:18,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-22 22:33:18,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 41 transitions. [2018-11-22 22:33:18,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 22:33:18,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 22:33:18,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2018-11-22 22:33:18,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:18,871 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-22 22:33:18,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2018-11-22 22:33:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-22 22:33:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-22 22:33:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2018-11-22 22:33:18,872 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-22 22:33:18,872 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-22 22:33:18,873 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 22:33:18,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 39 transitions. [2018-11-22 22:33:18,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-22 22:33:18,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:18,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:18,873 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-22 22:33:18,873 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:18,874 INFO L794 eck$LassoCheckResult]: Stem: 836#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 842#L12 assume !(main_~i~0 >= 10); 843#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 856#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 851#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2018-11-22 22:33:18,874 INFO L796 eck$LassoCheckResult]: Loop: 848#L12-2 assume !(main_~i~0 <= 0); 850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 847#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 848#L12-2 [2018-11-22 22:33:18,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2018-11-22 22:33:18,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:18,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:18,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:18,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:33:18,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:33:18,887 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:18,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2018-11-22 22:33:18,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:18,912 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:18,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:18,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:18,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:18,913 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:18,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:18,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:18,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:18,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-22 22:33:18,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:18,913 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:18,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:18,917 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-22 22:33:18,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:18,927 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-22 22:33:18,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:18,949 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:18,955 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:18,955 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:18,975 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:18,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:18,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:19,079 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:19,080 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:19,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:19,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:19,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:19,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:19,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:19,081 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:19,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:19,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-22 22:33:19,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:19,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:19,082 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-22 22:33:19,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-22 22:33:19,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-22 22:33:19,089 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-22 22:33:19,113 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:19,113 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:19,113 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-22 22:33:19,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:19,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:19,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:19,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:19,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:19,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:19,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:19,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:19,115 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-22 22:33:19,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:19,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:19,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:19,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:19,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:19,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:19,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:19,117 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:19,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:19,118 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:33:19,118 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:19,118 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:19,118 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:19,118 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:33:19,118 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:19,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,140 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-22 22:33:19,141 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-22 22:33:19,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-22 22:33:19,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 39 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 70 states and 94 transitions. Complement of second has 7 states. [2018-11-22 22:33:19,156 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-22 22:33:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-22 22:33:19,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 22:33:19,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 22:33:19,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-22 22:33:19,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2018-11-22 22:33:19,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-22 22:33:19,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 56 states and 74 transitions. [2018-11-22 22:33:19,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-22 22:33:19,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:33:19,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2018-11-22 22:33:19,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:19,159 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2018-11-22 22:33:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2018-11-22 22:33:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2018-11-22 22:33:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 22:33:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2018-11-22 22:33:19,162 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2018-11-22 22:33:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:33:19,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:33:19,162 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand 4 states. [2018-11-22 22:33:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:19,172 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-22 22:33:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:33:19,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2018-11-22 22:33:19,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-22 22:33:19,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 54 states and 66 transitions. [2018-11-22 22:33:19,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-22 22:33:19,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 22:33:19,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2018-11-22 22:33:19,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:19,174 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-22 22:33:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2018-11-22 22:33:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-22 22:33:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-22 22:33:19,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-22 22:33:19,177 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-22 22:33:19,177 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-22 22:33:19,177 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 22:33:19,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-11-22 22:33:19,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-22 22:33:19,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:19,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:19,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-22 22:33:19,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 22:33:19,178 INFO L794 eck$LassoCheckResult]: Stem: 1092#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1093#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1112#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1113#L12-2 assume !(main_~i~0 <= 0); 1103#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1104#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1098#L12 assume !(main_~i~0 >= 10); 1099#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1106#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1094#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1095#L12 assume !(main_~i~0 >= 10); 1100#L12-2 assume !(main_~i~0 <= 0); 1105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1096#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1097#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2018-11-22 22:33:19,178 INFO L796 eck$LassoCheckResult]: Loop: 1107#L12-2 assume !(main_~i~0 <= 0); 1108#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1129#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1127#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1107#L12-2 [2018-11-22 22:33:19,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 2 times [2018-11-22 22:33:19,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:19,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 22:33:19,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:19,217 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:19,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:33:19,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:33:19,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:19,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-22 22:33:19,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:19,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-22 22:33:19,249 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:19,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 4 times [2018-11-22 22:33:19,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:19,280 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:19,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:19,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:19,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:19,280 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:19,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:19,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:19,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:19,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-22 22:33:19,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:19,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:19,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:19,286 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-22 22:33:19,289 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-22 22:33:19,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:19,312 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:19,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:19,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:19,328 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:19,328 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:19,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:19,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:19,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:19,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:19,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:19,349 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:19,370 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:19,370 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:19,456 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:19,458 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:19,458 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:19,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:19,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:19,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:19,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:19,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:19,458 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:19,459 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-22 22:33:19,459 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:19,459 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:19,459 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-22 22:33:19,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:19,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:19,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:19,490 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:19,491 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:19,491 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-22 22:33:19,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:19,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:19,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:19,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:19,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:19,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:19,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:19,496 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-22 22:33:19,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:19,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:19,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:19,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:19,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:19,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:19,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:19,498 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:19,499 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:19,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 22:33:19,500 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:19,500 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:19,500 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:19,500 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-22 22:33:19,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:19,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,522 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-22 22:33:19,523 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-22 22:33:19,523 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-22 22:33:19,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 64 states and 82 transitions. Complement of second has 7 states. [2018-11-22 22:33:19,537 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-22 22:33:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-22 22:33:19,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-22 22:33:19,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,537 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:33:19,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,569 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-22 22:33:19,569 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-22 22:33:19,569 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-22 22:33:19,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 86 states and 103 transitions. Complement of second has 9 states. [2018-11-22 22:33:19,593 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-22 22:33:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-22 22:33:19,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-22 22:33:19,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 22:33:19,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,619 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-22 22:33:19,619 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-22 22:33:19,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-22 22:33:19,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2018-11-22 22:33:19,633 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-22 22:33:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 22:33:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-22 22:33:19,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-22 22:33:19,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-22 22:33:19,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-22 22:33:19,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:19,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2018-11-22 22:33:19,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-22 22:33:19,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2018-11-22 22:33:19,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-22 22:33:19,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-22 22:33:19,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-11-22 22:33:19,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:19,636 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-22 22:33:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-11-22 22:33:19,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-11-22 22:33:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 22:33:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-22 22:33:19,638 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-22 22:33:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:33:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:33:19,639 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2018-11-22 22:33:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:19,650 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-22 22:33:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:33:19,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-11-22 22:33:19,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-22 22:33:19,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2018-11-22 22:33:19,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:33:19,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:33:19,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-11-22 22:33:19,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:19,652 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-22 22:33:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-11-22 22:33:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-22 22:33:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 22:33:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-22 22:33:19,653 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-22 22:33:19,653 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-22 22:33:19,653 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 22:33:19,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-22 22:33:19,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-22 22:33:19,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:19,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:19,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-22 22:33:19,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2018-11-22 22:33:19,656 INFO L794 eck$LassoCheckResult]: Stem: 1689#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1691#L12 assume !(main_~i~0 >= 10); 1694#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1696#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1697#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1713#L12 assume !(main_~i~0 >= 10); 1716#L12-2 assume !(main_~i~0 <= 0); 1715#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1712#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1702#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2018-11-22 22:33:19,656 INFO L796 eck$LassoCheckResult]: Loop: 1685#L12-2 assume !(main_~i~0 <= 0); 1686#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1698#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1719#L12 assume !(main_~i~0 >= 10); 1706#L12-2 assume !(main_~i~0 <= 0); 1711#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1704#L12 assume !(main_~i~0 >= 10); 1707#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1708#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1701#L12 assume !(main_~i~0 >= 10); 1699#L12-2 assume !(main_~i~0 <= 0); 1700#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1714#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1685#L12-2 [2018-11-22 22:33:19,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,656 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2018-11-22 22:33:19,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:19,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:19,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:19,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:19,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:19,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:19,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-22 22:33:19,716 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:19,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2018-11-22 22:33:19,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:19,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:19,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:19,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:19,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:19,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-22 22:33:19,763 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:19,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:33:19,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:33:19,764 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-22 22:33:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:19,780 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-22 22:33:19,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:33:19,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-11-22 22:33:19,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-22 22:33:19,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2018-11-22 22:33:19,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-22 22:33:19,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-22 22:33:19,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2018-11-22 22:33:19,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:19,782 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-22 22:33:19,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2018-11-22 22:33:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-22 22:33:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 22:33:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-22 22:33:19,784 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-22 22:33:19,784 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-22 22:33:19,784 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 22:33:19,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2018-11-22 22:33:19,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-22 22:33:19,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:19,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:19,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2018-11-22 22:33:19,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2018-11-22 22:33:19,785 INFO L794 eck$LassoCheckResult]: Stem: 1859#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1876#L12 assume !(main_~i~0 >= 10); 1877#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1892#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1890#L12 assume !(main_~i~0 >= 10); 1896#L12-2 assume !(main_~i~0 <= 0); 1895#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1863#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1864#L12 assume !(main_~i~0 >= 10); 1857#L12-2 assume !(main_~i~0 <= 0); 1858#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1869#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1891#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2018-11-22 22:33:19,786 INFO L796 eck$LassoCheckResult]: Loop: 1855#L12-2 assume !(main_~i~0 <= 0); 1856#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1886#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1884#L12 assume !(main_~i~0 >= 10); 1875#L12-2 assume !(main_~i~0 <= 0); 1881#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 1878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1873#L12 assume !(main_~i~0 >= 10); 1870#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 1871#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1862#L12 assume !(main_~i~0 >= 10); 1897#L12-2 assume !(main_~i~0 <= 0); 1867#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1865#L12 assume !(main_~i~0 >= 10); 1866#L12-2 assume !(main_~i~0 <= 0); 1872#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 1893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1894#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 1855#L12-2 [2018-11-22 22:33:19,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2018-11-22 22:33:19,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:19,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:19,810 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:19,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:33:19,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:33:19,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:19,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:19,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:19,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-22 22:33:19,845 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:19,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2018-11-22 22:33:19,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:19,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:19,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:19,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:33:19,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:33:19,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:19,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:19,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:19,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-22 22:33:19,900 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:33:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:33:19,901 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-22 22:33:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:19,917 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-22 22:33:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:33:19,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2018-11-22 22:33:19,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-22 22:33:19,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2018-11-22 22:33:19,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-22 22:33:19,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-22 22:33:19,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2018-11-22 22:33:19,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:19,919 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-22 22:33:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2018-11-22 22:33:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-22 22:33:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-22 22:33:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-22 22:33:19,921 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-22 22:33:19,921 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-22 22:33:19,921 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 22:33:19,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2018-11-22 22:33:19,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-22 22:33:19,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:19,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:19,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2018-11-22 22:33:19,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2018-11-22 22:33:19,923 INFO L794 eck$LassoCheckResult]: Stem: 2071#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2072#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2085#L12 assume !(main_~i~0 >= 10); 2086#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2101#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2098#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2099#L12 assume !(main_~i~0 >= 10); 2106#L12-2 assume !(main_~i~0 <= 0); 2107#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2111#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2109#L12 assume !(main_~i~0 >= 10); 2110#L12-2 assume !(main_~i~0 <= 0); 2079#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2076#L12 assume !(main_~i~0 >= 10); 2069#L12-2 assume !(main_~i~0 <= 0); 2070#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2102#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2100#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2018-11-22 22:33:19,923 INFO L796 eck$LassoCheckResult]: Loop: 2067#L12-2 assume !(main_~i~0 <= 0); 2068#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2093#L12 assume !(main_~i~0 >= 10); 2084#L12-2 assume !(main_~i~0 <= 0); 2090#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2087#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2082#L12 assume !(main_~i~0 >= 10); 2080#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2078#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2073#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2074#L12 assume !(main_~i~0 >= 10); 2077#L12-2 assume !(main_~i~0 <= 0); 2081#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2117#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2116#L12 assume !(main_~i~0 >= 10); 2115#L12-2 assume !(main_~i~0 <= 0); 2114#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2113#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2112#L12 assume !(main_~i~0 >= 10); 2108#L12-2 assume !(main_~i~0 <= 0); 2105#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2103#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2104#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2067#L12-2 [2018-11-22 22:33:19,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2018-11-22 22:33:19,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:19,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:19,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:19,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:33:19,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 22:33:19,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:19,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:19,976 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:19,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:19,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 22:33:19,993 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:19,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2018-11-22 22:33:19,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:19,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,020 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:33:20,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 22:33:20,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,036 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 22:33:20,050 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:33:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:33:20,051 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-22 22:33:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:20,093 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-22 22:33:20,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:33:20,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-11-22 22:33:20,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-22 22:33:20,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2018-11-22 22:33:20,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-22 22:33:20,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 22:33:20,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2018-11-22 22:33:20,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:20,096 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-22 22:33:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2018-11-22 22:33:20,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-22 22:33:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-22 22:33:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-22 22:33:20,098 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-22 22:33:20,098 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-22 22:33:20,098 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 22:33:20,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2018-11-22 22:33:20,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-22 22:33:20,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:20,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:20,099 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2018-11-22 22:33:20,099 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2018-11-22 22:33:20,099 INFO L794 eck$LassoCheckResult]: Stem: 2325#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2337#L12 assume !(main_~i~0 >= 10); 2338#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2356#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2354#L12 assume !(main_~i~0 >= 10); 2379#L12-2 assume !(main_~i~0 <= 0); 2378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2330#L12 assume !(main_~i~0 >= 10); 2323#L12-2 assume !(main_~i~0 <= 0); 2324#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2377#L12 assume !(main_~i~0 >= 10); 2376#L12-2 assume !(main_~i~0 <= 0); 2375#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2358#L12 assume !(main_~i~0 >= 10); 2363#L12-2 assume !(main_~i~0 <= 0); 2361#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2355#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2018-11-22 22:33:20,099 INFO L796 eck$LassoCheckResult]: Loop: 2321#L12-2 assume !(main_~i~0 <= 0); 2322#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2351#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2349#L12 assume !(main_~i~0 >= 10); 2341#L12-2 assume !(main_~i~0 <= 0); 2346#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2344#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2339#L12 assume !(main_~i~0 >= 10); 2335#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2336#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2328#L12 assume !(main_~i~0 >= 10); 2331#L12-2 assume !(main_~i~0 <= 0); 2332#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2373#L12 assume !(main_~i~0 >= 10); 2372#L12-2 assume !(main_~i~0 <= 0); 2371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2369#L12 assume !(main_~i~0 >= 10); 2368#L12-2 assume !(main_~i~0 <= 0); 2367#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2365#L12 assume !(main_~i~0 >= 10); 2364#L12-2 assume !(main_~i~0 <= 0); 2362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2360#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2321#L12-2 [2018-11-22 22:33:20,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,100 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2018-11-22 22:33:20,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:33:20,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:33:20,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-22 22:33:20,177 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:20,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,177 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2018-11-22 22:33:20,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:33:20,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:33:20,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-22 22:33:20,260 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:20,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:33:20,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:33:20,260 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-22 22:33:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:20,303 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-22 22:33:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:33:20,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-11-22 22:33:20,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-22 22:33:20,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2018-11-22 22:33:20,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-22 22:33:20,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-22 22:33:20,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-11-22 22:33:20,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:20,306 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-22 22:33:20,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-11-22 22:33:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-11-22 22:33:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-22 22:33:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-22 22:33:20,308 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-22 22:33:20,308 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-22 22:33:20,308 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-22 22:33:20,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2018-11-22 22:33:20,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-22 22:33:20,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:20,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:20,310 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2018-11-22 22:33:20,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2018-11-22 22:33:20,311 INFO L794 eck$LassoCheckResult]: Stem: 2621#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2622#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2633#L12 assume !(main_~i~0 >= 10); 2634#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2651#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2628#L12 assume !(main_~i~0 >= 10); 2619#L12-2 assume !(main_~i~0 <= 0); 2620#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2625#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2626#L12 assume !(main_~i~0 >= 10); 2683#L12-2 assume !(main_~i~0 <= 0); 2682#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2681#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2680#L12 assume !(main_~i~0 >= 10); 2679#L12-2 assume !(main_~i~0 <= 0); 2678#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2677#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2676#L12 assume !(main_~i~0 >= 10); 2675#L12-2 assume !(main_~i~0 <= 0); 2674#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2673#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2653#L12 assume !(main_~i~0 >= 10); 2658#L12-2 assume !(main_~i~0 <= 0); 2656#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2650#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2018-11-22 22:33:20,311 INFO L796 eck$LassoCheckResult]: Loop: 2617#L12-2 assume !(main_~i~0 <= 0); 2618#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2647#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2645#L12 assume !(main_~i~0 >= 10); 2637#L12-2 assume !(main_~i~0 <= 0); 2642#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2640#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2635#L12 assume !(main_~i~0 >= 10); 2631#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2632#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2624#L12 assume !(main_~i~0 >= 10); 2627#L12-2 assume !(main_~i~0 <= 0); 2629#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2672#L12 assume !(main_~i~0 >= 10); 2671#L12-2 assume !(main_~i~0 <= 0); 2670#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2669#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2668#L12 assume !(main_~i~0 >= 10); 2667#L12-2 assume !(main_~i~0 <= 0); 2666#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2665#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2664#L12 assume !(main_~i~0 >= 10); 2663#L12-2 assume !(main_~i~0 <= 0); 2662#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2661#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2660#L12 assume !(main_~i~0 >= 10); 2659#L12-2 assume !(main_~i~0 <= 0); 2657#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2654#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2655#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2617#L12-2 [2018-11-22 22:33:20,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2018-11-22 22:33:20,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,358 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 22:33:20,374 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-22 22:33:20,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-22 22:33:20,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:20,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2018-11-22 22:33:20,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,436 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,444 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 22:33:20,453 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-22 22:33:20,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-22 22:33:20,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:20,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:33:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:33:20,478 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-22 22:33:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:20,539 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-22 22:33:20,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:33:20,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-11-22 22:33:20,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-22 22:33:20,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2018-11-22 22:33:20,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-22 22:33:20,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-22 22:33:20,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-11-22 22:33:20,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:20,542 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-22 22:33:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-11-22 22:33:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-22 22:33:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-22 22:33:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-11-22 22:33:20,545 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-22 22:33:20,545 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-22 22:33:20,545 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-22 22:33:20,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2018-11-22 22:33:20,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-22 22:33:20,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:20,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:20,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2018-11-22 22:33:20,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2018-11-22 22:33:20,547 INFO L794 eck$LassoCheckResult]: Stem: 2959#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2960#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2975#L12 assume !(main_~i~0 >= 10); 2976#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2991#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2988#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2989#L12 assume !(main_~i~0 >= 10); 3029#L12-2 assume !(main_~i~0 <= 0); 3028#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2963#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2964#L12 assume !(main_~i~0 >= 10); 2957#L12-2 assume !(main_~i~0 <= 0); 2958#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2968#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3027#L12 assume !(main_~i~0 >= 10); 3026#L12-2 assume !(main_~i~0 <= 0); 3025#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3024#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3023#L12 assume !(main_~i~0 >= 10); 3022#L12-2 assume !(main_~i~0 <= 0); 3021#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3019#L12 assume !(main_~i~0 >= 10); 3018#L12-2 assume !(main_~i~0 <= 0); 3017#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3016#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2995#L12 assume !(main_~i~0 >= 10); 2999#L12-2 assume !(main_~i~0 <= 0); 2997#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2994#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2990#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2018-11-22 22:33:20,547 INFO L796 eck$LassoCheckResult]: Loop: 2955#L12-2 assume !(main_~i~0 <= 0); 2956#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2985#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2983#L12 assume !(main_~i~0 >= 10); 2974#L12-2 assume !(main_~i~0 <= 0); 2980#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 2977#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2972#L12 assume !(main_~i~0 >= 10); 2969#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 2966#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2967#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3015#L12 assume !(main_~i~0 >= 10); 2970#L12-2 assume !(main_~i~0 <= 0); 2971#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2962#L12 assume !(main_~i~0 >= 10); 2965#L12-2 assume !(main_~i~0 <= 0); 3014#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3012#L12 assume !(main_~i~0 >= 10); 3011#L12-2 assume !(main_~i~0 <= 0); 3010#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3009#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3008#L12 assume !(main_~i~0 >= 10); 3007#L12-2 assume !(main_~i~0 <= 0); 3006#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3004#L12 assume !(main_~i~0 >= 10); 3003#L12-2 assume !(main_~i~0 <= 0); 3002#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3001#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3000#L12 assume !(main_~i~0 >= 10); 2998#L12-2 assume !(main_~i~0 <= 0); 2996#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 2992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2993#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 2955#L12-2 [2018-11-22 22:33:20,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2018-11-22 22:33:20,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,619 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,625 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 22:33:20,632 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-22 22:33:20,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-22 22:33:20,662 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:20,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2018-11-22 22:33:20,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,711 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,711 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 22:33:20,725 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-22 22:33:20,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:20,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 60 proven. 78 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-22 22:33:20,758 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:20,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:33:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:33:20,758 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2018-11-22 22:33:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:20,790 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-22 22:33:20,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:33:20,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2018-11-22 22:33:20,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-22 22:33:20,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2018-11-22 22:33:20,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-22 22:33:20,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-22 22:33:20,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2018-11-22 22:33:20,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:20,793 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-22 22:33:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2018-11-22 22:33:20,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-11-22 22:33:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-22 22:33:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-11-22 22:33:20,795 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-22 22:33:20,796 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-22 22:33:20,796 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-22 22:33:20,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2018-11-22 22:33:20,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-22 22:33:20,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:20,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:20,797 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2018-11-22 22:33:20,797 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2018-11-22 22:33:20,797 INFO L794 eck$LassoCheckResult]: Stem: 3339#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3340#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3352#L12 assume !(main_~i~0 >= 10); 3353#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3371#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3368#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3369#L12 assume !(main_~i~0 >= 10); 3417#L12-2 assume !(main_~i~0 <= 0); 3416#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3343#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3344#L12 assume !(main_~i~0 >= 10); 3337#L12-2 assume !(main_~i~0 <= 0); 3338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3348#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3415#L12 assume !(main_~i~0 >= 10); 3414#L12-2 assume !(main_~i~0 <= 0); 3413#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3411#L12 assume !(main_~i~0 >= 10); 3410#L12-2 assume !(main_~i~0 <= 0); 3409#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3407#L12 assume !(main_~i~0 >= 10); 3406#L12-2 assume !(main_~i~0 <= 0); 3405#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3403#L12 assume !(main_~i~0 >= 10); 3402#L12-2 assume !(main_~i~0 <= 0); 3401#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3400#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3375#L12 assume !(main_~i~0 >= 10); 3379#L12-2 assume !(main_~i~0 <= 0); 3377#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3370#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2018-11-22 22:33:20,798 INFO L796 eck$LassoCheckResult]: Loop: 3335#L12-2 assume !(main_~i~0 <= 0); 3336#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3366#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3364#L12 assume !(main_~i~0 >= 10); 3356#L12-2 assume !(main_~i~0 <= 0); 3361#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3359#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3354#L12 assume !(main_~i~0 >= 10); 3349#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3347#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3399#L12 assume !(main_~i~0 >= 10); 3350#L12-2 assume !(main_~i~0 <= 0); 3351#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3341#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3342#L12 assume !(main_~i~0 >= 10); 3345#L12-2 assume !(main_~i~0 <= 0); 3398#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3397#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3396#L12 assume !(main_~i~0 >= 10); 3395#L12-2 assume !(main_~i~0 <= 0); 3394#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3393#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3392#L12 assume !(main_~i~0 >= 10); 3391#L12-2 assume !(main_~i~0 <= 0); 3390#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3388#L12 assume !(main_~i~0 >= 10); 3387#L12-2 assume !(main_~i~0 <= 0); 3386#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3385#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3384#L12 assume !(main_~i~0 >= 10); 3383#L12-2 assume !(main_~i~0 <= 0); 3382#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3380#L12 assume !(main_~i~0 >= 10); 3378#L12-2 assume !(main_~i~0 <= 0); 3376#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3372#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3373#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3335#L12-2 [2018-11-22 22:33:20,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,798 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2018-11-22 22:33:20,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:20,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:20,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-22 22:33:20,916 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:20,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2018-11-22 22:33:20,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:20,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:20,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:20,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:20,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:20,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:20,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 69 proven. 105 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:20,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:20,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-22 22:33:20,999 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:20,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 22:33:20,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-22 22:33:20,999 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-22 22:33:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:21,045 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-22 22:33:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:33:21,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2018-11-22 22:33:21,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-22 22:33:21,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2018-11-22 22:33:21,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-22 22:33:21,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-22 22:33:21,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2018-11-22 22:33:21,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:21,048 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-22 22:33:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2018-11-22 22:33:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-11-22 22:33:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-22 22:33:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-11-22 22:33:21,050 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-22 22:33:21,050 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-22 22:33:21,050 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-22 22:33:21,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2018-11-22 22:33:21,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-22 22:33:21,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:21,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:21,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2018-11-22 22:33:21,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2018-11-22 22:33:21,056 INFO L794 eck$LassoCheckResult]: Stem: 3761#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3776#L12 assume !(main_~i~0 >= 10); 3777#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3791#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3768#L12 assume !(main_~i~0 >= 10); 3759#L12-2 assume !(main_~i~0 <= 0); 3760#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3766#L12 assume !(main_~i~0 >= 10); 3847#L12-2 assume !(main_~i~0 <= 0); 3846#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3844#L12 assume !(main_~i~0 >= 10); 3843#L12-2 assume !(main_~i~0 <= 0); 3842#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3840#L12 assume !(main_~i~0 >= 10); 3839#L12-2 assume !(main_~i~0 <= 0); 3838#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3836#L12 assume !(main_~i~0 >= 10); 3835#L12-2 assume !(main_~i~0 <= 0); 3834#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3833#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3832#L12 assume !(main_~i~0 >= 10); 3831#L12-2 assume !(main_~i~0 <= 0); 3830#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3829#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3828#L12 assume !(main_~i~0 >= 10); 3827#L12-2 assume !(main_~i~0 <= 0); 3826#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3825#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3793#L12 assume !(main_~i~0 >= 10); 3798#L12-2 assume !(main_~i~0 <= 0); 3796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3792#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3790#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2018-11-22 22:33:21,056 INFO L796 eck$LassoCheckResult]: Loop: 3757#L12-2 assume !(main_~i~0 <= 0); 3758#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3784#L12 assume !(main_~i~0 >= 10); 3775#L12-2 assume !(main_~i~0 <= 0); 3781#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 3778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3773#L12 assume !(main_~i~0 >= 10); 3771#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 3772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3763#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3764#L12 assume !(main_~i~0 >= 10); 3767#L12-2 assume !(main_~i~0 <= 0); 3769#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3824#L12 assume !(main_~i~0 >= 10); 3823#L12-2 assume !(main_~i~0 <= 0); 3822#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3821#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3820#L12 assume !(main_~i~0 >= 10); 3819#L12-2 assume !(main_~i~0 <= 0); 3818#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3817#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3816#L12 assume !(main_~i~0 >= 10); 3815#L12-2 assume !(main_~i~0 <= 0); 3814#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3812#L12 assume !(main_~i~0 >= 10); 3811#L12-2 assume !(main_~i~0 <= 0); 3810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3809#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3808#L12 assume !(main_~i~0 >= 10); 3807#L12-2 assume !(main_~i~0 <= 0); 3806#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3804#L12 assume !(main_~i~0 >= 10); 3803#L12-2 assume !(main_~i~0 <= 0); 3802#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3801#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3800#L12 assume !(main_~i~0 >= 10); 3799#L12-2 assume !(main_~i~0 <= 0); 3797#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 3794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3795#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 3757#L12-2 [2018-11-22 22:33:21,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2018-11-22 22:33:21,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:21,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:21,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:21,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:21,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:33:21,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:33:21,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:21,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:33:21,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:21,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-22 22:33:21,188 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 22:33:21,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2018-11-22 22:33:21,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:21,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:21,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:21,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:33:21,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:33:21,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:21,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 136 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:33:21,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-22 22:33:21,280 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 22:33:21,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:33:21,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:33:21,281 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2018-11-22 22:33:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:21,349 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2018-11-22 22:33:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:33:21,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 215 transitions. [2018-11-22 22:33:21,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2018-11-22 22:33:21,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 190 states and 211 transitions. [2018-11-22 22:33:21,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-22 22:33:21,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2018-11-22 22:33:21,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 211 transitions. [2018-11-22 22:33:21,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:21,352 INFO L705 BuchiCegarLoop]: Abstraction has 190 states and 211 transitions. [2018-11-22 22:33:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 211 transitions. [2018-11-22 22:33:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2018-11-22 22:33:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-22 22:33:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2018-11-22 22:33:21,355 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-11-22 22:33:21,355 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-11-22 22:33:21,355 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-22 22:33:21,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 184 transitions. [2018-11-22 22:33:21,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:21,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:21,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:21,357 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:21,357 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2018-11-22 22:33:21,357 INFO L794 eck$LassoCheckResult]: Stem: 4314#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4315#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4317#L12 assume !(main_~i~0 >= 10); 4409#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4408#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4322#L12 assume !(main_~i~0 >= 10); 4323#L12-2 assume !(main_~i~0 <= 0); 4406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4319#L12 assume !(main_~i~0 >= 10); 4312#L12-2 assume !(main_~i~0 <= 0); 4313#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4405#L12 assume !(main_~i~0 >= 10); 4404#L12-2 assume !(main_~i~0 <= 0); 4403#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4402#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4401#L12 assume !(main_~i~0 >= 10); 4400#L12-2 assume !(main_~i~0 <= 0); 4399#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4397#L12 assume !(main_~i~0 >= 10); 4396#L12-2 assume !(main_~i~0 <= 0); 4395#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4393#L12 assume !(main_~i~0 >= 10); 4392#L12-2 assume !(main_~i~0 <= 0); 4391#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4389#L12 assume !(main_~i~0 >= 10); 4388#L12-2 assume !(main_~i~0 <= 0); 4387#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4385#L12 assume !(main_~i~0 >= 10); 4384#L12-2 assume !(main_~i~0 <= 0); 4383#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4339#L12 assume !(main_~i~0 >= 10); 4343#L12-2 assume !(main_~i~0 <= 0); 4341#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4332#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2018-11-22 22:33:21,357 INFO L796 eck$LassoCheckResult]: Loop: 4331#L12-2 assume !(main_~i~0 <= 0); 4326#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4333#L12 assume !(main_~i~0 >= 10); 4335#L12-2 assume !(main_~i~0 <= 0); 4472#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 4411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4412#L12 assume !(main_~i~0 >= 10); 4379#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 4378#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4377#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4376#L12 assume !(main_~i~0 >= 10); 4375#L12-2 assume !(main_~i~0 <= 0); 4374#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4373#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4372#L12 assume !(main_~i~0 >= 10); 4371#L12-2 assume !(main_~i~0 <= 0); 4370#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4369#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4368#L12 assume !(main_~i~0 >= 10); 4367#L12-2 assume !(main_~i~0 <= 0); 4366#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4364#L12 assume !(main_~i~0 >= 10); 4363#L12-2 assume !(main_~i~0 <= 0); 4362#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4360#L12 assume !(main_~i~0 >= 10); 4359#L12-2 assume !(main_~i~0 <= 0); 4358#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4356#L12 assume !(main_~i~0 >= 10); 4355#L12-2 assume !(main_~i~0 <= 0); 4354#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4353#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4352#L12 assume !(main_~i~0 >= 10); 4351#L12-2 assume !(main_~i~0 <= 0); 4350#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4348#L12 assume !(main_~i~0 >= 10); 4347#L12-2 assume !(main_~i~0 <= 0); 4346#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4345#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4344#L12 assume !(main_~i~0 >= 10); 4342#L12-2 assume !(main_~i~0 <= 0); 4340#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 4336#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4337#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 4331#L12-2 [2018-11-22 22:33:21,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2018-11-22 22:33:21,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,378 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2018-11-22 22:33:21,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 3 times [2018-11-22 22:33:21,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:21,424 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 591 proven. 6 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:21,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:21,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:21,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:33:21,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-11-22 22:33:21,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 752 proven. 10 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-11-22 22:33:21,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:21,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 13 [2018-11-22 22:33:21,628 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 53 [2018-11-22 22:33:21,634 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:21,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:21,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:21,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:21,635 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:21,635 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:21,635 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:21,635 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:21,635 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-22 22:33:21,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:21,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:21,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:21,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:21,644 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-22 22:33:21,646 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-22 22:33:21,676 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:21,676 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:21,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:21,678 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:21,693 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:21,693 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:21,696 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:21,696 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:21,712 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:21,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:21,715 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:21,728 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:21,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:21,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:21,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:21,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:21,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:21,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:21,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:21,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-22 22:33:21,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:21,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:21,729 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-22 22:33:21,733 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-22 22:33:21,734 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-22 22:33:21,737 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-22 22:33:21,756 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:21,757 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:21,757 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-22 22:33:21,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:21,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:21,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:21,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:21,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:21,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:21,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:21,760 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:21,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:21,761 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:21,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:21,761 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:21,761 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:21,761 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 6 Supporting invariants [] [2018-11-22 22:33:21,761 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:21,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:21,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:21,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:21,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 22:33:21,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24 Second operand 6 states. [2018-11-22 22:33:21,891 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163 states and 184 transitions. cyclomatic complexity: 24. Second operand 6 states. Result 473 states and 516 transitions. Complement of second has 15 states. [2018-11-22 22:33:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-22 22:33:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-22 22:33:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-22 22:33:21,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2018-11-22 22:33:21,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:21,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2018-11-22 22:33:21,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:21,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2018-11-22 22:33:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:21,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 516 transitions. [2018-11-22 22:33:21,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:21,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 431 states and 474 transitions. [2018-11-22 22:33:21,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-22 22:33:21,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 211 [2018-11-22 22:33:21,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 474 transitions. [2018-11-22 22:33:21,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:21,899 INFO L705 BuchiCegarLoop]: Abstraction has 431 states and 474 transitions. [2018-11-22 22:33:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 474 transitions. [2018-11-22 22:33:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 409. [2018-11-22 22:33:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-22 22:33:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 450 transitions. [2018-11-22 22:33:21,904 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 450 transitions. [2018-11-22 22:33:21,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:33:21,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:33:21,904 INFO L87 Difference]: Start difference. First operand 409 states and 450 transitions. Second operand 13 states. [2018-11-22 22:33:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:21,929 INFO L93 Difference]: Finished difference Result 274 states and 305 transitions. [2018-11-22 22:33:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:33:21,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 305 transitions. [2018-11-22 22:33:21,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:21,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 255 states and 286 transitions. [2018-11-22 22:33:21,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-22 22:33:21,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-22 22:33:21,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 286 transitions. [2018-11-22 22:33:21,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:21,933 INFO L705 BuchiCegarLoop]: Abstraction has 255 states and 286 transitions. [2018-11-22 22:33:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 286 transitions. [2018-11-22 22:33:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 167. [2018-11-22 22:33:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-22 22:33:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2018-11-22 22:33:21,936 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-11-22 22:33:21,936 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-11-22 22:33:21,936 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-22 22:33:21,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 188 transitions. [2018-11-22 22:33:21,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:21,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:21,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:21,938 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:21,938 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2018-11-22 22:33:21,942 INFO L794 eck$LassoCheckResult]: Stem: 6228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 6229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6243#L12 assume !(main_~i~0 >= 10); 6320#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6319#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6234#L12 assume !(main_~i~0 >= 10); 6226#L12-2 assume !(main_~i~0 <= 0); 6227#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6232#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6233#L12 assume !(main_~i~0 >= 10); 6317#L12-2 assume !(main_~i~0 <= 0); 6236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6237#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6316#L12 assume !(main_~i~0 >= 10); 6315#L12-2 assume !(main_~i~0 <= 0); 6314#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6312#L12 assume !(main_~i~0 >= 10); 6311#L12-2 assume !(main_~i~0 <= 0); 6310#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6308#L12 assume !(main_~i~0 >= 10); 6307#L12-2 assume !(main_~i~0 <= 0); 6306#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6304#L12 assume !(main_~i~0 >= 10); 6303#L12-2 assume !(main_~i~0 <= 0); 6302#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6300#L12 assume !(main_~i~0 >= 10); 6299#L12-2 assume !(main_~i~0 <= 0); 6298#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6296#L12 assume !(main_~i~0 >= 10); 6295#L12-2 assume !(main_~i~0 <= 0); 6294#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6293#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6249#L12 assume !(main_~i~0 >= 10); 6292#L12-2 assume !(main_~i~0 <= 0); 6291#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6248#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6247#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2018-11-22 22:33:21,942 INFO L796 eck$LassoCheckResult]: Loop: 6246#L12-2 assume !(main_~i~0 <= 0); 6244#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6242#L12 assume !(main_~i~0 >= 10); 6326#L12-2 assume !(main_~i~0 <= 0); 6324#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6330#L12 assume !(main_~i~0 >= 10); 6331#L12-2 assume !(main_~i~0 <= 0); 6327#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 6322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6323#L12 assume !(main_~i~0 >= 10); 6289#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 6288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6286#L12 assume !(main_~i~0 >= 10); 6285#L12-2 assume !(main_~i~0 <= 0); 6284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6282#L12 assume !(main_~i~0 >= 10); 6281#L12-2 assume !(main_~i~0 <= 0); 6280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6278#L12 assume !(main_~i~0 >= 10); 6277#L12-2 assume !(main_~i~0 <= 0); 6276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6274#L12 assume !(main_~i~0 >= 10); 6273#L12-2 assume !(main_~i~0 <= 0); 6272#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6270#L12 assume !(main_~i~0 >= 10); 6269#L12-2 assume !(main_~i~0 <= 0); 6268#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6266#L12 assume !(main_~i~0 >= 10); 6265#L12-2 assume !(main_~i~0 <= 0); 6264#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6262#L12 assume !(main_~i~0 >= 10); 6261#L12-2 assume !(main_~i~0 <= 0); 6260#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6258#L12 assume !(main_~i~0 >= 10); 6257#L12-2 assume !(main_~i~0 <= 0); 6256#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6254#L12 assume !(main_~i~0 >= 10); 6253#L12-2 assume !(main_~i~0 <= 0); 6252#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 6250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6251#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 6246#L12-2 [2018-11-22 22:33:21,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,942 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2018-11-22 22:33:21,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2018-11-22 22:33:21,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:21,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 4 times [2018-11-22 22:33:21,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:21,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:21,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:21,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:21,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:21,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:21,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:33:22,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:33:22,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:22,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:22,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:22,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 22:33:22,189 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 53 [2018-11-22 22:33:22,195 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:22,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:22,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:22,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:22,196 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:22,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:22,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:22,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:22,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-22 22:33:22,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:22,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:22,197 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-22 22:33:22,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-22 22:33:22,201 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-22 22:33:22,204 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-22 22:33:22,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:22,230 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:22,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:22,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:22,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:22,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:22,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:22,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:22,272 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:22,272 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:22,278 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:22,278 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:22,281 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:22,281 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:22,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:22,298 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:22,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:22,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:22,317 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:22,330 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:22,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:22,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:22,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:22,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:22,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:22,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:22,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:22,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-22 22:33:22,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:22,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:22,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:22,333 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-22 22:33:22,335 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-22 22:33:22,337 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-22 22:33:22,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:22,368 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:22,368 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-22 22:33:22,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:22,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:22,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:22,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:22,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:22,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:22,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:22,371 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-22 22:33:22,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:22,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:22,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:22,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:22,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:22,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:22,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:22,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:22,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-22 22:33:22,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:22,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:22,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:22,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:22,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:22,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:22,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:22,375 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-22 22:33:22,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:22,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:22,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:22,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:22,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:22,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:22,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:22,377 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:22,378 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:22,378 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:22,378 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:22,378 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:22,379 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:22,379 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2018-11-22 22:33:22,379 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:22,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:22,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:22,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:22,537 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-22 22:33:22,537 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24 Second operand 7 states. [2018-11-22 22:33:22,732 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 167 states and 188 transitions. cyclomatic complexity: 24. Second operand 7 states. Result 529 states and 572 transitions. Complement of second has 19 states. [2018-11-22 22:33:22,732 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-22 22:33:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-22 22:33:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-22 22:33:22,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2018-11-22 22:33:22,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:22,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2018-11-22 22:33:22,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:22,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2018-11-22 22:33:22,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:22,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 529 states and 572 transitions. [2018-11-22 22:33:22,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:22,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 529 states to 459 states and 502 transitions. [2018-11-22 22:33:22,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2018-11-22 22:33:22,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2018-11-22 22:33:22,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 502 transitions. [2018-11-22 22:33:22,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:22,739 INFO L705 BuchiCegarLoop]: Abstraction has 459 states and 502 transitions. [2018-11-22 22:33:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 502 transitions. [2018-11-22 22:33:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 417. [2018-11-22 22:33:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-22 22:33:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 456 transitions. [2018-11-22 22:33:22,745 INFO L728 BuchiCegarLoop]: Abstraction has 417 states and 456 transitions. [2018-11-22 22:33:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:33:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:33:22,745 INFO L87 Difference]: Start difference. First operand 417 states and 456 transitions. Second operand 6 states. [2018-11-22 22:33:22,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:22,765 INFO L93 Difference]: Finished difference Result 290 states and 319 transitions. [2018-11-22 22:33:22,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:33:22,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 319 transitions. [2018-11-22 22:33:22,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:22,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 263 states and 292 transitions. [2018-11-22 22:33:22,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2018-11-22 22:33:22,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2018-11-22 22:33:22,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 292 transitions. [2018-11-22 22:33:22,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:22,768 INFO L705 BuchiCegarLoop]: Abstraction has 263 states and 292 transitions. [2018-11-22 22:33:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 292 transitions. [2018-11-22 22:33:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 171. [2018-11-22 22:33:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-22 22:33:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 191 transitions. [2018-11-22 22:33:22,771 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2018-11-22 22:33:22,771 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 191 transitions. [2018-11-22 22:33:22,771 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-22 22:33:22,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 191 transitions. [2018-11-22 22:33:22,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:22,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:22,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:22,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:22,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2018-11-22 22:33:22,773 INFO L794 eck$LassoCheckResult]: Stem: 8251#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 8252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8266#L12 assume !(main_~i~0 >= 10); 8344#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8343#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8257#L12 assume !(main_~i~0 >= 10); 8249#L12-2 assume !(main_~i~0 <= 0); 8250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8256#L12 assume !(main_~i~0 >= 10); 8341#L12-2 assume !(main_~i~0 <= 0); 8259#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8340#L12 assume !(main_~i~0 >= 10); 8339#L12-2 assume !(main_~i~0 <= 0); 8338#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8337#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8336#L12 assume !(main_~i~0 >= 10); 8335#L12-2 assume !(main_~i~0 <= 0); 8334#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8333#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8332#L12 assume !(main_~i~0 >= 10); 8331#L12-2 assume !(main_~i~0 <= 0); 8330#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8328#L12 assume !(main_~i~0 >= 10); 8327#L12-2 assume !(main_~i~0 <= 0); 8326#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8324#L12 assume !(main_~i~0 >= 10); 8323#L12-2 assume !(main_~i~0 <= 0); 8322#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8320#L12 assume !(main_~i~0 >= 10); 8319#L12-2 assume !(main_~i~0 <= 0); 8318#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8275#L12 assume !(main_~i~0 >= 10); 8316#L12-2 assume !(main_~i~0 <= 0); 8315#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8271#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2018-11-22 22:33:22,773 INFO L796 eck$LassoCheckResult]: Loop: 8269#L12-2 assume !(main_~i~0 <= 0); 8267#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8381#L12 assume !(main_~i~0 >= 10); 8380#L12-2 assume !(main_~i~0 <= 0); 8379#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8377#L12 assume !(main_~i~0 >= 10); 8376#L12-2 assume !(main_~i~0 <= 0); 8375#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8351#L12 assume !(main_~i~0 >= 10); 8350#L12-2 assume !(main_~i~0 <= 0); 8348#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 8349#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8352#L12 assume !(main_~i~0 >= 10); 8313#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 8312#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8311#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8310#L12 assume !(main_~i~0 >= 10); 8309#L12-2 assume !(main_~i~0 <= 0); 8308#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8306#L12 assume !(main_~i~0 >= 10); 8305#L12-2 assume !(main_~i~0 <= 0); 8304#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8303#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8302#L12 assume !(main_~i~0 >= 10); 8301#L12-2 assume !(main_~i~0 <= 0); 8300#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8298#L12 assume !(main_~i~0 >= 10); 8297#L12-2 assume !(main_~i~0 <= 0); 8296#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8295#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8294#L12 assume !(main_~i~0 >= 10); 8293#L12-2 assume !(main_~i~0 <= 0); 8292#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8290#L12 assume !(main_~i~0 >= 10); 8289#L12-2 assume !(main_~i~0 <= 0); 8288#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8286#L12 assume !(main_~i~0 >= 10); 8285#L12-2 assume !(main_~i~0 <= 0); 8284#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8282#L12 assume !(main_~i~0 >= 10); 8281#L12-2 assume !(main_~i~0 <= 0); 8280#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8278#L12 assume !(main_~i~0 >= 10); 8277#L12-2 assume !(main_~i~0 <= 0); 8276#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 8272#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8273#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 8269#L12-2 [2018-11-22 22:33:22,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2018-11-22 22:33:22,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:22,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:22,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:22,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2018-11-22 22:33:22,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:22,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:22,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 5 times [2018-11-22 22:33:22,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:22,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:22,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:22,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:22,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:22,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:22,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:22,851 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 22:33:22,861 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-22 22:33:22,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:22,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:22,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:22,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-22 22:33:23,029 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 58 [2018-11-22 22:33:23,034 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:23,034 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:23,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:23,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:23,034 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:23,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:23,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:23,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:23,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-22 22:33:23,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:23,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:23,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:23,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:23,039 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-22 22:33:23,041 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-22 22:33:23,062 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:23,062 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:23,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:23,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:23,079 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:23,080 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:23,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:23,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:23,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:23,084 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:23,099 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:23,099 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:23,113 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:23,113 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_17=0} Honda state: {v_rep~unnamed0~0~false_17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:23,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:23,117 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:23,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:23,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:23,140 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:23,153 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:23,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:23,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:23,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:23,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:23,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:23,153 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:23,153 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:23,153 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-22 22:33:23,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:23,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:23,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-22 22:33:23,155 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-22 22:33:23,158 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-22 22:33:23,160 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-22 22:33:23,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:23,182 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:23,182 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-22 22:33:23,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:23,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:23,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:23,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:23,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:23,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:23,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:23,184 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-22 22:33:23,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:23,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:23,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:23,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:23,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:23,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:23,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:23,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:23,185 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-22 22:33:23,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:23,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:23,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:23,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:23,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:23,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:23,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:23,187 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-22 22:33:23,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:23,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:23,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:23,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:23,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:23,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:23,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:23,189 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:23,189 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:23,190 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:23,190 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:23,190 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:23,190 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:23,190 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2018-11-22 22:33:23,190 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:23,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:23,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:23,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:23,251 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-22 22:33:23,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23 Second operand 8 states. [2018-11-22 22:33:23,385 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 191 transitions. cyclomatic complexity: 23. Second operand 8 states. Result 601 states and 644 transitions. Complement of second has 23 states. [2018-11-22 22:33:23,385 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-22 22:33:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-22 22:33:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-22 22:33:23,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2018-11-22 22:33:23,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:23,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2018-11-22 22:33:23,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:23,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2018-11-22 22:33:23,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:23,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 644 transitions. [2018-11-22 22:33:23,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:23,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 495 states and 538 transitions. [2018-11-22 22:33:23,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 247 [2018-11-22 22:33:23,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2018-11-22 22:33:23,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 538 transitions. [2018-11-22 22:33:23,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:23,392 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 538 transitions. [2018-11-22 22:33:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 538 transitions. [2018-11-22 22:33:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 425. [2018-11-22 22:33:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-22 22:33:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 462 transitions. [2018-11-22 22:33:23,397 INFO L728 BuchiCegarLoop]: Abstraction has 425 states and 462 transitions. [2018-11-22 22:33:23,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:33:23,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:33:23,398 INFO L87 Difference]: Start difference. First operand 425 states and 462 transitions. Second operand 7 states. [2018-11-22 22:33:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:23,425 INFO L93 Difference]: Finished difference Result 306 states and 333 transitions. [2018-11-22 22:33:23,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:33:23,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 306 states and 333 transitions. [2018-11-22 22:33:23,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:23,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 306 states to 271 states and 298 transitions. [2018-11-22 22:33:23,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2018-11-22 22:33:23,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 183 [2018-11-22 22:33:23,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 298 transitions. [2018-11-22 22:33:23,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:23,428 INFO L705 BuchiCegarLoop]: Abstraction has 271 states and 298 transitions. [2018-11-22 22:33:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 298 transitions. [2018-11-22 22:33:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 175. [2018-11-22 22:33:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-22 22:33:23,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2018-11-22 22:33:23,431 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2018-11-22 22:33:23,431 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 194 transitions. [2018-11-22 22:33:23,432 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-22 22:33:23,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 194 transitions. [2018-11-22 22:33:23,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:23,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:23,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:23,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:23,433 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2018-11-22 22:33:23,433 INFO L794 eck$LassoCheckResult]: Stem: 10407#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 10408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10421#L12 assume !(main_~i~0 >= 10); 10501#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10500#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10498#L12 assume !(main_~i~0 >= 10); 10405#L12-2 assume !(main_~i~0 <= 0); 10406#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10412#L12 assume !(main_~i~0 >= 10); 10415#L12-2 assume !(main_~i~0 <= 0); 10417#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10418#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10497#L12 assume !(main_~i~0 >= 10); 10496#L12-2 assume !(main_~i~0 <= 0); 10495#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10493#L12 assume !(main_~i~0 >= 10); 10492#L12-2 assume !(main_~i~0 <= 0); 10491#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10489#L12 assume !(main_~i~0 >= 10); 10488#L12-2 assume !(main_~i~0 <= 0); 10487#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10485#L12 assume !(main_~i~0 >= 10); 10484#L12-2 assume !(main_~i~0 <= 0); 10483#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10481#L12 assume !(main_~i~0 >= 10); 10480#L12-2 assume !(main_~i~0 <= 0); 10479#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10477#L12 assume !(main_~i~0 >= 10); 10476#L12-2 assume !(main_~i~0 <= 0); 10475#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10432#L12 assume !(main_~i~0 >= 10); 10473#L12-2 assume !(main_~i~0 <= 0); 10472#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10428#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2018-11-22 22:33:23,433 INFO L796 eck$LassoCheckResult]: Loop: 10427#L12-2 assume !(main_~i~0 <= 0); 10424#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10425#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10538#L12 assume !(main_~i~0 >= 10); 10537#L12-2 assume !(main_~i~0 <= 0); 10536#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10535#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10534#L12 assume !(main_~i~0 >= 10); 10533#L12-2 assume !(main_~i~0 <= 0); 10532#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10531#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10530#L12 assume !(main_~i~0 >= 10); 10529#L12-2 assume !(main_~i~0 <= 0); 10528#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10527#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10508#L12 assume !(main_~i~0 >= 10); 10507#L12-2 assume !(main_~i~0 <= 0); 10505#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 10506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10509#L12 assume !(main_~i~0 >= 10); 10470#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 10469#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10468#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10467#L12 assume !(main_~i~0 >= 10); 10466#L12-2 assume !(main_~i~0 <= 0); 10465#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10464#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10463#L12 assume !(main_~i~0 >= 10); 10462#L12-2 assume !(main_~i~0 <= 0); 10461#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10460#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10459#L12 assume !(main_~i~0 >= 10); 10458#L12-2 assume !(main_~i~0 <= 0); 10457#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10456#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10455#L12 assume !(main_~i~0 >= 10); 10454#L12-2 assume !(main_~i~0 <= 0); 10453#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10452#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10451#L12 assume !(main_~i~0 >= 10); 10450#L12-2 assume !(main_~i~0 <= 0); 10449#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10447#L12 assume !(main_~i~0 >= 10); 10446#L12-2 assume !(main_~i~0 <= 0); 10445#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10444#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10443#L12 assume !(main_~i~0 >= 10); 10442#L12-2 assume !(main_~i~0 <= 0); 10441#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10439#L12 assume !(main_~i~0 >= 10); 10438#L12-2 assume !(main_~i~0 <= 0); 10437#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10436#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10435#L12 assume !(main_~i~0 >= 10); 10434#L12-2 assume !(main_~i~0 <= 0); 10433#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 10429#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10430#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 10427#L12-2 [2018-11-22 22:33:23,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:23,433 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2018-11-22 22:33:23,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:23,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:23,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:23,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:23,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:23,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2018-11-22 22:33:23,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:23,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:23,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:23,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:23,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 6 times [2018-11-22 22:33:23,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:23,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:23,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:23,499 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:23,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 22:33:23,572 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-11-22 22:33:23,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:23,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:23,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:23,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-22 22:33:23,761 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 62 [2018-11-22 22:33:23,767 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:23,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:23,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:23,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:23,767 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:23,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:23,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:23,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:23,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-22 22:33:23,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:23,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:23,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:23,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:23,776 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-22 22:33:23,777 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-22 22:33:23,802 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:23,802 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:23,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:23,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:23,806 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:23,806 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:23,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:23,821 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:23,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:23,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:23,840 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:23,853 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:23,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:23,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:23,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:23,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:23,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:23,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:23,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:23,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-22 22:33:23,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:23,854 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:23,854 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-22 22:33:23,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:23,862 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-22 22:33:23,863 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-22 22:33:23,884 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:23,884 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:23,884 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-22 22:33:23,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:23,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:23,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:23,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:23,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:23,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:23,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:23,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:23,886 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-22 22:33:23,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:23,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:23,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:23,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:23,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:23,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:23,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:23,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:23,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:23,888 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:23,889 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:23,889 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:23,889 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:23,889 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2018-11-22 22:33:23,889 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:23,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:23,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:23,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:24,023 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-22 22:33:24,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22 Second operand 9 states. [2018-11-22 22:33:24,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 194 transitions. cyclomatic complexity: 22. Second operand 9 states. Result 689 states and 732 transitions. Complement of second has 27 states. [2018-11-22 22:33:24,233 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-22 22:33:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-22 22:33:24,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-22 22:33:24,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2018-11-22 22:33:24,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:24,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2018-11-22 22:33:24,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:24,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2018-11-22 22:33:24,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:24,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 689 states and 732 transitions. [2018-11-22 22:33:24,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:24,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 689 states to 539 states and 582 transitions. [2018-11-22 22:33:24,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 279 [2018-11-22 22:33:24,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2018-11-22 22:33:24,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 582 transitions. [2018-11-22 22:33:24,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:24,241 INFO L705 BuchiCegarLoop]: Abstraction has 539 states and 582 transitions. [2018-11-22 22:33:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 582 transitions. [2018-11-22 22:33:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 433. [2018-11-22 22:33:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-22 22:33:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 468 transitions. [2018-11-22 22:33:24,247 INFO L728 BuchiCegarLoop]: Abstraction has 433 states and 468 transitions. [2018-11-22 22:33:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:33:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:33:24,247 INFO L87 Difference]: Start difference. First operand 433 states and 468 transitions. Second operand 8 states. [2018-11-22 22:33:24,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:24,281 INFO L93 Difference]: Finished difference Result 322 states and 347 transitions. [2018-11-22 22:33:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:33:24,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 347 transitions. [2018-11-22 22:33:24,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:24,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 279 states and 304 transitions. [2018-11-22 22:33:24,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2018-11-22 22:33:24,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 191 [2018-11-22 22:33:24,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 304 transitions. [2018-11-22 22:33:24,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:24,284 INFO L705 BuchiCegarLoop]: Abstraction has 279 states and 304 transitions. [2018-11-22 22:33:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 304 transitions. [2018-11-22 22:33:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 179. [2018-11-22 22:33:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-22 22:33:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2018-11-22 22:33:24,287 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2018-11-22 22:33:24,287 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 197 transitions. [2018-11-22 22:33:24,287 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-22 22:33:24,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 197 transitions. [2018-11-22 22:33:24,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:24,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:24,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:24,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:24,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2018-11-22 22:33:24,289 INFO L794 eck$LassoCheckResult]: Stem: 12712#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 12713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12728#L12 assume !(main_~i~0 >= 10); 12806#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12805#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12804#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12720#L12 assume !(main_~i~0 >= 10); 12721#L12-2 assume !(main_~i~0 <= 0); 12803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12717#L12 assume !(main_~i~0 >= 10); 12710#L12-2 assume !(main_~i~0 <= 0); 12711#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12802#L12 assume !(main_~i~0 >= 10); 12801#L12-2 assume !(main_~i~0 <= 0); 12800#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12799#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12798#L12 assume !(main_~i~0 >= 10); 12797#L12-2 assume !(main_~i~0 <= 0); 12796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12794#L12 assume !(main_~i~0 >= 10); 12793#L12-2 assume !(main_~i~0 <= 0); 12792#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12791#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12790#L12 assume !(main_~i~0 >= 10); 12789#L12-2 assume !(main_~i~0 <= 0); 12788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12787#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12786#L12 assume !(main_~i~0 >= 10); 12785#L12-2 assume !(main_~i~0 <= 0); 12784#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12783#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12782#L12 assume !(main_~i~0 >= 10); 12781#L12-2 assume !(main_~i~0 <= 0); 12780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12737#L12 assume !(main_~i~0 >= 10); 12778#L12-2 assume !(main_~i~0 <= 0); 12777#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12733#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2018-11-22 22:33:24,289 INFO L796 eck$LassoCheckResult]: Loop: 12731#L12-2 assume !(main_~i~0 <= 0); 12729#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12843#L12 assume !(main_~i~0 >= 10); 12842#L12-2 assume !(main_~i~0 <= 0); 12841#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12840#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12839#L12 assume !(main_~i~0 >= 10); 12838#L12-2 assume !(main_~i~0 <= 0); 12837#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12835#L12 assume !(main_~i~0 >= 10); 12834#L12-2 assume !(main_~i~0 <= 0); 12833#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12832#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12831#L12 assume !(main_~i~0 >= 10); 12830#L12-2 assume !(main_~i~0 <= 0); 12829#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12828#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12813#L12 assume !(main_~i~0 >= 10); 12814#L12-2 assume !(main_~i~0 <= 0); 12810#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 12808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12809#L12 assume !(main_~i~0 >= 10); 12775#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 12774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12772#L12 assume !(main_~i~0 >= 10); 12771#L12-2 assume !(main_~i~0 <= 0); 12770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12768#L12 assume !(main_~i~0 >= 10); 12767#L12-2 assume !(main_~i~0 <= 0); 12766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12764#L12 assume !(main_~i~0 >= 10); 12763#L12-2 assume !(main_~i~0 <= 0); 12762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12760#L12 assume !(main_~i~0 >= 10); 12759#L12-2 assume !(main_~i~0 <= 0); 12758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12756#L12 assume !(main_~i~0 >= 10); 12755#L12-2 assume !(main_~i~0 <= 0); 12754#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12752#L12 assume !(main_~i~0 >= 10); 12751#L12-2 assume !(main_~i~0 <= 0); 12750#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12748#L12 assume !(main_~i~0 >= 10); 12747#L12-2 assume !(main_~i~0 <= 0); 12746#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12745#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12744#L12 assume !(main_~i~0 >= 10); 12743#L12-2 assume !(main_~i~0 <= 0); 12742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12740#L12 assume !(main_~i~0 >= 10); 12739#L12-2 assume !(main_~i~0 <= 0); 12738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 12734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 12735#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 12731#L12-2 [2018-11-22 22:33:24,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2018-11-22 22:33:24,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:24,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:24,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:24,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2018-11-22 22:33:24,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:24,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:24,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:24,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:24,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:24,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:24,305 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 7 times [2018-11-22 22:33:24,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:24,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:24,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:24,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:24,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:24,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:24,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:24,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:24,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:24,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:24,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-22 22:33:24,602 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 63 [2018-11-22 22:33:24,607 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:24,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:24,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:24,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:24,607 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:24,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:24,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:24,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:24,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-22 22:33:24,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:24,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:24,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:24,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:24,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:24,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:24,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:24,640 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:24,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:24,641 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:24,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:24,658 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:24,752 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:24,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:24,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:24,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:24,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:24,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:24,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:24,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:24,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:24,753 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-22 22:33:24,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:24,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:24,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:24,758 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-22 22:33:24,759 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-22 22:33:24,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-22 22:33:24,782 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:24,782 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:24,782 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-22 22:33:24,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:24,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:24,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:24,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:24,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:24,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:24,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:24,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:24,785 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:24,785 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:24,785 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:24,785 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:24,785 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:24,785 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2018-11-22 22:33:24,786 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:24,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:24,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:24,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:24,858 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-22 22:33:24,858 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21 Second operand 10 states. [2018-11-22 22:33:25,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 197 transitions. cyclomatic complexity: 21. Second operand 10 states. Result 793 states and 836 transitions. Complement of second has 31 states. [2018-11-22 22:33:25,023 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-22 22:33:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-22 22:33:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2018-11-22 22:33:25,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2018-11-22 22:33:25,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:25,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2018-11-22 22:33:25,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:25,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2018-11-22 22:33:25,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:25,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 793 states and 836 transitions. [2018-11-22 22:33:25,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:25,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 793 states to 591 states and 634 transitions. [2018-11-22 22:33:25,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 319 [2018-11-22 22:33:25,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2018-11-22 22:33:25,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 591 states and 634 transitions. [2018-11-22 22:33:25,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:25,031 INFO L705 BuchiCegarLoop]: Abstraction has 591 states and 634 transitions. [2018-11-22 22:33:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states and 634 transitions. [2018-11-22 22:33:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 441. [2018-11-22 22:33:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-11-22 22:33:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 474 transitions. [2018-11-22 22:33:25,037 INFO L728 BuchiCegarLoop]: Abstraction has 441 states and 474 transitions. [2018-11-22 22:33:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:33:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:33:25,038 INFO L87 Difference]: Start difference. First operand 441 states and 474 transitions. Second operand 9 states. [2018-11-22 22:33:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:25,084 INFO L93 Difference]: Finished difference Result 338 states and 361 transitions. [2018-11-22 22:33:25,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:33:25,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 361 transitions. [2018-11-22 22:33:25,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:25,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 287 states and 310 transitions. [2018-11-22 22:33:25,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 199 [2018-11-22 22:33:25,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 199 [2018-11-22 22:33:25,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 310 transitions. [2018-11-22 22:33:25,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:25,089 INFO L705 BuchiCegarLoop]: Abstraction has 287 states and 310 transitions. [2018-11-22 22:33:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 310 transitions. [2018-11-22 22:33:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 183. [2018-11-22 22:33:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-22 22:33:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 200 transitions. [2018-11-22 22:33:25,096 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2018-11-22 22:33:25,096 INFO L608 BuchiCegarLoop]: Abstraction has 183 states and 200 transitions. [2018-11-22 22:33:25,096 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-22 22:33:25,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 200 transitions. [2018-11-22 22:33:25,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:25,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:25,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:25,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:25,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2018-11-22 22:33:25,097 INFO L794 eck$LassoCheckResult]: Stem: 15182#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15183#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15198#L12 assume !(main_~i~0 >= 10); 15276#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15275#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15190#L12 assume !(main_~i~0 >= 10); 15180#L12-2 assume !(main_~i~0 <= 0); 15181#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15187#L12 assume !(main_~i~0 >= 10); 15273#L12-2 assume !(main_~i~0 <= 0); 15192#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15193#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15272#L12 assume !(main_~i~0 >= 10); 15271#L12-2 assume !(main_~i~0 <= 0); 15270#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15268#L12 assume !(main_~i~0 >= 10); 15267#L12-2 assume !(main_~i~0 <= 0); 15266#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15264#L12 assume !(main_~i~0 >= 10); 15263#L12-2 assume !(main_~i~0 <= 0); 15262#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15260#L12 assume !(main_~i~0 >= 10); 15259#L12-2 assume !(main_~i~0 <= 0); 15258#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15256#L12 assume !(main_~i~0 >= 10); 15255#L12-2 assume !(main_~i~0 <= 0); 15254#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15253#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15252#L12 assume !(main_~i~0 >= 10); 15251#L12-2 assume !(main_~i~0 <= 0); 15250#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15249#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15205#L12 assume !(main_~i~0 >= 10); 15248#L12-2 assume !(main_~i~0 <= 0); 15247#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15204#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15203#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2018-11-22 22:33:25,097 INFO L796 eck$LassoCheckResult]: Loop: 15201#L12-2 assume !(main_~i~0 <= 0); 15199#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15313#L12 assume !(main_~i~0 >= 10); 15312#L12-2 assume !(main_~i~0 <= 0); 15311#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15309#L12 assume !(main_~i~0 >= 10); 15308#L12-2 assume !(main_~i~0 <= 0); 15307#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15306#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15305#L12 assume !(main_~i~0 >= 10); 15304#L12-2 assume !(main_~i~0 <= 0); 15303#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15302#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15301#L12 assume !(main_~i~0 >= 10); 15300#L12-2 assume !(main_~i~0 <= 0); 15299#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15298#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15297#L12 assume !(main_~i~0 >= 10); 15296#L12-2 assume !(main_~i~0 <= 0); 15295#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15283#L12 assume !(main_~i~0 >= 10); 15282#L12-2 assume !(main_~i~0 <= 0); 15280#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 15281#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15284#L12 assume !(main_~i~0 >= 10); 15245#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 15244#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15242#L12 assume !(main_~i~0 >= 10); 15241#L12-2 assume !(main_~i~0 <= 0); 15240#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15239#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15238#L12 assume !(main_~i~0 >= 10); 15237#L12-2 assume !(main_~i~0 <= 0); 15236#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15235#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15234#L12 assume !(main_~i~0 >= 10); 15233#L12-2 assume !(main_~i~0 <= 0); 15232#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15231#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15230#L12 assume !(main_~i~0 >= 10); 15229#L12-2 assume !(main_~i~0 <= 0); 15228#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15227#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15226#L12 assume !(main_~i~0 >= 10); 15225#L12-2 assume !(main_~i~0 <= 0); 15224#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15223#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15222#L12 assume !(main_~i~0 >= 10); 15221#L12-2 assume !(main_~i~0 <= 0); 15220#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15218#L12 assume !(main_~i~0 >= 10); 15217#L12-2 assume !(main_~i~0 <= 0); 15216#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15215#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15214#L12 assume !(main_~i~0 >= 10); 15213#L12-2 assume !(main_~i~0 <= 0); 15212#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15211#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15210#L12 assume !(main_~i~0 >= 10); 15209#L12-2 assume !(main_~i~0 <= 0); 15208#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 15206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15207#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 15201#L12-2 [2018-11-22 22:33:25,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2018-11-22 22:33:25,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:25,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:25,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:25,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:25,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:25,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:25,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2018-11-22 22:33:25,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:25,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:25,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:25,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:25,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:25,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 8 times [2018-11-22 22:33:25,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:25,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:25,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:25,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:25,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:25,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:25,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:33:25,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:33:25,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:25,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:25,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:25,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-22 22:33:25,467 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 67 [2018-11-22 22:33:25,473 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:25,473 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:25,473 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:25,473 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:25,473 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:25,473 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:25,473 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:25,473 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:25,473 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-22 22:33:25,473 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:25,473 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:25,474 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-22 22:33:25,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:25,477 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-22 22:33:25,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-22 22:33:25,506 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:25,506 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:25,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:25,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:25,522 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:25,522 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:25,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:25,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:25,539 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:25,539 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:25,542 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:25,542 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:25,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:25,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:25,560 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:25,573 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:25,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:25,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:25,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:25,573 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:25,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:25,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:25,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:25,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-22 22:33:25,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:25,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:25,574 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-22 22:33:25,576 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-22 22:33:25,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:25,581 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-22 22:33:25,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:25,604 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:25,604 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-22 22:33:25,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:25,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:25,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:25,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:25,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:25,605 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:25,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:25,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:33:25,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:25,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:25,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:25,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:25,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:25,608 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:25,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:25,609 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-22 22:33:25,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:25,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:25,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:25,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:25,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:25,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:25,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:25,611 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:25,611 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:25,611 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:25,612 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:25,612 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:25,612 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:25,612 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2018-11-22 22:33:25,612 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:25,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:25,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:25,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:25,743 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:25,743 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-22 22:33:25,744 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20 Second operand 11 states. [2018-11-22 22:33:26,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 200 transitions. cyclomatic complexity: 20. Second operand 11 states. Result 913 states and 956 transitions. Complement of second has 35 states. [2018-11-22 22:33:26,135 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-22 22:33:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-22 22:33:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-11-22 22:33:26,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2018-11-22 22:33:26,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:26,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2018-11-22 22:33:26,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:26,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2018-11-22 22:33:26,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:26,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 956 transitions. [2018-11-22 22:33:26,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:26,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 651 states and 694 transitions. [2018-11-22 22:33:26,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2018-11-22 22:33:26,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2018-11-22 22:33:26,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 651 states and 694 transitions. [2018-11-22 22:33:26,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:26,142 INFO L705 BuchiCegarLoop]: Abstraction has 651 states and 694 transitions. [2018-11-22 22:33:26,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states and 694 transitions. [2018-11-22 22:33:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 449. [2018-11-22 22:33:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-22 22:33:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 480 transitions. [2018-11-22 22:33:26,148 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 480 transitions. [2018-11-22 22:33:26,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:33:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:33:26,148 INFO L87 Difference]: Start difference. First operand 449 states and 480 transitions. Second operand 10 states. [2018-11-22 22:33:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:26,204 INFO L93 Difference]: Finished difference Result 354 states and 375 transitions. [2018-11-22 22:33:26,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:33:26,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 375 transitions. [2018-11-22 22:33:26,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:26,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 295 states and 316 transitions. [2018-11-22 22:33:26,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2018-11-22 22:33:26,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 207 [2018-11-22 22:33:26,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 316 transitions. [2018-11-22 22:33:26,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:26,209 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 316 transitions. [2018-11-22 22:33:26,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 316 transitions. [2018-11-22 22:33:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2018-11-22 22:33:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-22 22:33:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 203 transitions. [2018-11-22 22:33:26,212 INFO L728 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2018-11-22 22:33:26,212 INFO L608 BuchiCegarLoop]: Abstraction has 187 states and 203 transitions. [2018-11-22 22:33:26,212 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-22 22:33:26,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 203 transitions. [2018-11-22 22:33:26,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:26,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:26,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:26,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:26,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2018-11-22 22:33:26,214 INFO L794 eck$LassoCheckResult]: Stem: 17833#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 17834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17847#L12 assume !(main_~i~0 >= 10); 17931#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17930#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17929#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17928#L12 assume !(main_~i~0 >= 10); 17831#L12-2 assume !(main_~i~0 <= 0); 17832#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17838#L12 assume !(main_~i~0 >= 10); 17840#L12-2 assume !(main_~i~0 <= 0); 17925#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17921#L12 assume !(main_~i~0 >= 10); 17920#L12-2 assume !(main_~i~0 <= 0); 17919#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17917#L12 assume !(main_~i~0 >= 10); 17916#L12-2 assume !(main_~i~0 <= 0); 17915#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17914#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17913#L12 assume !(main_~i~0 >= 10); 17912#L12-2 assume !(main_~i~0 <= 0); 17911#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17909#L12 assume !(main_~i~0 >= 10); 17908#L12-2 assume !(main_~i~0 <= 0); 17907#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17906#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17905#L12 assume !(main_~i~0 >= 10); 17904#L12-2 assume !(main_~i~0 <= 0); 17903#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17901#L12 assume !(main_~i~0 >= 10); 17900#L12-2 assume !(main_~i~0 <= 0); 17899#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17898#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17856#L12 assume !(main_~i~0 >= 10); 17897#L12-2 assume !(main_~i~0 <= 0); 17896#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17855#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17852#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2018-11-22 22:33:26,214 INFO L796 eck$LassoCheckResult]: Loop: 17850#L12-2 assume !(main_~i~0 <= 0); 17848#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17964#L12 assume !(main_~i~0 >= 10); 17963#L12-2 assume !(main_~i~0 <= 0); 17962#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17961#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17960#L12 assume !(main_~i~0 >= 10); 17959#L12-2 assume !(main_~i~0 <= 0); 17958#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17957#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17956#L12 assume !(main_~i~0 >= 10); 17955#L12-2 assume !(main_~i~0 <= 0); 17954#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17953#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17952#L12 assume !(main_~i~0 >= 10); 17951#L12-2 assume !(main_~i~0 <= 0); 17950#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17949#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17948#L12 assume !(main_~i~0 >= 10); 17947#L12-2 assume !(main_~i~0 <= 0); 17946#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17945#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17944#L12 assume !(main_~i~0 >= 10); 17943#L12-2 assume !(main_~i~0 <= 0); 17942#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17935#L12 assume !(main_~i~0 >= 10); 17936#L12-2 assume !(main_~i~0 <= 0); 17926#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 17927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17937#L12 assume !(main_~i~0 >= 10); 17894#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 17893#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17892#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17891#L12 assume !(main_~i~0 >= 10); 17890#L12-2 assume !(main_~i~0 <= 0); 17889#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17887#L12 assume !(main_~i~0 >= 10); 17886#L12-2 assume !(main_~i~0 <= 0); 17885#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17883#L12 assume !(main_~i~0 >= 10); 17882#L12-2 assume !(main_~i~0 <= 0); 17881#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17879#L12 assume !(main_~i~0 >= 10); 17878#L12-2 assume !(main_~i~0 <= 0); 17877#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17876#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17875#L12 assume !(main_~i~0 >= 10); 17874#L12-2 assume !(main_~i~0 <= 0); 17873#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17872#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17871#L12 assume !(main_~i~0 >= 10); 17870#L12-2 assume !(main_~i~0 <= 0); 17869#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17867#L12 assume !(main_~i~0 >= 10); 17866#L12-2 assume !(main_~i~0 <= 0); 17865#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17864#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17863#L12 assume !(main_~i~0 >= 10); 17862#L12-2 assume !(main_~i~0 <= 0); 17861#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17860#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17859#L12 assume !(main_~i~0 >= 10); 17858#L12-2 assume !(main_~i~0 <= 0); 17857#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 17853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 17854#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 17850#L12-2 [2018-11-22 22:33:26,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:26,214 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2018-11-22 22:33:26,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:26,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:26,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:26,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:26,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:26,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2018-11-22 22:33:26,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:26,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:26,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:26,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:26,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:26,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:26,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 9 times [2018-11-22 22:33:26,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:26,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:26,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:26,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:26,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:26,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:33:26,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-11-22 22:33:26,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:26,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1112 proven. 226 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-11-22 22:33:26,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2018-11-22 22:33:26,546 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 70 [2018-11-22 22:33:26,560 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:26,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:26,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:26,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:26,560 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:26,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:26,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:26,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:26,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-22 22:33:26,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:26,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:26,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:26,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:26,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:26,573 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-22 22:33:26,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:26,597 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:26,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:26,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:26,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:26,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_25=1} Honda state: {v_rep~unnamed0~0~true_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:26,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:26,617 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:26,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:26,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:26,638 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:26,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:26,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:26,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:26,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:26,652 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:26,652 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:26,652 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:26,652 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:26,652 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-22 22:33:26,652 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:26,652 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:26,653 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-22 22:33:26,656 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-22 22:33:26,658 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-22 22:33:26,662 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-22 22:33:26,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:26,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:26,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-22 22:33:26,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:26,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:26,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:26,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:26,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:26,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:26,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:26,685 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-22 22:33:26,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:26,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:26,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:26,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:26,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:26,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:26,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:26,687 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-22 22:33:26,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:26,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:26,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:26,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:26,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:26,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:26,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:26,689 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:26,689 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:26,689 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:26,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:26,690 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:26,690 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:26,690 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2018-11-22 22:33:26,690 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:26,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:26,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:26,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:26,764 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-22 22:33:26,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19 Second operand 12 states. [2018-11-22 22:33:27,049 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 203 transitions. cyclomatic complexity: 19. Second operand 12 states. Result 1050 states and 1093 transitions. Complement of second has 39 states. [2018-11-22 22:33:27,051 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-22 22:33:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-22 22:33:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2018-11-22 22:33:27,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2018-11-22 22:33:27,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:27,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2018-11-22 22:33:27,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:27,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2018-11-22 22:33:27,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:27,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1050 states and 1093 transitions. [2018-11-22 22:33:27,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 85 [2018-11-22 22:33:27,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1050 states to 720 states and 763 transitions. [2018-11-22 22:33:27,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 423 [2018-11-22 22:33:27,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 427 [2018-11-22 22:33:27,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 720 states and 763 transitions. [2018-11-22 22:33:27,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:27,059 INFO L705 BuchiCegarLoop]: Abstraction has 720 states and 763 transitions. [2018-11-22 22:33:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states and 763 transitions. [2018-11-22 22:33:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 457. [2018-11-22 22:33:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-11-22 22:33:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 486 transitions. [2018-11-22 22:33:27,065 INFO L728 BuchiCegarLoop]: Abstraction has 457 states and 486 transitions. [2018-11-22 22:33:27,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:33:27,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:33:27,065 INFO L87 Difference]: Start difference. First operand 457 states and 486 transitions. Second operand 13 states. [2018-11-22 22:33:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:27,135 INFO L93 Difference]: Finished difference Result 370 states and 389 transitions. [2018-11-22 22:33:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:33:27,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 389 transitions. [2018-11-22 22:33:27,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:27,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 303 states and 322 transitions. [2018-11-22 22:33:27,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2018-11-22 22:33:27,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2018-11-22 22:33:27,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 322 transitions. [2018-11-22 22:33:27,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:27,140 INFO L705 BuchiCegarLoop]: Abstraction has 303 states and 322 transitions. [2018-11-22 22:33:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 322 transitions. [2018-11-22 22:33:27,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 191. [2018-11-22 22:33:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-22 22:33:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-11-22 22:33:27,143 INFO L728 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-11-22 22:33:27,143 INFO L608 BuchiCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-11-22 22:33:27,143 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-22 22:33:27,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 206 transitions. [2018-11-22 22:33:27,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:27,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:27,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:27,144 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-22 22:33:27,144 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2018-11-22 22:33:27,144 INFO L794 eck$LassoCheckResult]: Stem: 20684#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 20685#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20695#L12 assume !(main_~i~0 >= 10); 20812#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20810#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20808#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20806#L12 assume !(main_~i~0 >= 10); 20804#L12-2 assume !(main_~i~0 <= 0); 20803#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20688#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20689#L12 assume !(main_~i~0 >= 10); 20682#L12-2 assume !(main_~i~0 <= 0); 20683#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20691#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20800#L12 assume !(main_~i~0 >= 10); 20798#L12-2 assume !(main_~i~0 <= 0); 20796#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20792#L12 assume !(main_~i~0 >= 10); 20790#L12-2 assume !(main_~i~0 <= 0); 20788#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20784#L12 assume !(main_~i~0 >= 10); 20782#L12-2 assume !(main_~i~0 <= 0); 20780#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20776#L12 assume !(main_~i~0 >= 10); 20774#L12-2 assume !(main_~i~0 <= 0); 20772#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20768#L12 assume !(main_~i~0 >= 10); 20766#L12-2 assume !(main_~i~0 <= 0); 20764#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20760#L12 assume !(main_~i~0 >= 10); 20758#L12-2 assume !(main_~i~0 <= 0); 20756#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20753#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20705#L12 assume !(main_~i~0 >= 10); 20748#L12-2 assume !(main_~i~0 <= 0); 20745#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20704#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20701#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2018-11-22 22:33:27,144 INFO L796 eck$LassoCheckResult]: Loop: 20698#L12-2 assume !(main_~i~0 <= 0); 20699#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20813#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20811#L12 assume !(main_~i~0 >= 10); 20809#L12-2 assume !(main_~i~0 <= 0); 20807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20802#L12 assume !(main_~i~0 >= 10); 20801#L12-2 assume !(main_~i~0 <= 0); 20799#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20795#L12 assume !(main_~i~0 >= 10); 20793#L12-2 assume !(main_~i~0 <= 0); 20791#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20787#L12 assume !(main_~i~0 >= 10); 20785#L12-2 assume !(main_~i~0 <= 0); 20783#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20779#L12 assume !(main_~i~0 >= 10); 20777#L12-2 assume !(main_~i~0 <= 0); 20775#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20771#L12 assume !(main_~i~0 >= 10); 20769#L12-2 assume !(main_~i~0 <= 0); 20767#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20763#L12 assume !(main_~i~0 >= 10); 20761#L12-2 assume !(main_~i~0 <= 0); 20759#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20754#L12 assume !(main_~i~0 >= 10); 20751#L12-2 assume !(main_~i~0 <= 0); 20752#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 20746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20747#L12 assume !(main_~i~0 >= 10); 20743#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 20742#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20741#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20740#L12 assume !(main_~i~0 >= 10); 20739#L12-2 assume !(main_~i~0 <= 0); 20738#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20737#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20736#L12 assume !(main_~i~0 >= 10); 20735#L12-2 assume !(main_~i~0 <= 0); 20734#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20733#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20732#L12 assume !(main_~i~0 >= 10); 20731#L12-2 assume !(main_~i~0 <= 0); 20730#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20729#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20728#L12 assume !(main_~i~0 >= 10); 20727#L12-2 assume !(main_~i~0 <= 0); 20726#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20725#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20724#L12 assume !(main_~i~0 >= 10); 20723#L12-2 assume !(main_~i~0 <= 0); 20722#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20720#L12 assume !(main_~i~0 >= 10); 20719#L12-2 assume !(main_~i~0 <= 0); 20718#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20717#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20716#L12 assume !(main_~i~0 >= 10); 20715#L12-2 assume !(main_~i~0 <= 0); 20714#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20713#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20712#L12 assume !(main_~i~0 >= 10); 20711#L12-2 assume !(main_~i~0 <= 0); 20710#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20708#L12 assume !(main_~i~0 >= 10); 20707#L12-2 assume !(main_~i~0 <= 0); 20706#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 20702#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 20703#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 20698#L12-2 [2018-11-22 22:33:27,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2018-11-22 22:33:27,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:27,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:27,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:27,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:27,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:27,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2018-11-22 22:33:27,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:27,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:27,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 10 times [2018-11-22 22:33:27,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:27,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:27,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:33:27,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:33:27,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:33:27,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:33:27,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:33:27,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2018-11-22 22:33:27,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:33:27,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-22 22:33:27,525 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 72 [2018-11-22 22:33:27,530 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:27,530 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:27,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:27,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:27,531 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-22 22:33:27,531 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:27,531 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:27,531 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:27,531 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-22 22:33:27,531 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:27,531 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:27,531 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-22 22:33:27,533 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-22 22:33:27,535 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-22 22:33:27,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-22 22:33:27,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:27,560 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/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-22 22:33:27,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:27,563 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:27,577 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:27,577 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:27,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:27,581 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:27,582 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-22 22:33:27,583 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=0} Honda state: {ULTIMATE.start_main_~up~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:27,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-22 22:33:27,597 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:27,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-22 22:33:27,613 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-22 22:33:27,615 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-22 22:33:27,628 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 22:33:27,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 22:33:27,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 22:33:27,629 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 22:33:27,629 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 22:33:27,629 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 22:33:27,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 22:33:27,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 22:33:27,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-22 22:33:27,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 22:33:27,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 22:33:27,629 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-22 22:33:27,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:27,633 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-22 22:33:27,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 22:33:27,656 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 22:33:27,657 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 22:33:27,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 22:33:27,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:27,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:27,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:27,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:27,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:27,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:27,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:27,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:27,658 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-22 22:33:27,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:27,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:27,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:27,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:27,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 22:33:27,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 22:33:27,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 22:33:27,660 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-22 22:33:27,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 22:33:27,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 22:33:27,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 22:33:27,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 22:33:27,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 22:33:27,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 22:33:27,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 22:33:27,662 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 22:33:27,663 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 22:33:27,663 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 22:33:27,663 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 22:33:27,663 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 22:33:27,663 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 22:33:27,663 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2018-11-22 22:33:27,664 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-22 22:33:27,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:27,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:33:27,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:33:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-11-22 22:33:27,794 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-22 22:33:27,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18 Second operand 13 states. [2018-11-22 22:33:28,301 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 206 transitions. cyclomatic complexity: 18. Second operand 13 states. Result 1203 states and 1246 transitions. Complement of second has 43 states. [2018-11-22 22:33:28,301 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-22 22:33:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 22:33:28,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 96 transitions. [2018-11-22 22:33:28,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 76 letters. [2018-11-22 22:33:28,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:28,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 119 letters. Loop has 76 letters. [2018-11-22 22:33:28,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:28,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 96 transitions. Stem has 43 letters. Loop has 152 letters. [2018-11-22 22:33:28,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 22:33:28,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1203 states and 1246 transitions. [2018-11-22 22:33:28,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:28,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1203 states to 796 states and 837 transitions. [2018-11-22 22:33:28,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2018-11-22 22:33:28,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2018-11-22 22:33:28,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 837 transitions. [2018-11-22 22:33:28,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:28,311 INFO L705 BuchiCegarLoop]: Abstraction has 796 states and 837 transitions. [2018-11-22 22:33:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 837 transitions. [2018-11-22 22:33:28,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 464. [2018-11-22 22:33:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-11-22 22:33:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 489 transitions. [2018-11-22 22:33:28,317 INFO L728 BuchiCegarLoop]: Abstraction has 464 states and 489 transitions. [2018-11-22 22:33:28,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:33:28,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:33:28,317 INFO L87 Difference]: Start difference. First operand 464 states and 489 transitions. Second operand 12 states. [2018-11-22 22:33:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:33:28,385 INFO L93 Difference]: Finished difference Result 388 states and 402 transitions. [2018-11-22 22:33:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:33:28,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 388 states and 402 transitions. [2018-11-22 22:33:28,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:28,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 388 states to 311 states and 325 transitions. [2018-11-22 22:33:28,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2018-11-22 22:33:28,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2018-11-22 22:33:28,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 311 states and 325 transitions. [2018-11-22 22:33:28,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 22:33:28,392 INFO L705 BuchiCegarLoop]: Abstraction has 311 states and 325 transitions. [2018-11-22 22:33:28,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states and 325 transitions. [2018-11-22 22:33:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 115. [2018-11-22 22:33:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-22 22:33:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2018-11-22 22:33:28,394 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-11-22 22:33:28,394 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 126 transitions. [2018-11-22 22:33:28,394 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-22 22:33:28,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 126 transitions. [2018-11-22 22:33:28,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-22 22:33:28,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:33:28,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:33:28,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 22:33:28,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2018-11-22 22:33:28,395 INFO L794 eck$LassoCheckResult]: Stem: 23748#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 23749#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2018-11-22 22:33:28,396 INFO L796 eck$LassoCheckResult]: Loop: 23796#L12 assume !(main_~i~0 >= 10); 23795#L12-2 assume main_~i~0 <= 0;main_~up~0 := 1; 23794#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23793#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23792#L12 assume !(main_~i~0 >= 10); 23791#L12-2 assume !(main_~i~0 <= 0); 23790#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23789#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23788#L12 assume !(main_~i~0 >= 10); 23787#L12-2 assume !(main_~i~0 <= 0); 23786#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23784#L12 assume !(main_~i~0 >= 10); 23783#L12-2 assume !(main_~i~0 <= 0); 23782#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23781#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23780#L12 assume !(main_~i~0 >= 10); 23779#L12-2 assume !(main_~i~0 <= 0); 23778#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23776#L12 assume !(main_~i~0 >= 10); 23775#L12-2 assume !(main_~i~0 <= 0); 23774#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23773#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23772#L12 assume !(main_~i~0 >= 10); 23771#L12-2 assume !(main_~i~0 <= 0); 23770#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23768#L12 assume !(main_~i~0 >= 10); 23767#L12-2 assume !(main_~i~0 <= 0); 23766#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23765#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23764#L12 assume !(main_~i~0 >= 10); 23763#L12-2 assume !(main_~i~0 <= 0); 23762#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23761#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23760#L12 assume !(main_~i~0 >= 10); 23759#L12-2 assume !(main_~i~0 <= 0); 23758#L15-1 assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; 23757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23756#L12 assume main_~i~0 >= 10;main_~up~0 := 0; 23755#L12-2 assume !(main_~i~0 <= 0); 23747#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23753#L12 assume !(main_~i~0 >= 10); 23744#L12-2 assume !(main_~i~0 <= 0); 23745#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23751#L12 assume !(main_~i~0 >= 10); 23754#L12-2 assume !(main_~i~0 <= 0); 23858#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23856#L12 assume !(main_~i~0 >= 10); 23855#L12-2 assume !(main_~i~0 <= 0); 23854#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23852#L12 assume !(main_~i~0 >= 10); 23851#L12-2 assume !(main_~i~0 <= 0); 23850#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23848#L12 assume !(main_~i~0 >= 10); 23847#L12-2 assume !(main_~i~0 <= 0); 23846#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23844#L12 assume !(main_~i~0 >= 10); 23843#L12-2 assume !(main_~i~0 <= 0); 23842#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23840#L12 assume !(main_~i~0 >= 10); 23839#L12-2 assume !(main_~i~0 <= 0); 23838#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23837#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23836#L12 assume !(main_~i~0 >= 10); 23835#L12-2 assume !(main_~i~0 <= 0); 23809#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23805#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23806#L12 assume !(main_~i~0 >= 10); 23808#L12-2 assume !(main_~i~0 <= 0); 23807#L15-1 assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; 23797#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 23796#L12 [2018-11-22 22:33:28,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2018-11-22 22:33:28,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:28,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:28,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:28,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:28,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:28,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash -950527111, now seen corresponding path program 17 times [2018-11-22 22:33:28,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:28,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:28,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:33:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:28,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:33:28,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2117507742, now seen corresponding path program 11 times [2018-11-22 22:33:28,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:33:28,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:33:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:28,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:33:28,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:33:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:33:28,763 WARN L180 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 74 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 >= 10); [?] assume main_~i~0 <= 0;main_~up~0 := 1; [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume main_~i~0 >= 10;main_~up~0 := 0; [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [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 ----- [2018-11-22 22:33:28,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:33:28 BoogieIcfgContainer [2018-11-22 22:33:28,809 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:33:28,810 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:33:28,810 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:33:28,810 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:33:28,810 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:33:16" (3/4) ... [2018-11-22 22:33:28,813 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 >= 10); [?] assume main_~i~0 <= 0;main_~up~0 := 1; [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume main_~i~0 >= 10;main_~up~0 := 0; [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [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 ----- [2018-11-22 22:33:29,205 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c8689bdc-5c53-430e-b7a1-a503741f6eae/bin-2019/uautomizer/witness.graphml [2018-11-22 22:33:29,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:33:29,206 INFO L168 Benchmark]: Toolchain (without parser) took 12718.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.7 MB). Free memory was 959.1 MB in the beginning and 1.5 GB in the end (delta: -542.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:33:29,206 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:33:29,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:33:29,227 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.90 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:33:29,227 INFO L168 Benchmark]: Boogie Preprocessor took 45.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:33:29,227 INFO L168 Benchmark]: RCFGBuilder took 137.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:33:29,228 INFO L168 Benchmark]: BuchiAutomizer took 11975.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -372.0 MB). Peak memory consumption was 683.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:33:29,228 INFO L168 Benchmark]: Witness Printer took 395.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:33:29,230 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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.90 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 137.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11975.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 364.4 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -372.0 MB). Peak memory consumption was 683.9 MB. Max. memory is 11.5 GB. * Witness Printer took 395.40 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 36 terminating modules (22 trivial, 12 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 115 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.9s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 7.3s. Construction of modules took 1.2s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 2226 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 191 states and ocurred in iteration 23. Nontrivial modules had stage [12, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 281 SDtfs, 858 SDslu, 9 SDs, 0 SdLazy, 2372 SolverSat, 290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT10 SILN0 SILU0 SILI9 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax161 hnf97 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq126 hnf96 smp100 dnf100 smp100 tf112 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d89b82c=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 >= 10); [?] assume main_~i~0 <= 0;main_~up~0 := 1; [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume main_~i~0 >= 10;main_~up~0 := 0; [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [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 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] 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; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_~i~0, main_~up~0; [L6] havoc main_~i~0; [L7] havoc main_~up~0; [L8] main_~i~0 := main_#t~nondet0; [L8] havoc main_#t~nondet0; [L9] main_~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L6] havoc ~i~0; [L7] havoc ~up~0; [L8] ~i~0 := #t~nondet0; [L8] havoc #t~nondet0; [L9] ~up~0 := 0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(main_~i~0 >= 10); [?] assume main_~i~0 <= 0;main_~up~0 := 1; [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume main_~up~0 >= 1;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume main_~i~0 >= 10;main_~up~0 := 0; [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(main_~i~0 >= 10); [?] assume !(main_~i~0 <= 0); [?] assume !(main_~up~0 >= 1);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume main_~i~0 <= 0; [L16] main_~up~0 := 1; [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume main_~up~0 >= 1; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume main_~i~0 >= 10; [L13] main_~up~0 := 0; [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(main_~i~0 >= 10); [L15-L17] assume !(main_~i~0 <= 0); [L18-L22] assume !(main_~up~0 >= 1); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND TRUE main_~i~0 <= 0 [L16] main_~up~0 := 1; [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND TRUE main_~up~0 >= 1 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE main_~i~0 >= 10 [L13] main_~up~0 := 0; [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(main_~i~0 >= 10) [L15] COND FALSE !(main_~i~0 <= 0) [L18] COND FALSE !(main_~up~0 >= 1) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] COND FALSE !(~i~0 >= 10) [L15] COND TRUE ~i~0 <= 0 [L16] ~up~0 := 1; [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND TRUE ~up~0 >= 1 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE ~i~0 >= 10 [L13] ~up~0 := 0; [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(~i~0 >= 10) [L15] COND FALSE !(~i~0 <= 0) [L18] COND FALSE !(~up~0 >= 1) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [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 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 Loop: [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...