./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 014f994c3374ea132faaa71956bb80ddfc4c8f9b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:29:12,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:29:12,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:29:12,169 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:29:12,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:29:12,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:29:12,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:29:12,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:29:12,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:29:12,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:29:12,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:29:12,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:29:12,174 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:29:12,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:29:12,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:29:12,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:29:12,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:29:12,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:29:12,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:29:12,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:29:12,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:29:12,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:29:12,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:29:12,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:29:12,184 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:29:12,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:29:12,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:29:12,186 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:29:12,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:29:12,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:29:12,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:29:12,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:29:12,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:29:12,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:29:12,190 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:29:12,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:29:12,190 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 02:29:12,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:29:12,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:29:12,199 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:29:12,200 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:29:12,200 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:29:12,200 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 02:29:12,200 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 02:29:12,200 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 02:29:12,200 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 02:29:12,200 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 02:29:12,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 02:29:12,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 02:29:12,202 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:29:12,202 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 02:29:12,202 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:29:12,202 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 02:29:12,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:29:12,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:29:12,202 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 02:29:12,203 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:29:12,203 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:29:12,203 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 02:29:12,203 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 02:29:12,204 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_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 014f994c3374ea132faaa71956bb80ddfc4c8f9b [2018-11-23 02:29:12,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:29:12,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:29:12,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:29:12,240 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:29:12,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:29:12,241 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/../../sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c [2018-11-23 02:29:12,285 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/data/339b1801d/7c091d0ec75f4691b90a13f9c35a5ec3/FLAG44b6c77af [2018-11-23 02:29:12,704 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:29:12,704 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/sv-benchmarks/c/termination-restricted-15/UpAndDown_false-termination_true-no-overflow.c [2018-11-23 02:29:12,709 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/data/339b1801d/7c091d0ec75f4691b90a13f9c35a5ec3/FLAG44b6c77af [2018-11-23 02:29:12,720 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/data/339b1801d/7c091d0ec75f4691b90a13f9c35a5ec3 [2018-11-23 02:29:12,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:29:12,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:29:12,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:29:12,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:29:12,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:29:12,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5fba41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12, skipping insertion in model container [2018-11-23 02:29:12,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:29:12,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:29:12,850 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:29:12,852 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:29:12,862 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:29:12,870 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:29:12,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12 WrapperNode [2018-11-23 02:29:12,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:29:12,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:29:12,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:29:12,871 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:29:12,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:29:12,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:29:12,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:29:12,889 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:29:12,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... [2018-11-23 02:29:12,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:29:12,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:29:12,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:29:12,900 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:29:12,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:12,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:29:12,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:29:13,049 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:29:13,049 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 02:29:13,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:13 BoogieIcfgContainer [2018-11-23 02:29:13,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:29:13,050 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 02:29:13,050 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 02:29:13,052 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 02:29:13,052 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:29:13,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 02:29:12" (1/3) ... [2018-11-23 02:29:13,053 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745f2767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:29:13, skipping insertion in model container [2018-11-23 02:29:13,053 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:29:13,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:29:12" (2/3) ... [2018-11-23 02:29:13,054 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@745f2767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 02:29:13, skipping insertion in model container [2018-11-23 02:29:13,054 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 02:29:13,054 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:13" (3/3) ... [2018-11-23 02:29:13,055 INFO L375 chiAutomizerObserver]: Analyzing ICFG UpAndDown_false-termination_true-no-overflow.c [2018-11-23 02:29:13,092 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:29:13,092 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 02:29:13,092 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 02:29:13,092 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 02:29:13,092 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:29:13,092 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:29:13,092 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 02:29:13,092 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:29:13,092 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 02:29:13,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-23 02:29:13,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 02:29:13,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:13,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:13,117 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 02:29:13,117 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:13,118 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 02:29:13,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2018-11-23 02:29:13,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 02:29:13,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:13,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:13,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 02:29:13,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:13,125 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-23 02:29:13,126 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6#L12true assume 10 == main_~i~0;main_~up~0 := 0; 3#L12-2true assume 0 == main_~i~0;main_~up~0 := 1; 9#L15-1true assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5#L18-1true [2018-11-23 02:29:13,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 02:29:13,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2018-11-23 02:29:13,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:13,231 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-23 02:29:13,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:13,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:29:13,237 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:29:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:29:13,249 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-11-23 02:29:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:13,298 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-11-23 02:29:13,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:29:13,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2018-11-23 02:29:13,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 02:29:13,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 14 transitions. [2018-11-23 02:29:13,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-23 02:29:13,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 02:29:13,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2018-11-23 02:29:13,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 02:29:13,308 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-23 02:29:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2018-11-23 02:29:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-23 02:29:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 02:29:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-11-23 02:29:13,331 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-23 02:29:13,331 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-11-23 02:29:13,331 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 02:29:13,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2018-11-23 02:29:13,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 02:29:13,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:13,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:13,332 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 02:29:13,332 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:13,332 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-23 02:29:13,332 INFO L796 eck$LassoCheckResult]: Loop: 38#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 43#L12 assume 10 == main_~i~0;main_~up~0 := 0; 35#L12-2 assume !(0 == main_~i~0); 36#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 38#L18-1 [2018-11-23 02:29:13,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,333 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-23 02:29:13,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2018-11-23 02:29:13,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:13,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2018-11-23 02:29:13,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:13,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:13,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:13,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:13,392 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:13,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:13,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:13,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:13,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 02:29:13,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:13,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:13,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,515 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:13,516 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:13,519 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:13,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:13,549 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:13,565 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:13,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:13,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:13,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:13,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:13,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:13,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:13,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:13,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 02:29:13,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:13,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:13,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-23 02:29:13,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,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-23 02:29:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:13,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:13,633 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-23 02:29:13,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:13,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:13,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:13,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:13,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:13,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:13,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:13,641 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:13,644 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:13,644 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:29:13,645 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:13,645 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:13,646 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:13,646 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-23 02:29:13,647 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:13,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:13,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:13,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:13,685 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-23 02:29:13,688 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-23 02:29:13,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-23 02:29:13,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 32 transitions. Complement of second has 5 states. [2018-11-23 02:29:13,727 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-23 02:29:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 02:29:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-23 02:29:13,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-23 02:29:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 02:29:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:13,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 1 letters. Loop has 8 letters. [2018-11-23 02:29:13,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:13,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 32 transitions. [2018-11-23 02:29:13,730 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 02:29:13,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 32 transitions. [2018-11-23 02:29:13,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-23 02:29:13,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 02:29:13,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 32 transitions. [2018-11-23 02:29:13,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:13,732 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2018-11-23 02:29:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 32 transitions. [2018-11-23 02:29:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 02:29:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 02:29:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-11-23 02:29:13,734 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 02:29:13,734 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-23 02:29:13,734 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 02:29:13,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-11-23 02:29:13,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-23 02:29:13,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:13,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:13,735 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:29:13,735 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:13,735 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 106#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 110#L12 assume 10 == main_~i~0;main_~up~0 := 0; 112#L12-2 assume !(0 == main_~i~0); 120#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-11-23 02:29:13,735 INFO L796 eck$LassoCheckResult]: Loop: 107#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 108#L12 assume 10 == main_~i~0;main_~up~0 := 0; 117#L12-2 assume !(0 == main_~i~0); 118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 107#L18-1 [2018-11-23 02:29:13,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 29863751, now seen corresponding path program 1 times [2018-11-23 02:29:13,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:13,747 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-23 02:29:13,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:13,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:29:13,747 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:13,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1234600, now seen corresponding path program 1 times [2018-11-23 02:29:13,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:13,769 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-23 02:29:13,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:13,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:29:13,770 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:13,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:29:13,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:29:13,770 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-23 02:29:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:13,775 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2018-11-23 02:29:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:29:13,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 43 transitions. [2018-11-23 02:29:13,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-23 02:29:13,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 26 states and 39 transitions. [2018-11-23 02:29:13,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-23 02:29:13,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-23 02:29:13,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2018-11-23 02:29:13,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:13,778 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2018-11-23 02:29:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2018-11-23 02:29:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 02:29:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 02:29:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 38 transitions. [2018-11-23 02:29:13,780 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-23 02:29:13,780 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 38 transitions. [2018-11-23 02:29:13,780 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 02:29:13,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2018-11-23 02:29:13,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 02:29:13,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:13,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:13,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:29:13,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:13,782 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 162#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 166#L12 assume !(10 == main_~i~0); 168#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2018-11-23 02:29:13,782 INFO L796 eck$LassoCheckResult]: Loop: 173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 178#L12 assume !(10 == main_~i~0); 176#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 174#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 173#L18-1 [2018-11-23 02:29:13,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 1 times [2018-11-23 02:29:13,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1236460, now seen corresponding path program 1 times [2018-11-23 02:29:13,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:13,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:13,794 INFO L82 PathProgramCache]: Analyzing trace with hash -760725642, now seen corresponding path program 2 times [2018-11-23 02:29:13,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:13,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:13,811 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-23 02:29:13,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:13,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:29:13,822 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:13,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:13,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:13,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:13,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:13,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:13,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:13,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:13,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 02:29:13,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:13,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:13,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,867 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:13,867 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:13,874 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:13,891 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:13,891 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:13,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:13,912 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:13,913 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:13,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:13,920 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:13,921 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:13,943 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:13,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:13,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:13,975 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:13,988 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:13,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:13,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:13,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:13,989 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:13,989 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:13,989 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:13,989 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:13,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-23 02:29:13,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:13,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:13,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:13,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:14,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:14,045 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-23 02:29:14,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:14,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:14,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,055 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-23 02:29:14,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:14,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:14,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:14,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,062 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:29:14,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:14,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:14,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,068 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-23 02:29:14,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:14,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:14,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:14,073 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:14,075 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:14,075 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:14,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:14,076 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:14,076 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:14,076 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-23 02:29:14,076 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:14,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:14,120 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-23 02:29:14,120 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-23 02:29:14,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-23 02:29:14,139 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 38 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 62 transitions. Complement of second has 7 states. [2018-11-23 02:29:14,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 02:29:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:29:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 02:29:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 02:29:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 02:29:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 02:29:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-11-23 02:29:14,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 02:29:14,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 40 states and 60 transitions. [2018-11-23 02:29:14,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 02:29:14,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 02:29:14,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 60 transitions. [2018-11-23 02:29:14,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:14,142 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2018-11-23 02:29:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 60 transitions. [2018-11-23 02:29:14,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-11-23 02:29:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 02:29:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2018-11-23 02:29:14,144 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 56 transitions. [2018-11-23 02:29:14,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:29:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:29:14,144 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 4 states. [2018-11-23 02:29:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:14,158 INFO L93 Difference]: Finished difference Result 42 states and 61 transitions. [2018-11-23 02:29:14,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:29:14,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 61 transitions. [2018-11-23 02:29:14,159 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-23 02:29:14,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 56 transitions. [2018-11-23 02:29:14,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-23 02:29:14,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 02:29:14,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 56 transitions. [2018-11-23 02:29:14,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:14,161 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 56 transitions. [2018-11-23 02:29:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 56 transitions. [2018-11-23 02:29:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-11-23 02:29:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 02:29:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2018-11-23 02:29:14,163 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-23 02:29:14,164 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2018-11-23 02:29:14,164 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 02:29:14,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2018-11-23 02:29:14,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 02:29:14,164 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:14,164 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:14,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 02:29:14,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:14,165 INFO L794 eck$LassoCheckResult]: Stem: 360#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 365#L12 assume !(10 == main_~i~0); 367#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 374#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2018-11-23 02:29:14,165 INFO L796 eck$LassoCheckResult]: Loop: 362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 363#L12 assume !(10 == main_~i~0); 356#L12-2 assume !(0 == main_~i~0); 357#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 362#L18-1 [2018-11-23 02:29:14,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 3 times [2018-11-23 02:29:14,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:14,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1236522, now seen corresponding path program 1 times [2018-11-23 02:29:14,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:14,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash -760725580, now seen corresponding path program 1 times [2018-11-23 02:29:14,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:14,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,201 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:14,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:14,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:14,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:14,201 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:14,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:14,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:14,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:14,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 02:29:14,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:14,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:14,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,264 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:14,264 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,271 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:14,271 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,286 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,301 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:14,301 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,304 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:14,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,335 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:14,348 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:14,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:14,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:14,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:14,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:14,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:14,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:14,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:14,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 02:29:14,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:14,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:14,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,435 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:14,435 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:14,435 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-23 02:29:14,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:14,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:14,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:14,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,437 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-23 02:29:14,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:14,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:14,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:14,440 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:14,442 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:14,442 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:14,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:14,442 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:14,442 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:14,442 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-23 02:29:14,443 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:14,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:14,476 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-23 02:29:14,476 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-23 02:29:14,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-23 02:29:14,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 40 states and 57 transitions. Complement of second has 7 states. [2018-11-23 02:29:14,504 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-23 02:29:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 02:29:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-23 02:29:14,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-23 02:29:14,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-23 02:29:14,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-23 02:29:14,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 57 transitions. [2018-11-23 02:29:14,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 02:29:14,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 55 transitions. [2018-11-23 02:29:14,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 02:29:14,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 02:29:14,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 55 transitions. [2018-11-23 02:29:14,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:14,507 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 55 transitions. [2018-11-23 02:29:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 55 transitions. [2018-11-23 02:29:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-11-23 02:29:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 02:29:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2018-11-23 02:29:14,509 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-23 02:29:14,510 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 53 transitions. [2018-11-23 02:29:14,510 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 02:29:14,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 53 transitions. [2018-11-23 02:29:14,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 02:29:14,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:14,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:14,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-23 02:29:14,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:14,511 INFO L794 eck$LassoCheckResult]: Stem: 480#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 485#L12 assume !(10 == main_~i~0); 501#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 500#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 487#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2018-11-23 02:29:14,511 INFO L796 eck$LassoCheckResult]: Loop: 476#L12-2 assume !(0 == main_~i~0); 477#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 511#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 509#L12 assume 10 == main_~i~0;main_~up~0 := 0; 476#L12-2 [2018-11-23 02:29:14,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2018-11-23 02:29:14,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,523 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-23 02:29:14,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:14,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:29:14,524 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:14,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2018-11-23 02:29:14,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:14,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:14,542 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:14,542 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:14,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:14,543 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:14,543 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:14,543 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:14,543 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:14,543 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:14,543 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 02:29:14,543 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:14,543 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:14,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,586 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:14,586 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,616 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:14,616 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,618 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,618 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:14,633 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,637 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:14,640 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:14,654 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:14,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:14,670 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:14,756 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:14,757 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:14,757 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:14,757 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:14,757 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:14,757 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:14,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:14,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:14,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:14,758 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 02:29:14,758 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:14,758 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:14,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-23 02:29:14,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-23 02:29:14,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:14,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:14,803 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:14,804 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-23 02:29:14,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:14,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:14,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,812 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-23 02:29:14,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:14,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,813 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:29:14,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:29:14,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:14,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,817 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-23 02:29:14,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:14,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:14,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:14,828 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-23 02:29:14,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:14,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:14,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:14,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:14,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:14,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:14,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:14,832 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:14,833 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:14,833 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:29:14,834 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:14,834 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:14,834 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:14,834 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-23 02:29:14,834 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:14,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:14,882 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-23 02:29:14,882 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-23 02:29:14,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-23 02:29:14,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 53 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 93 states and 141 transitions. Complement of second has 7 states. [2018-11-23 02:29:14,900 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-23 02:29:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 02:29:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 02:29:14,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-23 02:29:14,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-23 02:29:14,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-23 02:29:14,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:14,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 141 transitions. [2018-11-23 02:29:14,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2018-11-23 02:29:14,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 78 states and 116 transitions. [2018-11-23 02:29:14,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-23 02:29:14,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-23 02:29:14,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 116 transitions. [2018-11-23 02:29:14,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:14,905 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 116 transitions. [2018-11-23 02:29:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 116 transitions. [2018-11-23 02:29:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-23 02:29:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 02:29:14,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2018-11-23 02:29:14,908 INFO L728 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2018-11-23 02:29:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:29:14,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:29:14,908 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand 4 states. [2018-11-23 02:29:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:14,934 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-11-23 02:29:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:29:14,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 146 transitions. [2018-11-23 02:29:14,937 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-11-23 02:29:14,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 146 transitions. [2018-11-23 02:29:14,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 02:29:14,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-23 02:29:14,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 146 transitions. [2018-11-23 02:29:14,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:14,938 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 146 transitions. [2018-11-23 02:29:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 146 transitions. [2018-11-23 02:29:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-11-23 02:29:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 02:29:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2018-11-23 02:29:14,946 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-11-23 02:29:14,946 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 140 transitions. [2018-11-23 02:29:14,946 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 02:29:14,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 140 transitions. [2018-11-23 02:29:14,947 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2018-11-23 02:29:14,947 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:14,947 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:14,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-23 02:29:14,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:14,948 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 850#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 875#L12 assume !(10 == main_~i~0); 872#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 873#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 869#L12 assume !(10 == main_~i~0); 923#L12-2 assume !(0 == main_~i~0); 922#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2018-11-23 02:29:14,948 INFO L796 eck$LassoCheckResult]: Loop: 910#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 921#L12 assume !(10 == main_~i~0); 919#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 917#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 910#L18-1 [2018-11-23 02:29:14,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash -760725578, now seen corresponding path program 1 times [2018-11-23 02:29:14,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:14,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:29:14,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:14,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:29:14,963 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:14,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1236462, now seen corresponding path program 1 times [2018-11-23 02:29:14,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:14,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:14,973 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-23 02:29:14,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:29:14,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:29:14,974 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:29:14,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:29:14,974 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. cyclomatic complexity: 51 Second operand 3 states. [2018-11-23 02:29:14,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:14,981 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-11-23 02:29:14,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:29:14,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 76 transitions. [2018-11-23 02:29:14,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 02:29:14,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 51 states and 63 transitions. [2018-11-23 02:29:14,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 02:29:14,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 02:29:14,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-11-23 02:29:14,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:14,984 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 02:29:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-11-23 02:29:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-11-23 02:29:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:29:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-23 02:29:14,986 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-23 02:29:14,986 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-23 02:29:14,986 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 02:29:14,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-11-23 02:29:14,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 02:29:14,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:14,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:14,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 02:29:14,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 02:29:14,987 INFO L794 eck$LassoCheckResult]: Stem: 1019#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1050#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1055#L12-2 assume !(0 == main_~i~0); 1030#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1031#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1048#L12 assume !(10 == main_~i~0); 1044#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1045#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1038#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1039#L12 assume !(10 == main_~i~0); 1034#L12-2 assume !(0 == main_~i~0); 1035#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1040#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1041#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2018-11-23 02:29:14,987 INFO L796 eck$LassoCheckResult]: Loop: 1057#L12-2 assume !(0 == main_~i~0); 1028#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1029#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1058#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1057#L12-2 [2018-11-23 02:29:14,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:14,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1385122848, now seen corresponding path program 1 times [2018-11-23 02:29:14,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,007 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-23 02:29:15,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:15,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,036 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-23 02:29:15,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 02:29:15,052 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:15,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2018-11-23 02:29:15,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:15,080 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:15,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:15,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:15,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:15,080 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:15,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:15,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:15,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:15,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-23 02:29:15,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:15,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:15,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-23 02:29:15,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-23 02:29:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:15,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:15,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:15,126 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:15,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:15,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:15,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:15,132 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:15,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:15,150 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:15,170 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:15,170 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:15,257 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:15,258 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:15,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:15,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:15,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:15,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:15,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:15,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:15,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:15,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-23 02:29:15,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:15,259 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:15,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:15,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:15,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:15,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:15,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:15,302 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:15,302 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-23 02:29:15,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:15,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:15,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:15,303 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:29:15,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:15,303 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:29:15,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:15,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:15,304 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-23 02:29:15,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:15,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:15,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:15,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:15,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:15,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:15,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:15,306 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-23 02:29:15,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:15,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:15,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:15,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:15,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:15,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:15,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:15,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:15,309 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:15,309 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 02:29:15,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:15,310 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:15,310 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:15,310 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-23 02:29:15,310 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:15,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,337 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-23 02:29:15,337 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-23 02:29:15,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-23 02:29:15,350 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 59 states and 75 transitions. Complement of second has 7 states. [2018-11-23 02:29:15,351 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-23 02:29:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 02:29:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-23 02:29:15,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 02:29:15,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:15,351 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:29:15,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,374 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-23 02:29:15,375 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-23 02:29:15,375 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-23 02:29:15,396 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 81 states and 96 transitions. Complement of second has 9 states. [2018-11-23 02:29:15,396 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-23 02:29:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 02:29:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 02:29:15,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 02:29:15,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:15,396 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 02:29:15,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,421 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-23 02:29:15,421 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-23 02:29:15,421 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-23 02:29:15,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 68 states and 87 transitions. Complement of second has 8 states. [2018-11-23 02:29:15,436 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-23 02:29:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 02:29:15,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 02:29:15,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2018-11-23 02:29:15,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:15,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-23 02:29:15,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:15,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-23 02:29:15,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:15,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 87 transitions. [2018-11-23 02:29:15,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-23 02:29:15,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 63 transitions. [2018-11-23 02:29:15,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 02:29:15,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 02:29:15,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2018-11-23 02:29:15,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:15,439 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 02:29:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2018-11-23 02:29:15,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-11-23 02:29:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 02:29:15,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-23 02:29:15,441 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-23 02:29:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:29:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:29:15,441 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2018-11-23 02:29:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:15,461 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-11-23 02:29:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:29:15,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2018-11-23 02:29:15,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-23 02:29:15,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 40 states and 49 transitions. [2018-11-23 02:29:15,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 02:29:15,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 02:29:15,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-11-23 02:29:15,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:15,463 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-23 02:29:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-11-23 02:29:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-23 02:29:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 02:29:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-11-23 02:29:15,465 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 02:29:15,465 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-11-23 02:29:15,465 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 02:29:15,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 43 transitions. [2018-11-23 02:29:15,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-23 02:29:15,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:15,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:15,466 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2018-11-23 02:29:15,466 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1] [2018-11-23 02:29:15,466 INFO L794 eck$LassoCheckResult]: Stem: 1606#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1612#L12 assume !(10 == main_~i~0); 1613#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1615#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1608#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1609#L12 assume !(10 == main_~i~0); 1633#L12-2 assume !(0 == main_~i~0); 1632#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1631#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1621#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2018-11-23 02:29:15,466 INFO L796 eck$LassoCheckResult]: Loop: 1602#L12-2 assume !(0 == main_~i~0); 1603#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1636#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1635#L12 assume !(10 == main_~i~0); 1624#L12-2 assume !(0 == main_~i~0); 1629#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1627#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1622#L12 assume !(10 == main_~i~0); 1625#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1628#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1626#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1619#L12 assume !(10 == main_~i~0); 1617#L12-2 assume !(0 == main_~i~0); 1618#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1630#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1620#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1602#L12-2 [2018-11-23 02:29:15,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,467 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2018-11-23 02:29:15,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:15,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,494 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-23 02:29:15,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,504 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-23 02:29:15,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 02:29:15,519 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:15,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1697726743, now seen corresponding path program 1 times [2018-11-23 02:29:15,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:15,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,543 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-23 02:29:15,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,544 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,561 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-23 02:29:15,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 02:29:15,576 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:15,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:29:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:29:15,577 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 02:29:15,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:15,601 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 02:29:15,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:29:15,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 57 transitions. [2018-11-23 02:29:15,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-23 02:29:15,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 48 states and 56 transitions. [2018-11-23 02:29:15,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 02:29:15,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-23 02:29:15,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 56 transitions. [2018-11-23 02:29:15,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:15,603 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 02:29:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 56 transitions. [2018-11-23 02:29:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2018-11-23 02:29:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 02:29:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 02:29:15,605 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 02:29:15,605 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 02:29:15,605 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 02:29:15,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 51 transitions. [2018-11-23 02:29:15,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-23 02:29:15,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:15,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:15,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2018-11-23 02:29:15,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2018-11-23 02:29:15,607 INFO L794 eck$LassoCheckResult]: Stem: 1776#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1777#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1793#L12 assume !(10 == main_~i~0); 1794#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1809#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1806#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1807#L12 assume !(10 == main_~i~0); 1813#L12-2 assume !(0 == main_~i~0); 1812#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1780#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1781#L12 assume !(10 == main_~i~0); 1774#L12-2 assume !(0 == main_~i~0); 1775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1808#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2018-11-23 02:29:15,607 INFO L796 eck$LassoCheckResult]: Loop: 1772#L12-2 assume !(0 == main_~i~0); 1773#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1803#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1801#L12 assume !(10 == main_~i~0); 1792#L12-2 assume !(0 == main_~i~0); 1798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1795#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1790#L12 assume !(10 == main_~i~0); 1787#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1788#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1779#L12 assume !(10 == main_~i~0); 1814#L12-2 assume !(0 == main_~i~0); 1784#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1785#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1782#L12 assume !(10 == main_~i~0); 1783#L12-2 assume !(0 == main_~i~0); 1789#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1810#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1811#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1772#L12-2 [2018-11-23 02:29:15,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2018-11-23 02:29:15,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:15,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,627 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-23 02:29:15,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:15,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:29:15,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:29:15,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:15,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,644 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-23 02:29:15,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 02:29:15,659 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:15,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 104414290, now seen corresponding path program 2 times [2018-11-23 02:29:15,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,685 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-23 02:29:15,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:15,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:29:15,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:29:15,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:15,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,706 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-23 02:29:15,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 02:29:15,721 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:29:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:29:15,721 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-23 02:29:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:15,750 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2018-11-23 02:29:15,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:29:15,752 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 65 transitions. [2018-11-23 02:29:15,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-23 02:29:15,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 64 transitions. [2018-11-23 02:29:15,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 02:29:15,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 02:29:15,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 64 transitions. [2018-11-23 02:29:15,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:15,753 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-11-23 02:29:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 64 transitions. [2018-11-23 02:29:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-23 02:29:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 02:29:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-23 02:29:15,755 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-23 02:29:15,755 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-23 02:29:15,755 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 02:29:15,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2018-11-23 02:29:15,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-23 02:29:15,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:15,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:15,755 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2018-11-23 02:29:15,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2018-11-23 02:29:15,756 INFO L794 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 1989#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1999#L12 assume !(10 == main_~i~0); 2000#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2018#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2015#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2016#L12 assume !(10 == main_~i~0); 2023#L12-2 assume !(0 == main_~i~0); 2024#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2028#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2026#L12 assume !(10 == main_~i~0); 2027#L12-2 assume !(0 == main_~i~0); 1996#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1992#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1993#L12 assume !(10 == main_~i~0); 1986#L12-2 assume !(0 == main_~i~0); 1987#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2019#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2017#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2018-11-23 02:29:15,756 INFO L796 eck$LassoCheckResult]: Loop: 1984#L12-2 assume !(0 == main_~i~0); 1985#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2013#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2011#L12 assume !(10 == main_~i~0); 2003#L12-2 assume !(0 == main_~i~0); 2008#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2006#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2001#L12 assume !(10 == main_~i~0); 1997#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1995#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1990#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1991#L12 assume !(10 == main_~i~0); 1994#L12-2 assume !(0 == main_~i~0); 1998#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2034#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2033#L12 assume !(10 == main_~i~0); 2032#L12-2 assume !(0 == main_~i~0); 2031#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2030#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2029#L12 assume !(10 == main_~i~0); 2025#L12-2 assume !(0 == main_~i~0); 2022#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2020#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2021#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1984#L12-2 [2018-11-23 02:29:15,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2018-11-23 02:29:15,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,784 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-23 02:29:15,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:15,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:29:15,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 02:29:15,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:15,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,799 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-23 02:29:15,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 02:29:15,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:15,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1813717701, now seen corresponding path program 3 times [2018-11-23 02:29:15,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:15,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,847 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-23 02:29:15,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,848 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:29:15,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 02:29:15,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:15,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,862 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-23 02:29:15,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 02:29:15,877 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:15,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:29:15,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:29:15,877 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-23 02:29:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:15,901 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-23 02:29:15,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:29:15,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 73 transitions. [2018-11-23 02:29:15,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-23 02:29:15,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 64 states and 72 transitions. [2018-11-23 02:29:15,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-23 02:29:15,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-23 02:29:15,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 72 transitions. [2018-11-23 02:29:15,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:15,903 INFO L705 BuchiCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-11-23 02:29:15,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 72 transitions. [2018-11-23 02:29:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-11-23 02:29:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 02:29:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2018-11-23 02:29:15,905 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-23 02:29:15,905 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 67 transitions. [2018-11-23 02:29:15,905 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 02:29:15,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 67 transitions. [2018-11-23 02:29:15,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-23 02:29:15,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:15,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:15,906 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2018-11-23 02:29:15,906 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 5, 2, 1, 1] [2018-11-23 02:29:15,906 INFO L794 eck$LassoCheckResult]: Stem: 2242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2254#L12 assume !(10 == main_~i~0); 2255#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2270#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2271#L12 assume !(10 == main_~i~0); 2296#L12-2 assume !(0 == main_~i~0); 2295#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2246#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2247#L12 assume !(10 == main_~i~0); 2240#L12-2 assume !(0 == main_~i~0); 2241#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2294#L12 assume !(10 == main_~i~0); 2293#L12-2 assume !(0 == main_~i~0); 2292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2275#L12 assume !(10 == main_~i~0); 2280#L12-2 assume !(0 == main_~i~0); 2278#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2018-11-23 02:29:15,906 INFO L796 eck$LassoCheckResult]: Loop: 2238#L12-2 assume !(0 == main_~i~0); 2239#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2266#L12 assume !(10 == main_~i~0); 2258#L12-2 assume !(0 == main_~i~0); 2263#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2261#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2256#L12 assume !(10 == main_~i~0); 2252#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2253#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2244#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2245#L12 assume !(10 == main_~i~0); 2248#L12-2 assume !(0 == main_~i~0); 2249#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2250#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2290#L12 assume !(10 == main_~i~0); 2289#L12-2 assume !(0 == main_~i~0); 2288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2286#L12 assume !(10 == main_~i~0); 2285#L12-2 assume !(0 == main_~i~0); 2284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2282#L12 assume !(10 == main_~i~0); 2281#L12-2 assume !(0 == main_~i~0); 2279#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2277#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2238#L12-2 [2018-11-23 02:29:15,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2018-11-23 02:29:15,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:15,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:15,939 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-23 02:29:15,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:15,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:15,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:29:15,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:29:15,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:15,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:15,954 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-23 02:29:15,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:15,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 02:29:15,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:15,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash 798220708, now seen corresponding path program 4 times [2018-11-23 02:29:15,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:15,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:15,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:15,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,004 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-23 02:29:16,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:29:16,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:29:16,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:16,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,040 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-23 02:29:16,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 02:29:16,058 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:29:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:29:16,058 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. cyclomatic complexity: 11 Second operand 8 states. [2018-11-23 02:29:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:16,082 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-11-23 02:29:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:29:16,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 81 transitions. [2018-11-23 02:29:16,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2018-11-23 02:29:16,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 80 transitions. [2018-11-23 02:29:16,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 02:29:16,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-23 02:29:16,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-11-23 02:29:16,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:16,084 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-23 02:29:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-11-23 02:29:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2018-11-23 02:29:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 02:29:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-23 02:29:16,086 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-23 02:29:16,086 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-23 02:29:16,086 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 02:29:16,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 75 transitions. [2018-11-23 02:29:16,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-23 02:29:16,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:16,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:16,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2018-11-23 02:29:16,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 6, 2, 1, 1] [2018-11-23 02:29:16,087 INFO L794 eck$LassoCheckResult]: Stem: 2538#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2539#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2550#L12 assume !(10 == main_~i~0); 2551#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2569#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2566#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2567#L12 assume !(10 == main_~i~0); 2600#L12-2 assume !(0 == main_~i~0); 2599#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2542#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2543#L12 assume !(10 == main_~i~0); 2536#L12-2 assume !(0 == main_~i~0); 2537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2598#L12 assume !(10 == main_~i~0); 2597#L12-2 assume !(0 == main_~i~0); 2596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2594#L12 assume !(10 == main_~i~0); 2593#L12-2 assume !(0 == main_~i~0); 2592#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2591#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2573#L12 assume !(10 == main_~i~0); 2577#L12-2 assume !(0 == main_~i~0); 2575#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2572#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2568#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2018-11-23 02:29:16,088 INFO L796 eck$LassoCheckResult]: Loop: 2534#L12-2 assume !(0 == main_~i~0); 2535#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2562#L12 assume !(10 == main_~i~0); 2554#L12-2 assume !(0 == main_~i~0); 2559#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2557#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2552#L12 assume !(10 == main_~i~0); 2548#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2541#L12 assume !(10 == main_~i~0); 2544#L12-2 assume !(0 == main_~i~0); 2545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2590#L12 assume !(10 == main_~i~0); 2589#L12-2 assume !(0 == main_~i~0); 2588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2587#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2586#L12 assume !(10 == main_~i~0); 2585#L12-2 assume !(0 == main_~i~0); 2584#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2583#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2582#L12 assume !(10 == main_~i~0); 2581#L12-2 assume !(0 == main_~i~0); 2580#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2579#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2578#L12 assume !(10 == main_~i~0); 2576#L12-2 assume !(0 == main_~i~0); 2574#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2570#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2571#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2534#L12-2 [2018-11-23 02:29:16,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2018-11-23 02:29:16,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,121 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-23 02:29:16,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:29:16,184 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 02:29:16,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:16,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,189 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-23 02:29:16,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 02:29:16,207 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:16,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1712813683, now seen corresponding path program 5 times [2018-11-23 02:29:16,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:16,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,250 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-23 02:29:16,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:29:16,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 02:29:16,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:16,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,268 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-23 02:29:16,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 02:29:16,286 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:16,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:29:16,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:29:16,286 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-23 02:29:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:16,314 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-11-23 02:29:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:29:16,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 89 transitions. [2018-11-23 02:29:16,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2018-11-23 02:29:16,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 88 transitions. [2018-11-23 02:29:16,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 02:29:16,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 02:29:16,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-11-23 02:29:16,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:16,316 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-23 02:29:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-11-23 02:29:16,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-23 02:29:16,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 02:29:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-11-23 02:29:16,318 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-23 02:29:16,318 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-11-23 02:29:16,318 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 02:29:16,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 83 transitions. [2018-11-23 02:29:16,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-23 02:29:16,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:16,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:16,319 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2018-11-23 02:29:16,319 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 7, 2, 1, 1] [2018-11-23 02:29:16,320 INFO L794 eck$LassoCheckResult]: Stem: 2876#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 2877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2892#L12 assume !(10 == main_~i~0); 2893#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2905#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2906#L12 assume !(10 == main_~i~0); 2946#L12-2 assume !(0 == main_~i~0); 2945#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2880#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2881#L12 assume !(10 == main_~i~0); 2874#L12-2 assume !(0 == main_~i~0); 2875#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2944#L12 assume !(10 == main_~i~0); 2943#L12-2 assume !(0 == main_~i~0); 2942#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2941#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2940#L12 assume !(10 == main_~i~0); 2939#L12-2 assume !(0 == main_~i~0); 2938#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2937#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2936#L12 assume !(10 == main_~i~0); 2935#L12-2 assume !(0 == main_~i~0); 2934#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2933#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2912#L12 assume !(10 == main_~i~0); 2916#L12-2 assume !(0 == main_~i~0); 2914#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2907#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2018-11-23 02:29:16,320 INFO L796 eck$LassoCheckResult]: Loop: 2872#L12-2 assume !(0 == main_~i~0); 2873#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2900#L12 assume !(10 == main_~i~0); 2891#L12-2 assume !(0 == main_~i~0); 2897#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2894#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2889#L12 assume !(10 == main_~i~0); 2886#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2883#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2884#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2932#L12 assume !(10 == main_~i~0); 2887#L12-2 assume !(0 == main_~i~0); 2888#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2878#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2879#L12 assume !(10 == main_~i~0); 2882#L12-2 assume !(0 == main_~i~0); 2931#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2930#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2929#L12 assume !(10 == main_~i~0); 2928#L12-2 assume !(0 == main_~i~0); 2927#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2926#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2925#L12 assume !(10 == main_~i~0); 2924#L12-2 assume !(0 == main_~i~0); 2923#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2922#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2921#L12 assume !(10 == main_~i~0); 2920#L12-2 assume !(0 == main_~i~0); 2919#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2918#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2917#L12 assume !(10 == main_~i~0); 2915#L12-2 assume !(0 == main_~i~0); 2913#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2909#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2910#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2872#L12-2 [2018-11-23 02:29:16,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,320 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2018-11-23 02:29:16,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,407 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-23 02:29:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,420 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:29:16,431 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 02:29:16,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:16,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,438 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-23 02:29:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 02:29:16,464 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:16,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,464 INFO L82 PathProgramCache]: Analyzing trace with hash -127593226, now seen corresponding path program 6 times [2018-11-23 02:29:16,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:16,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,510 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-23 02:29:16,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:29:16,540 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-11-23 02:29:16,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:16,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,546 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-23 02:29:16,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 02:29:16,570 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:16,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:29:16,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:29:16,571 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. cyclomatic complexity: 11 Second operand 10 states. [2018-11-23 02:29:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:16,614 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-11-23 02:29:16,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:29:16,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 97 transitions. [2018-11-23 02:29:16,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2018-11-23 02:29:16,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 88 states and 96 transitions. [2018-11-23 02:29:16,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 02:29:16,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 02:29:16,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 96 transitions. [2018-11-23 02:29:16,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:16,616 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-23 02:29:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 96 transitions. [2018-11-23 02:29:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2018-11-23 02:29:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 02:29:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-11-23 02:29:16,618 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-23 02:29:16,618 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-11-23 02:29:16,618 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 02:29:16,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 91 transitions. [2018-11-23 02:29:16,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2018-11-23 02:29:16,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:16,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:16,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2018-11-23 02:29:16,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 8, 2, 1, 1] [2018-11-23 02:29:16,620 INFO L794 eck$LassoCheckResult]: Stem: 3256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3257#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3272#L12 assume !(10 == main_~i~0); 3273#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3287#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3263#L12 assume !(10 == main_~i~0); 3254#L12-2 assume !(0 == main_~i~0); 3255#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3261#L12 assume !(10 == main_~i~0); 3334#L12-2 assume !(0 == main_~i~0); 3333#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3332#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3331#L12 assume !(10 == main_~i~0); 3330#L12-2 assume !(0 == main_~i~0); 3329#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3328#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3327#L12 assume !(10 == main_~i~0); 3326#L12-2 assume !(0 == main_~i~0); 3325#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3324#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3323#L12 assume !(10 == main_~i~0); 3322#L12-2 assume !(0 == main_~i~0); 3321#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3320#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3319#L12 assume !(10 == main_~i~0); 3318#L12-2 assume !(0 == main_~i~0); 3317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3316#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3291#L12 assume !(10 == main_~i~0); 3295#L12-2 assume !(0 == main_~i~0); 3293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3290#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3286#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2018-11-23 02:29:16,620 INFO L796 eck$LassoCheckResult]: Loop: 3252#L12-2 assume !(0 == main_~i~0); 3253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3282#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3280#L12 assume !(10 == main_~i~0); 3271#L12-2 assume !(0 == main_~i~0); 3277#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3274#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3269#L12 assume !(10 == main_~i~0); 3266#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3265#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3315#L12 assume !(10 == main_~i~0); 3267#L12-2 assume !(0 == main_~i~0); 3268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3259#L12 assume !(10 == main_~i~0); 3262#L12-2 assume !(0 == main_~i~0); 3314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3312#L12 assume !(10 == main_~i~0); 3311#L12-2 assume !(0 == main_~i~0); 3310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3308#L12 assume !(10 == main_~i~0); 3307#L12-2 assume !(0 == main_~i~0); 3306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3304#L12 assume !(10 == main_~i~0); 3303#L12-2 assume !(0 == main_~i~0); 3302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3300#L12 assume !(10 == main_~i~0); 3299#L12-2 assume !(0 == main_~i~0); 3298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3296#L12 assume !(10 == main_~i~0); 3294#L12-2 assume !(0 == main_~i~0); 3292#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3289#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3252#L12-2 [2018-11-23 02:29:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,620 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2018-11-23 02:29:16,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:16,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,672 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-23 02:29:16,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,702 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-23 02:29:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 02:29:16,718 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:16,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1701561311, now seen corresponding path program 7 times [2018-11-23 02:29:16,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:16,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,770 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-23 02:29:16,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,791 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-23 02:29:16,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 02:29:16,807 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:16,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:29:16,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:29:16,807 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. cyclomatic complexity: 11 Second operand 11 states. [2018-11-23 02:29:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:16,855 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-11-23 02:29:16,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:29:16,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 105 transitions. [2018-11-23 02:29:16,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-23 02:29:16,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 96 states and 104 transitions. [2018-11-23 02:29:16,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-23 02:29:16,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-23 02:29:16,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 104 transitions. [2018-11-23 02:29:16,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:16,859 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-11-23 02:29:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 104 transitions. [2018-11-23 02:29:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2018-11-23 02:29:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 02:29:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-11-23 02:29:16,861 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-23 02:29:16,861 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-11-23 02:29:16,861 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 02:29:16,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 99 transitions. [2018-11-23 02:29:16,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-23 02:29:16,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:16,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:16,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2018-11-23 02:29:16,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2018-11-23 02:29:16,863 INFO L794 eck$LassoCheckResult]: Stem: 3678#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 3679#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3693#L12 assume !(10 == main_~i~0); 3694#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3708#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3706#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3685#L12 assume !(10 == main_~i~0); 3676#L12-2 assume !(0 == main_~i~0); 3677#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3682#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3683#L12 assume !(10 == main_~i~0); 3764#L12-2 assume !(0 == main_~i~0); 3763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3761#L12 assume !(10 == main_~i~0); 3760#L12-2 assume !(0 == main_~i~0); 3759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3758#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3757#L12 assume !(10 == main_~i~0); 3756#L12-2 assume !(0 == main_~i~0); 3755#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3754#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3753#L12 assume !(10 == main_~i~0); 3752#L12-2 assume !(0 == main_~i~0); 3751#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3749#L12 assume !(10 == main_~i~0); 3748#L12-2 assume !(0 == main_~i~0); 3747#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3745#L12 assume !(10 == main_~i~0); 3744#L12-2 assume !(0 == main_~i~0); 3743#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3742#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3710#L12 assume !(10 == main_~i~0); 3715#L12-2 assume !(0 == main_~i~0); 3713#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3707#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2018-11-23 02:29:16,863 INFO L796 eck$LassoCheckResult]: Loop: 3674#L12-2 assume !(0 == main_~i~0); 3675#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3703#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3701#L12 assume !(10 == main_~i~0); 3692#L12-2 assume !(0 == main_~i~0); 3698#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3695#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3690#L12 assume !(10 == main_~i~0); 3688#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3689#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3680#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3681#L12 assume !(10 == main_~i~0); 3684#L12-2 assume !(0 == main_~i~0); 3686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3687#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3741#L12 assume !(10 == main_~i~0); 3740#L12-2 assume !(0 == main_~i~0); 3739#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3738#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3737#L12 assume !(10 == main_~i~0); 3736#L12-2 assume !(0 == main_~i~0); 3735#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3734#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3733#L12 assume !(10 == main_~i~0); 3732#L12-2 assume !(0 == main_~i~0); 3731#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3730#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3729#L12 assume !(10 == main_~i~0); 3728#L12-2 assume !(0 == main_~i~0); 3727#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3726#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3725#L12 assume !(10 == main_~i~0); 3724#L12-2 assume !(0 == main_~i~0); 3723#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3722#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3721#L12 assume !(10 == main_~i~0); 3720#L12-2 assume !(0 == main_~i~0); 3719#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3718#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3717#L12 assume !(10 == main_~i~0); 3716#L12-2 assume !(0 == main_~i~0); 3714#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3711#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3712#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3674#L12-2 [2018-11-23 02:29:16,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,863 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2018-11-23 02:29:16,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:16,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:16,920 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-23 02:29:16,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:16,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:29:16,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:29:16,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:16,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:16,967 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-23 02:29:16,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:16,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 02:29:16,983 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 02:29:16,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2143365560, now seen corresponding path program 8 times [2018-11-23 02:29:16,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:17,042 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-23 02:29:17,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:17,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:17,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:29:17,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:29:17,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:17,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:17,076 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-23 02:29:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 02:29:17,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 02:29:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:29:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:29:17,094 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. cyclomatic complexity: 11 Second operand 12 states. [2018-11-23 02:29:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:17,128 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-11-23 02:29:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:29:17,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 113 transitions. [2018-11-23 02:29:17,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-23 02:29:17,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 112 transitions. [2018-11-23 02:29:17,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-23 02:29:17,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-23 02:29:17,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 112 transitions. [2018-11-23 02:29:17,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:17,131 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-11-23 02:29:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 112 transitions. [2018-11-23 02:29:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-11-23 02:29:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 02:29:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-11-23 02:29:17,133 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-23 02:29:17,133 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-11-23 02:29:17,133 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 02:29:17,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 107 transitions. [2018-11-23 02:29:17,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-11-23 02:29:17,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:17,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:17,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:17,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 10, 2, 1, 1] [2018-11-23 02:29:17,135 INFO L794 eck$LassoCheckResult]: Stem: 4142#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 4143#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4154#L12 assume !(10 == main_~i~0); 4155#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4172#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4170#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4149#L12 assume !(10 == main_~i~0); 4140#L12-2 assume !(0 == main_~i~0); 4141#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4146#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4147#L12 assume !(10 == main_~i~0); 4236#L12-2 assume !(0 == main_~i~0); 4235#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4234#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4233#L12 assume !(10 == main_~i~0); 4232#L12-2 assume !(0 == main_~i~0); 4231#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4229#L12 assume !(10 == main_~i~0); 4228#L12-2 assume !(0 == main_~i~0); 4227#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4226#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4225#L12 assume !(10 == main_~i~0); 4224#L12-2 assume !(0 == main_~i~0); 4223#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4222#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4221#L12 assume !(10 == main_~i~0); 4220#L12-2 assume !(0 == main_~i~0); 4219#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4218#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4217#L12 assume !(10 == main_~i~0); 4216#L12-2 assume !(0 == main_~i~0); 4215#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4214#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4213#L12 assume !(10 == main_~i~0); 4212#L12-2 assume !(0 == main_~i~0); 4211#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4210#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4174#L12 assume !(10 == main_~i~0); 4179#L12-2 assume !(0 == main_~i~0); 4177#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4171#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2018-11-23 02:29:17,135 INFO L796 eck$LassoCheckResult]: Loop: 4138#L12-2 assume !(0 == main_~i~0); 4139#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4168#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4166#L12 assume !(10 == main_~i~0); 4158#L12-2 assume !(0 == main_~i~0); 4163#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4161#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4156#L12 assume !(10 == main_~i~0); 4152#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4153#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4144#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4145#L12 assume !(10 == main_~i~0); 4148#L12-2 assume !(0 == main_~i~0); 4150#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4151#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4209#L12 assume !(10 == main_~i~0); 4208#L12-2 assume !(0 == main_~i~0); 4207#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4206#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4205#L12 assume !(10 == main_~i~0); 4204#L12-2 assume !(0 == main_~i~0); 4203#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4202#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4201#L12 assume !(10 == main_~i~0); 4200#L12-2 assume !(0 == main_~i~0); 4199#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4198#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4197#L12 assume !(10 == main_~i~0); 4196#L12-2 assume !(0 == main_~i~0); 4195#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4194#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4193#L12 assume !(10 == main_~i~0); 4192#L12-2 assume !(0 == main_~i~0); 4191#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4190#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4189#L12 assume !(10 == main_~i~0); 4188#L12-2 assume !(0 == main_~i~0); 4187#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4186#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4185#L12 assume !(10 == main_~i~0); 4184#L12-2 assume !(0 == main_~i~0); 4183#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4182#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4181#L12 assume !(10 == main_~i~0); 4180#L12-2 assume !(0 == main_~i~0); 4178#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4175#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4176#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4138#L12-2 [2018-11-23 02:29:17,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2018-11-23 02:29:17,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:17,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,144 INFO L82 PathProgramCache]: Analyzing trace with hash -50295759, now seen corresponding path program 9 times [2018-11-23 02:29:17,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:17,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:17,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1470164625, now seen corresponding path program 2 times [2018-11-23 02:29:17,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:17,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:17,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:17,201 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-23 02:29:17,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:17,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:17,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:29:17,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:29:17,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:17,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:17,231 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-23 02:29:17,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:17,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 02:29:17,381 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 49 [2018-11-23 02:29:17,385 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:17,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:17,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:17,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:17,385 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:17,385 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:17,385 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:17,385 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:17,385 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-23 02:29:17,385 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:17,385 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:17,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:17,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:17,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:17,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:17,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:17,433 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:17,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:17,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:17,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:17,453 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_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:17,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:17,457 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:17,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:17,482 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_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:17,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:17,485 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:17,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:17,503 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:17,506 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:17,519 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:17,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:17,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:17,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:17,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:17,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:17,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:17,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:17,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration17_Loop [2018-11-23 02:29:17,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:17,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:17,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-23 02:29:17,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:17,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-23 02:29:17,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:17,577 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:17,577 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:17,577 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-23 02:29:17,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:17,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:17,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:17,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:17,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:17,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:17,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:17,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-23 02:29:17,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:17,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:17,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:17,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:17,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:17,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:17,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:17,583 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:17,584 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:17,584 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:17,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:17,584 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:17,584 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:17,584 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-23 02:29:17,585 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:17,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:17,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:17,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:17,642 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-23 02:29:17,642 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-23 02:29:17,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-11-23 02:29:17,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 99 states and 107 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 367 states and 394 transitions. Complement of second has 15 states. [2018-11-23 02:29:17,708 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-23 02:29:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 02:29:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 02:29:17,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 48 letters. [2018-11-23 02:29:17,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:17,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 91 letters. Loop has 48 letters. [2018-11-23 02:29:17,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:17,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 43 letters. Loop has 96 letters. [2018-11-23 02:29:17,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:17,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 394 transitions. [2018-11-23 02:29:17,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-23 02:29:17,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 330 states and 354 transitions. [2018-11-23 02:29:17,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-23 02:29:17,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:17,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 330 states and 354 transitions. [2018-11-23 02:29:17,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:17,715 INFO L705 BuchiCegarLoop]: Abstraction has 330 states and 354 transitions. [2018-11-23 02:29:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states and 354 transitions. [2018-11-23 02:29:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 306. [2018-11-23 02:29:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-23 02:29:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 327 transitions. [2018-11-23 02:29:17,720 INFO L728 BuchiCegarLoop]: Abstraction has 306 states and 327 transitions. [2018-11-23 02:29:17,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:29:17,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:29:17,720 INFO L87 Difference]: Start difference. First operand 306 states and 327 transitions. Second operand 5 states. [2018-11-23 02:29:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:17,739 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-11-23 02:29:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:29:17,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 208 transitions. [2018-11-23 02:29:17,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-11-23 02:29:17,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 172 states and 189 transitions. [2018-11-23 02:29:17,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:17,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:17,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 189 transitions. [2018-11-23 02:29:17,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:17,742 INFO L705 BuchiCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-11-23 02:29:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 189 transitions. [2018-11-23 02:29:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 107. [2018-11-23 02:29:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 02:29:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-11-23 02:29:17,744 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-11-23 02:29:17,744 INFO L608 BuchiCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-11-23 02:29:17,744 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 02:29:17,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 117 transitions. [2018-11-23 02:29:17,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2018-11-23 02:29:17,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:17,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:17,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:17,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2018-11-23 02:29:17,746 INFO L794 eck$LassoCheckResult]: Stem: 5692#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 5693#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5704#L12 assume !(10 == main_~i~0); 5702#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5701#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5694#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5695#L12 assume !(10 == main_~i~0); 5792#L12-2 assume !(0 == main_~i~0); 5791#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5790#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5789#L12 assume !(10 == main_~i~0); 5788#L12-2 assume !(0 == main_~i~0); 5787#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5786#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5785#L12 assume !(10 == main_~i~0); 5784#L12-2 assume !(0 == main_~i~0); 5783#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5782#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5781#L12 assume !(10 == main_~i~0); 5780#L12-2 assume !(0 == main_~i~0); 5779#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5778#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5777#L12 assume !(10 == main_~i~0); 5776#L12-2 assume !(0 == main_~i~0); 5775#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5774#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5773#L12 assume !(10 == main_~i~0); 5772#L12-2 assume !(0 == main_~i~0); 5771#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5770#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5769#L12 assume !(10 == main_~i~0); 5768#L12-2 assume !(0 == main_~i~0); 5767#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5766#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5765#L12 assume !(10 == main_~i~0); 5764#L12-2 assume !(0 == main_~i~0); 5763#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5722#L12 assume !(10 == main_~i~0); 5760#L12-2 assume !(0 == main_~i~0); 5759#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5721#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5711#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2018-11-23 02:29:17,746 INFO L796 eck$LassoCheckResult]: Loop: 5688#L12-2 assume !(0 == main_~i~0); 5689#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5720#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5719#L12 assume !(10 == main_~i~0); 5718#L12-2 assume !(0 == main_~i~0); 5717#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5715#L12 assume !(10 == main_~i~0); 5708#L12-2 assume !(0 == main_~i~0); 5710#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5709#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5705#L12 assume !(10 == main_~i~0); 5707#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5758#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5756#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5698#L12 assume !(10 == main_~i~0); 5699#L12-2 assume !(0 == main_~i~0); 5703#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5757#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5755#L12 assume !(10 == main_~i~0); 5754#L12-2 assume !(0 == main_~i~0); 5753#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5751#L12 assume !(10 == main_~i~0); 5750#L12-2 assume !(0 == main_~i~0); 5749#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5748#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5747#L12 assume !(10 == main_~i~0); 5746#L12-2 assume !(0 == main_~i~0); 5745#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5744#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5743#L12 assume !(10 == main_~i~0); 5742#L12-2 assume !(0 == main_~i~0); 5741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5740#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5739#L12 assume !(10 == main_~i~0); 5738#L12-2 assume !(0 == main_~i~0); 5737#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5736#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5735#L12 assume !(10 == main_~i~0); 5734#L12-2 assume !(0 == main_~i~0); 5733#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5732#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5731#L12 assume !(10 == main_~i~0); 5730#L12-2 assume !(0 == main_~i~0); 5729#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5728#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5727#L12 assume !(10 == main_~i~0); 5726#L12-2 assume !(0 == main_~i~0); 5725#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5723#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5724#L12 assume 10 == main_~i~0;main_~up~0 := 0; 5688#L12-2 [2018-11-23 02:29:17,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2018-11-23 02:29:17,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:17,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,754 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2018-11-23 02:29:17,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:17,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:17,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:17,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:17,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 3 times [2018-11-23 02:29:17,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:17,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:17,804 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-23 02:29:17,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:17,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:17,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:29:17,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 02:29:17,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:17,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:17,849 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-23 02:29:17,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:17,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 02:29:18,011 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 52 [2018-11-23 02:29:18,015 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:18,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:18,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:18,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:18,016 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:18,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:18,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:18,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:18,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-23 02:29:18,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:18,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:18,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,058 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:18,058 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:18,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:18,061 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:18,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:18,081 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:18,084 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:18,098 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:18,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:18,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:18,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:18,098 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:18,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:18,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:18,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:18,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration18_Loop [2018-11-23 02:29:18,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:18,098 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:18,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:18,138 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:18,138 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-23 02:29:18,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:18,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:18,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:18,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:18,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:18,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:18,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:18,139 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:18,140 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:18,140 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:18,140 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:18,140 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:18,141 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:18,141 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-23 02:29:18,141 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:18,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:18,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:18,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:18,233 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-23 02:29:18,233 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-23 02:29:18,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13 Second operand 7 states. [2018-11-23 02:29:18,381 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 117 transitions. cyclomatic complexity: 13. Second operand 7 states. Result 431 states and 470 transitions. Complement of second has 19 states. [2018-11-23 02:29:18,381 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-23 02:29:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 02:29:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2018-11-23 02:29:18,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2018-11-23 02:29:18,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:18,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2018-11-23 02:29:18,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:18,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2018-11-23 02:29:18,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:18,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 470 transitions. [2018-11-23 02:29:18,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-23 02:29:18,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 366 states and 398 transitions. [2018-11-23 02:29:18,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-11-23 02:29:18,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:18,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 398 transitions. [2018-11-23 02:29:18,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:18,387 INFO L705 BuchiCegarLoop]: Abstraction has 366 states and 398 transitions. [2018-11-23 02:29:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 398 transitions. [2018-11-23 02:29:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 314. [2018-11-23 02:29:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-23 02:29:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 337 transitions. [2018-11-23 02:29:18,392 INFO L728 BuchiCegarLoop]: Abstraction has 314 states and 337 transitions. [2018-11-23 02:29:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:29:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:29:18,392 INFO L87 Difference]: Start difference. First operand 314 states and 337 transitions. Second operand 6 states. [2018-11-23 02:29:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:18,443 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2018-11-23 02:29:18,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:29:18,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215 states and 236 transitions. [2018-11-23 02:29:18,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 02:29:18,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215 states to 188 states and 209 transitions. [2018-11-23 02:29:18,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:18,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:18,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 209 transitions. [2018-11-23 02:29:18,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:18,447 INFO L705 BuchiCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-11-23 02:29:18,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 209 transitions. [2018-11-23 02:29:18,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2018-11-23 02:29:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 02:29:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-11-23 02:29:18,449 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-23 02:29:18,449 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-23 02:29:18,449 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 02:29:18,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 127 transitions. [2018-11-23 02:29:18,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2018-11-23 02:29:18,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:18,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:18,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:18,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2018-11-23 02:29:18,451 INFO L794 eck$LassoCheckResult]: Stem: 7379#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 7380#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7395#L12 assume !(10 == main_~i~0); 7389#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7388#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7382#L12 assume !(10 == main_~i~0); 7483#L12-2 assume !(0 == main_~i~0); 7482#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7481#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7480#L12 assume !(10 == main_~i~0); 7479#L12-2 assume !(0 == main_~i~0); 7478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7477#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7476#L12 assume !(10 == main_~i~0); 7475#L12-2 assume !(0 == main_~i~0); 7474#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7473#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7472#L12 assume !(10 == main_~i~0); 7471#L12-2 assume !(0 == main_~i~0); 7470#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7468#L12 assume !(10 == main_~i~0); 7467#L12-2 assume !(0 == main_~i~0); 7466#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7465#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7464#L12 assume !(10 == main_~i~0); 7463#L12-2 assume !(0 == main_~i~0); 7462#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7461#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7460#L12 assume !(10 == main_~i~0); 7459#L12-2 assume !(0 == main_~i~0); 7458#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7457#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7456#L12 assume !(10 == main_~i~0); 7455#L12-2 assume !(0 == main_~i~0); 7454#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7453#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7413#L12 assume !(10 == main_~i~0); 7451#L12-2 assume !(0 == main_~i~0); 7450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7398#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2018-11-23 02:29:18,451 INFO L796 eck$LassoCheckResult]: Loop: 7375#L12-2 assume !(0 == main_~i~0); 7376#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7410#L12 assume !(10 == main_~i~0); 7409#L12-2 assume !(0 == main_~i~0); 7408#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7407#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7406#L12 assume !(10 == main_~i~0); 7405#L12-2 assume !(0 == main_~i~0); 7404#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7403#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7402#L12 assume !(10 == main_~i~0); 7394#L12-2 assume !(0 == main_~i~0); 7397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 7396#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7391#L12 assume !(10 == main_~i~0); 7393#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 7449#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7385#L12 assume !(10 == main_~i~0); 7386#L12-2 assume !(0 == main_~i~0); 7390#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7446#L12 assume !(10 == main_~i~0); 7445#L12-2 assume !(0 == main_~i~0); 7444#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7443#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7442#L12 assume !(10 == main_~i~0); 7441#L12-2 assume !(0 == main_~i~0); 7440#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7438#L12 assume !(10 == main_~i~0); 7437#L12-2 assume !(0 == main_~i~0); 7436#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7435#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7434#L12 assume !(10 == main_~i~0); 7433#L12-2 assume !(0 == main_~i~0); 7432#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7430#L12 assume !(10 == main_~i~0); 7429#L12-2 assume !(0 == main_~i~0); 7428#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7427#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7426#L12 assume !(10 == main_~i~0); 7425#L12-2 assume !(0 == main_~i~0); 7424#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7422#L12 assume !(10 == main_~i~0); 7421#L12-2 assume !(0 == main_~i~0); 7420#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7419#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7418#L12 assume !(10 == main_~i~0); 7417#L12-2 assume !(0 == main_~i~0); 7416#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 7414#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 7415#L12 assume 10 == main_~i~0;main_~up~0 := 0; 7375#L12-2 [2018-11-23 02:29:18,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2018-11-23 02:29:18,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:18,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:18,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:18,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:18,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:18,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2018-11-23 02:29:18,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:18,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:18,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:18,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 4 times [2018-11-23 02:29:18,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:18,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:18,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:18,527 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-23 02:29:18,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:18,527 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:18,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:29:18,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:29:18,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:18,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:18,553 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-23 02:29:18,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:18,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 02:29:18,714 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 58 [2018-11-23 02:29:18,720 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:18,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:18,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:18,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:18,720 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:18,720 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:18,720 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:18,720 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:18,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-23 02:29:18,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:18,720 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:18,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,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-23 02:29:18,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,769 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:18,769 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:18,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:18,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:18,786 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:18,786 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:18,788 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:18,788 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:18,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:18,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:18,807 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:18,820 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:18,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:18,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:18,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:18,820 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:18,820 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:18,820 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:18,820 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:18,820 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration19_Loop [2018-11-23 02:29:18,820 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:18,820 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:18,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:18,862 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:18,862 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:18,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:29:18,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:18,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:18,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:18,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:18,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:18,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:18,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:18,869 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-23 02:29:18,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:18,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:18,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:18,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:18,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:18,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:18,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:18,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:18,872 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:18,872 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:18,872 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:18,872 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:18,872 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:18,872 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-23 02:29:18,872 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:18,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:18,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:18,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:18,941 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-23 02:29:18,941 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-23 02:29:18,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-23 02:29:19,050 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 127 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 511 states and 566 transitions. Complement of second has 23 states. [2018-11-23 02:29:19,057 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-23 02:29:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 02:29:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-23 02:29:19,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2018-11-23 02:29:19,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:19,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2018-11-23 02:29:19,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:19,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2018-11-23 02:29:19,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:19,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 511 states and 566 transitions. [2018-11-23 02:29:19,062 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-23 02:29:19,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 511 states to 410 states and 452 transitions. [2018-11-23 02:29:19,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-11-23 02:29:19,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:19,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 410 states and 452 transitions. [2018-11-23 02:29:19,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:19,064 INFO L705 BuchiCegarLoop]: Abstraction has 410 states and 452 transitions. [2018-11-23 02:29:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states and 452 transitions. [2018-11-23 02:29:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2018-11-23 02:29:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-11-23 02:29:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 347 transitions. [2018-11-23 02:29:19,068 INFO L728 BuchiCegarLoop]: Abstraction has 322 states and 347 transitions. [2018-11-23 02:29:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:29:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:29:19,069 INFO L87 Difference]: Start difference. First operand 322 states and 347 transitions. Second operand 7 states. [2018-11-23 02:29:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:19,103 INFO L93 Difference]: Finished difference Result 239 states and 264 transitions. [2018-11-23 02:29:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:29:19,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 239 states and 264 transitions. [2018-11-23 02:29:19,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-23 02:29:19,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 239 states to 204 states and 229 transitions. [2018-11-23 02:29:19,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:19,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:19,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 229 transitions. [2018-11-23 02:29:19,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:19,106 INFO L705 BuchiCegarLoop]: Abstraction has 204 states and 229 transitions. [2018-11-23 02:29:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 229 transitions. [2018-11-23 02:29:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 123. [2018-11-23 02:29:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-23 02:29:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2018-11-23 02:29:19,108 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-11-23 02:29:19,108 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 137 transitions. [2018-11-23 02:29:19,108 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 02:29:19,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 137 transitions. [2018-11-23 02:29:19,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2018-11-23 02:29:19,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:19,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:19,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:19,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2018-11-23 02:29:19,109 INFO L794 eck$LassoCheckResult]: Stem: 9219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 9220#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9235#L12 assume !(10 == main_~i~0); 9229#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9228#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9221#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9222#L12 assume !(10 == main_~i~0); 9327#L12-2 assume !(0 == main_~i~0); 9326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9324#L12 assume !(10 == main_~i~0); 9323#L12-2 assume !(0 == main_~i~0); 9322#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9321#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9320#L12 assume !(10 == main_~i~0); 9319#L12-2 assume !(0 == main_~i~0); 9318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9316#L12 assume !(10 == main_~i~0); 9315#L12-2 assume !(0 == main_~i~0); 9314#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9313#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9312#L12 assume !(10 == main_~i~0); 9311#L12-2 assume !(0 == main_~i~0); 9310#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9308#L12 assume !(10 == main_~i~0); 9307#L12-2 assume !(0 == main_~i~0); 9306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9304#L12 assume !(10 == main_~i~0); 9303#L12-2 assume !(0 == main_~i~0); 9302#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9300#L12 assume !(10 == main_~i~0); 9299#L12-2 assume !(0 == main_~i~0); 9298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9297#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9257#L12 assume !(10 == main_~i~0); 9295#L12-2 assume !(0 == main_~i~0); 9294#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9238#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2018-11-23 02:29:19,109 INFO L796 eck$LassoCheckResult]: Loop: 9215#L12-2 assume !(0 == main_~i~0); 9216#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9254#L12 assume !(10 == main_~i~0); 9253#L12-2 assume !(0 == main_~i~0); 9252#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9250#L12 assume !(10 == main_~i~0); 9249#L12-2 assume !(0 == main_~i~0); 9248#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9247#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9246#L12 assume !(10 == main_~i~0); 9245#L12-2 assume !(0 == main_~i~0); 9244#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9243#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9242#L12 assume !(10 == main_~i~0); 9234#L12-2 assume !(0 == main_~i~0); 9237#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 9236#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9231#L12 assume !(10 == main_~i~0); 9233#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 9293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9225#L12 assume !(10 == main_~i~0); 9226#L12-2 assume !(0 == main_~i~0); 9230#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9290#L12 assume !(10 == main_~i~0); 9289#L12-2 assume !(0 == main_~i~0); 9288#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9287#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9286#L12 assume !(10 == main_~i~0); 9285#L12-2 assume !(0 == main_~i~0); 9284#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9283#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9282#L12 assume !(10 == main_~i~0); 9281#L12-2 assume !(0 == main_~i~0); 9280#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9279#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9278#L12 assume !(10 == main_~i~0); 9277#L12-2 assume !(0 == main_~i~0); 9276#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9275#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9274#L12 assume !(10 == main_~i~0); 9273#L12-2 assume !(0 == main_~i~0); 9272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9270#L12 assume !(10 == main_~i~0); 9269#L12-2 assume !(0 == main_~i~0); 9268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9266#L12 assume !(10 == main_~i~0); 9265#L12-2 assume !(0 == main_~i~0); 9264#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9262#L12 assume !(10 == main_~i~0); 9261#L12-2 assume !(0 == main_~i~0); 9260#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 9258#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 9259#L12 assume 10 == main_~i~0;main_~up~0 := 0; 9215#L12-2 [2018-11-23 02:29:19,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2018-11-23 02:29:19,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:19,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:19,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2018-11-23 02:29:19,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:19,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:19,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:19,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 5 times [2018-11-23 02:29:19,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:19,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:19,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:19,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:19,200 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-23 02:29:19,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:19,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:19,206 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 02:29:19,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 02:29:19,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:19,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:19,229 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-23 02:29:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:19,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 02:29:19,410 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 58 [2018-11-23 02:29:19,414 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:19,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:19,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:19,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:19,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:19,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:19,415 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:19,415 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:19,415 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-23 02:29:19,415 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:19,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:19,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:19,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:19,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:19,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:19,456 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:19,456 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:19,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:19,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:19,473 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:19,473 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_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:19,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:19,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:19,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:19,478 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:19,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:19,492 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:19,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:19,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:19,511 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:19,524 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:19,524 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:19,524 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:19,524 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:19,524 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:19,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:19,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:19,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:19,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration20_Loop [2018-11-23 02:29:19,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:19,524 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:19,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:19,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-23 02:29:19,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-23 02:29:19,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:19,559 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:19,559 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:19,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 02:29:19,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:19,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:19,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:19,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:19,560 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:19,560 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:19,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:19,562 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-23 02:29:19,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:19,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:19,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:19,562 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:29:19,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:19,563 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:29:19,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:19,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:19,564 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-23 02:29:19,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:19,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:19,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:19,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:19,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:19,565 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:19,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:19,566 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:19,566 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:19,567 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:19,567 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:19,567 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:19,567 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:19,567 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-23 02:29:19,567 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:19,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:19,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:19,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:19,685 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-23 02:29:19,685 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-23 02:29:19,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17 Second operand 9 states. [2018-11-23 02:29:19,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 137 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 607 states and 682 transitions. Complement of second has 27 states. [2018-11-23 02:29:19,901 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-23 02:29:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 02:29:19,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2018-11-23 02:29:19,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2018-11-23 02:29:19,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:19,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2018-11-23 02:29:19,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:19,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2018-11-23 02:29:19,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:19,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 607 states and 682 transitions. [2018-11-23 02:29:19,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2018-11-23 02:29:19,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 607 states to 462 states and 516 transitions. [2018-11-23 02:29:19,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-23 02:29:19,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:19,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 462 states and 516 transitions. [2018-11-23 02:29:19,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:19,905 INFO L705 BuchiCegarLoop]: Abstraction has 462 states and 516 transitions. [2018-11-23 02:29:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states and 516 transitions. [2018-11-23 02:29:19,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 330. [2018-11-23 02:29:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-23 02:29:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 357 transitions. [2018-11-23 02:29:19,910 INFO L728 BuchiCegarLoop]: Abstraction has 330 states and 357 transitions. [2018-11-23 02:29:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:29:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:29:19,910 INFO L87 Difference]: Start difference. First operand 330 states and 357 transitions. Second operand 8 states. [2018-11-23 02:29:19,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:19,937 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-11-23 02:29:19,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:29:19,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 292 transitions. [2018-11-23 02:29:19,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-23 02:29:19,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 220 states and 249 transitions. [2018-11-23 02:29:19,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:19,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:19,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 249 transitions. [2018-11-23 02:29:19,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:19,940 INFO L705 BuchiCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-11-23 02:29:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 249 transitions. [2018-11-23 02:29:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 131. [2018-11-23 02:29:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 02:29:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-11-23 02:29:19,942 INFO L728 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-11-23 02:29:19,942 INFO L608 BuchiCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-11-23 02:29:19,942 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 02:29:19,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 147 transitions. [2018-11-23 02:29:19,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2018-11-23 02:29:19,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:19,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:19,946 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:19,946 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2018-11-23 02:29:19,946 INFO L794 eck$LassoCheckResult]: Stem: 11228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 11229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11240#L12 assume !(10 == main_~i~0); 11238#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11237#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11230#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11231#L12 assume !(10 == main_~i~0); 11340#L12-2 assume !(0 == main_~i~0); 11339#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11337#L12 assume !(10 == main_~i~0); 11336#L12-2 assume !(0 == main_~i~0); 11335#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11333#L12 assume !(10 == main_~i~0); 11332#L12-2 assume !(0 == main_~i~0); 11331#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11329#L12 assume !(10 == main_~i~0); 11328#L12-2 assume !(0 == main_~i~0); 11327#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11326#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11325#L12 assume !(10 == main_~i~0); 11324#L12-2 assume !(0 == main_~i~0); 11323#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11322#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11321#L12 assume !(10 == main_~i~0); 11320#L12-2 assume !(0 == main_~i~0); 11319#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11317#L12 assume !(10 == main_~i~0); 11316#L12-2 assume !(0 == main_~i~0); 11315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11314#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11313#L12 assume !(10 == main_~i~0); 11312#L12-2 assume !(0 == main_~i~0); 11311#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11270#L12 assume !(10 == main_~i~0); 11308#L12-2 assume !(0 == main_~i~0); 11307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11269#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11247#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2018-11-23 02:29:19,946 INFO L796 eck$LassoCheckResult]: Loop: 11224#L12-2 assume !(0 == main_~i~0); 11225#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11268#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11267#L12 assume !(10 == main_~i~0); 11266#L12-2 assume !(0 == main_~i~0); 11265#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11264#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11263#L12 assume !(10 == main_~i~0); 11262#L12-2 assume !(0 == main_~i~0); 11261#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11260#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11259#L12 assume !(10 == main_~i~0); 11258#L12-2 assume !(0 == main_~i~0); 11257#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11256#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11255#L12 assume !(10 == main_~i~0); 11254#L12-2 assume !(0 == main_~i~0); 11253#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11252#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11251#L12 assume !(10 == main_~i~0); 11244#L12-2 assume !(0 == main_~i~0); 11246#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 11245#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11241#L12 assume !(10 == main_~i~0); 11243#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 11306#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11304#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11234#L12 assume !(10 == main_~i~0); 11235#L12-2 assume !(0 == main_~i~0); 11239#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11305#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11303#L12 assume !(10 == main_~i~0); 11302#L12-2 assume !(0 == main_~i~0); 11301#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11300#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11299#L12 assume !(10 == main_~i~0); 11298#L12-2 assume !(0 == main_~i~0); 11297#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11296#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11295#L12 assume !(10 == main_~i~0); 11294#L12-2 assume !(0 == main_~i~0); 11293#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11291#L12 assume !(10 == main_~i~0); 11290#L12-2 assume !(0 == main_~i~0); 11289#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11288#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11287#L12 assume !(10 == main_~i~0); 11286#L12-2 assume !(0 == main_~i~0); 11285#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11284#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11283#L12 assume !(10 == main_~i~0); 11282#L12-2 assume !(0 == main_~i~0); 11281#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11280#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11279#L12 assume !(10 == main_~i~0); 11278#L12-2 assume !(0 == main_~i~0); 11277#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11276#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11275#L12 assume !(10 == main_~i~0); 11274#L12-2 assume !(0 == main_~i~0); 11273#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 11271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 11272#L12 assume 10 == main_~i~0;main_~up~0 := 0; 11224#L12-2 [2018-11-23 02:29:19,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2018-11-23 02:29:19,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:19,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:19,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:19,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2018-11-23 02:29:19,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:19,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:19,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:19,964 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 6 times [2018-11-23 02:29:19,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:19,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:20,011 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-23 02:29:20,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:20,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:20,017 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 02:29:20,039 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-11-23 02:29:20,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:20,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:20,046 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-23 02:29:20,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:20,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 02:29:20,237 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 62 [2018-11-23 02:29:20,242 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:20,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:20,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:20,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:20,242 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:20,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:20,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:20,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:20,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-23 02:29:20,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:20,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:20,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:20,283 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:20,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:20,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:20,289 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:20,289 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:20,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:20,304 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:20,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:20,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:20,415 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:20,416 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:20,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:20,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:20,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:20,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:20,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:20,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:20,416 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:20,416 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration21_Loop [2018-11-23 02:29:20,416 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:20,416 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:20,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:20,456 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:20,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:20,456 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-23 02:29:20,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:20,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:20,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:20,457 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:29:20,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:20,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:29:20,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:20,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:20,459 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-23 02:29:20,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:20,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:20,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:20,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:20,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:20,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:20,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:20,460 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:20,461 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:20,461 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:20,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:20,462 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:20,462 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:20,462 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-23 02:29:20,462 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:20,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:20,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:20,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:20,543 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-23 02:29:20,543 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-23 02:29:20,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19 Second operand 10 states. [2018-11-23 02:29:20,714 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 147 transitions. cyclomatic complexity: 19. Second operand 10 states. Result 719 states and 818 transitions. Complement of second has 31 states. [2018-11-23 02:29:20,714 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-23 02:29:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 02:29:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2018-11-23 02:29:20,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2018-11-23 02:29:20,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:20,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2018-11-23 02:29:20,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:20,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2018-11-23 02:29:20,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:20,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 719 states and 818 transitions. [2018-11-23 02:29:20,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2018-11-23 02:29:20,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 719 states to 522 states and 590 transitions. [2018-11-23 02:29:20,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-23 02:29:20,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:20,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 590 transitions. [2018-11-23 02:29:20,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:20,721 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 590 transitions. [2018-11-23 02:29:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 590 transitions. [2018-11-23 02:29:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 338. [2018-11-23 02:29:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-23 02:29:20,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 367 transitions. [2018-11-23 02:29:20,726 INFO L728 BuchiCegarLoop]: Abstraction has 338 states and 367 transitions. [2018-11-23 02:29:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:29:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:29:20,726 INFO L87 Difference]: Start difference. First operand 338 states and 367 transitions. Second operand 9 states. [2018-11-23 02:29:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:20,782 INFO L93 Difference]: Finished difference Result 287 states and 320 transitions. [2018-11-23 02:29:20,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:29:20,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 287 states and 320 transitions. [2018-11-23 02:29:20,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2018-11-23 02:29:20,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 287 states to 236 states and 269 transitions. [2018-11-23 02:29:20,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:20,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:20,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 269 transitions. [2018-11-23 02:29:20,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:20,786 INFO L705 BuchiCegarLoop]: Abstraction has 236 states and 269 transitions. [2018-11-23 02:29:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 269 transitions. [2018-11-23 02:29:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 139. [2018-11-23 02:29:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 02:29:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2018-11-23 02:29:20,788 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-11-23 02:29:20,788 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 157 transitions. [2018-11-23 02:29:20,788 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 02:29:20,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 157 transitions. [2018-11-23 02:29:20,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-23 02:29:20,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:20,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:20,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:20,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2018-11-23 02:29:20,794 INFO L794 eck$LassoCheckResult]: Stem: 13422#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 13423#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13434#L12 assume !(10 == main_~i~0); 13432#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13431#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13425#L12 assume !(10 == main_~i~0); 13538#L12-2 assume !(0 == main_~i~0); 13537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13535#L12 assume !(10 == main_~i~0); 13534#L12-2 assume !(0 == main_~i~0); 13533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13531#L12 assume !(10 == main_~i~0); 13530#L12-2 assume !(0 == main_~i~0); 13529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13527#L12 assume !(10 == main_~i~0); 13526#L12-2 assume !(0 == main_~i~0); 13525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13523#L12 assume !(10 == main_~i~0); 13522#L12-2 assume !(0 == main_~i~0); 13521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13520#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13519#L12 assume !(10 == main_~i~0); 13518#L12-2 assume !(0 == main_~i~0); 13517#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13516#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13515#L12 assume !(10 == main_~i~0); 13514#L12-2 assume !(0 == main_~i~0); 13513#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13512#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13511#L12 assume !(10 == main_~i~0); 13510#L12-2 assume !(0 == main_~i~0); 13509#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13508#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13468#L12 assume !(10 == main_~i~0); 13506#L12-2 assume !(0 == main_~i~0); 13505#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13467#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13441#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2018-11-23 02:29:20,794 INFO L796 eck$LassoCheckResult]: Loop: 13418#L12-2 assume !(0 == main_~i~0); 13419#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13465#L12 assume !(10 == main_~i~0); 13464#L12-2 assume !(0 == main_~i~0); 13463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13461#L12 assume !(10 == main_~i~0); 13460#L12-2 assume !(0 == main_~i~0); 13459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13457#L12 assume !(10 == main_~i~0); 13456#L12-2 assume !(0 == main_~i~0); 13455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13453#L12 assume !(10 == main_~i~0); 13452#L12-2 assume !(0 == main_~i~0); 13451#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13450#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13449#L12 assume !(10 == main_~i~0); 13448#L12-2 assume !(0 == main_~i~0); 13447#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13446#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13445#L12 assume !(10 == main_~i~0); 13438#L12-2 assume !(0 == main_~i~0); 13440#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13439#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13435#L12 assume !(10 == main_~i~0); 13437#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13504#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13428#L12 assume !(10 == main_~i~0); 13429#L12-2 assume !(0 == main_~i~0); 13433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13503#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13501#L12 assume !(10 == main_~i~0); 13500#L12-2 assume !(0 == main_~i~0); 13499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13497#L12 assume !(10 == main_~i~0); 13496#L12-2 assume !(0 == main_~i~0); 13495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13493#L12 assume !(10 == main_~i~0); 13492#L12-2 assume !(0 == main_~i~0); 13491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13489#L12 assume !(10 == main_~i~0); 13488#L12-2 assume !(0 == main_~i~0); 13487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13486#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13485#L12 assume !(10 == main_~i~0); 13484#L12-2 assume !(0 == main_~i~0); 13483#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13481#L12 assume !(10 == main_~i~0); 13480#L12-2 assume !(0 == main_~i~0); 13479#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13477#L12 assume !(10 == main_~i~0); 13476#L12-2 assume !(0 == main_~i~0); 13475#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13473#L12 assume !(10 == main_~i~0); 13472#L12-2 assume !(0 == main_~i~0); 13471#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13470#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13418#L12-2 [2018-11-23 02:29:20,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2018-11-23 02:29:20,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:20,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:20,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:20,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:20,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:20,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2018-11-23 02:29:20,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:20,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:20,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:20,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 7 times [2018-11-23 02:29:20,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:20,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:20,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:20,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:20,887 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-23 02:29:20,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:20,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:20,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:20,930 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-23 02:29:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 02:29:21,138 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 64 [2018-11-23 02:29:21,142 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:21,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:21,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:21,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:21,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:21,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:21,142 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:21,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:21,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-23 02:29:21,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:21,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:21,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-23 02:29:21,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-23 02:29:21,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:21,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:21,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:21,180 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:21,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:21,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:21,197 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:21,197 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:21,200 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:21,200 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:21,214 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:21,214 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_21=1} Honda state: {v_rep~unnamed0~0~true_21=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:21,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:21,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:21,220 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:21,220 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:21,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:21,235 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:21,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:21,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:21,253 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:21,266 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:21,266 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:21,266 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:21,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:21,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:21,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:21,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:21,267 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:21,267 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration22_Loop [2018-11-23 02:29:21,267 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:21,267 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:21,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:21,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:21,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:21,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:21,301 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:21,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:21,301 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-23 02:29:21,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:21,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:21,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:21,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:21,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:21,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:21,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:21,303 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-23 02:29:21,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:21,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:21,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:21,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:21,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:21,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:21,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:21,305 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-23 02:29:21,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:21,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:21,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:21,306 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 02:29:21,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:21,306 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 02:29:21,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:21,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:21,307 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-23 02:29:21,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:21,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:21,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:21,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:21,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:21,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:21,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:21,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:21,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:21,310 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:21,310 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:21,310 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:21,310 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:21,311 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-23 02:29:21,311 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:21,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:21,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:21,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:21,465 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-23 02:29:21,466 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-23 02:29:21,466 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21 Second operand 11 states. [2018-11-23 02:29:21,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 157 transitions. cyclomatic complexity: 21. Second operand 11 states. Result 847 states and 974 transitions. Complement of second has 35 states. [2018-11-23 02:29:21,865 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-23 02:29:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 02:29:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2018-11-23 02:29:21,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2018-11-23 02:29:21,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:21,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2018-11-23 02:29:21,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:21,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2018-11-23 02:29:21,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:21,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 847 states and 974 transitions. [2018-11-23 02:29:21,873 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2018-11-23 02:29:21,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 847 states to 590 states and 674 transitions. [2018-11-23 02:29:21,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 02:29:21,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:21,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 674 transitions. [2018-11-23 02:29:21,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:21,876 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 674 transitions. [2018-11-23 02:29:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 674 transitions. [2018-11-23 02:29:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 346. [2018-11-23 02:29:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-11-23 02:29:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 377 transitions. [2018-11-23 02:29:21,883 INFO L728 BuchiCegarLoop]: Abstraction has 346 states and 377 transitions. [2018-11-23 02:29:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:29:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:29:21,883 INFO L87 Difference]: Start difference. First operand 346 states and 377 transitions. Second operand 10 states. [2018-11-23 02:29:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:21,940 INFO L93 Difference]: Finished difference Result 311 states and 348 transitions. [2018-11-23 02:29:21,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:29:21,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 311 states and 348 transitions. [2018-11-23 02:29:21,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2018-11-23 02:29:21,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 311 states to 252 states and 289 transitions. [2018-11-23 02:29:21,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:21,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:21,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 289 transitions. [2018-11-23 02:29:21,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:21,943 INFO L705 BuchiCegarLoop]: Abstraction has 252 states and 289 transitions. [2018-11-23 02:29:21,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 289 transitions. [2018-11-23 02:29:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 147. [2018-11-23 02:29:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-23 02:29:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2018-11-23 02:29:21,945 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-23 02:29:21,945 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 167 transitions. [2018-11-23 02:29:21,946 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 02:29:21,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 167 transitions. [2018-11-23 02:29:21,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2018-11-23 02:29:21,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:21,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:21,947 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:21,947 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2018-11-23 02:29:21,947 INFO L794 eck$LassoCheckResult]: Stem: 15817#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 15818#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15829#L12 assume !(10 == main_~i~0); 15827#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15826#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15819#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15820#L12 assume !(10 == main_~i~0); 15937#L12-2 assume !(0 == main_~i~0); 15936#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15935#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15934#L12 assume !(10 == main_~i~0); 15933#L12-2 assume !(0 == main_~i~0); 15932#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15931#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15930#L12 assume !(10 == main_~i~0); 15929#L12-2 assume !(0 == main_~i~0); 15928#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15927#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15926#L12 assume !(10 == main_~i~0); 15925#L12-2 assume !(0 == main_~i~0); 15924#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15923#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15922#L12 assume !(10 == main_~i~0); 15921#L12-2 assume !(0 == main_~i~0); 15920#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15919#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15918#L12 assume !(10 == main_~i~0); 15917#L12-2 assume !(0 == main_~i~0); 15916#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15915#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15914#L12 assume !(10 == main_~i~0); 15913#L12-2 assume !(0 == main_~i~0); 15912#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15911#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15910#L12 assume !(10 == main_~i~0); 15909#L12-2 assume !(0 == main_~i~0); 15908#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15907#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15869#L12 assume !(10 == main_~i~0); 15905#L12-2 assume !(0 == main_~i~0); 15904#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15868#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15836#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2018-11-23 02:29:21,947 INFO L796 eck$LassoCheckResult]: Loop: 15813#L12-2 assume !(0 == main_~i~0); 15814#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15865#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15864#L12 assume !(10 == main_~i~0); 15863#L12-2 assume !(0 == main_~i~0); 15862#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15860#L12 assume !(10 == main_~i~0); 15859#L12-2 assume !(0 == main_~i~0); 15858#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15857#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15856#L12 assume !(10 == main_~i~0); 15855#L12-2 assume !(0 == main_~i~0); 15854#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15853#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15852#L12 assume !(10 == main_~i~0); 15851#L12-2 assume !(0 == main_~i~0); 15850#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15849#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15848#L12 assume !(10 == main_~i~0); 15847#L12-2 assume !(0 == main_~i~0); 15846#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15844#L12 assume !(10 == main_~i~0); 15843#L12-2 assume !(0 == main_~i~0); 15842#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15841#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15840#L12 assume !(10 == main_~i~0); 15833#L12-2 assume !(0 == main_~i~0); 15835#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15834#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15830#L12 assume !(10 == main_~i~0); 15832#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15903#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15901#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15823#L12 assume !(10 == main_~i~0); 15824#L12-2 assume !(0 == main_~i~0); 15828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15902#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15900#L12 assume !(10 == main_~i~0); 15899#L12-2 assume !(0 == main_~i~0); 15898#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15897#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15896#L12 assume !(10 == main_~i~0); 15895#L12-2 assume !(0 == main_~i~0); 15894#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15893#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15892#L12 assume !(10 == main_~i~0); 15891#L12-2 assume !(0 == main_~i~0); 15890#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15889#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15888#L12 assume !(10 == main_~i~0); 15887#L12-2 assume !(0 == main_~i~0); 15886#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15885#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15884#L12 assume !(10 == main_~i~0); 15883#L12-2 assume !(0 == main_~i~0); 15882#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15881#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15880#L12 assume !(10 == main_~i~0); 15879#L12-2 assume !(0 == main_~i~0); 15878#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15877#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15876#L12 assume !(10 == main_~i~0); 15875#L12-2 assume !(0 == main_~i~0); 15874#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15873#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15872#L12 assume !(10 == main_~i~0); 15871#L12-2 assume !(0 == main_~i~0); 15870#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15866#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15867#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15813#L12-2 [2018-11-23 02:29:21,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2018-11-23 02:29:21,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:21,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:29:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:21,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2018-11-23 02:29:21,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:21,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:21,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 8 times [2018-11-23 02:29:21,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:21,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:21,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:21,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:21,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:22,058 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-23 02:29:22,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:22,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:22,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:29:22,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:29:22,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:22,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:22,106 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-23 02:29:22,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:22,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 02:29:22,366 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 67 [2018-11-23 02:29:22,371 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:22,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:22,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:22,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:22,371 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:22,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:22,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:22,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:22,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-23 02:29:22,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:22,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:22,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,408 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:22,408 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:22,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:22,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:22,425 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 02:29:22,426 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_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:22,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:22,429 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:22,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:22,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:22,448 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:22,461 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:22,461 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:22,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:22,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:22,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:22,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:22,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:22,462 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:22,462 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration23_Loop [2018-11-23 02:29:22,462 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:22,462 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:22,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,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-23 02:29:22,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:22,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:22,495 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:22,495 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-23 02:29:22,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:22,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:22,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:22,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:22,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:22,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:22,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:22,497 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-23 02:29:22,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:22,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:22,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:22,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:22,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:22,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:22,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:22,499 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:22,500 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:22,500 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:22,500 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:22,500 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:22,500 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:22,500 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-23 02:29:22,501 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:22,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:22,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:22,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:22,594 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-23 02:29:22,594 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-23 02:29:22,594 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23 Second operand 12 states. [2018-11-23 02:29:22,855 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 147 states and 167 transitions. cyclomatic complexity: 23. Second operand 12 states. Result 992 states and 1151 transitions. Complement of second has 39 states. [2018-11-23 02:29:22,856 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-23 02:29:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 02:29:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2018-11-23 02:29:22,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2018-11-23 02:29:22,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:22,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2018-11-23 02:29:22,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:22,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2018-11-23 02:29:22,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:22,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1151 transitions. [2018-11-23 02:29:22,862 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2018-11-23 02:29:22,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 667 states and 769 transitions. [2018-11-23 02:29:22,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-23 02:29:22,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-23 02:29:22,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 769 transitions. [2018-11-23 02:29:22,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:22,864 INFO L705 BuchiCegarLoop]: Abstraction has 667 states and 769 transitions. [2018-11-23 02:29:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 769 transitions. [2018-11-23 02:29:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 354. [2018-11-23 02:29:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-23 02:29:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 387 transitions. [2018-11-23 02:29:22,870 INFO L728 BuchiCegarLoop]: Abstraction has 354 states and 387 transitions. [2018-11-23 02:29:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:29:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:29:22,870 INFO L87 Difference]: Start difference. First operand 354 states and 387 transitions. Second operand 11 states. [2018-11-23 02:29:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:22,927 INFO L93 Difference]: Finished difference Result 335 states and 376 transitions. [2018-11-23 02:29:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:29:22,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 376 transitions. [2018-11-23 02:29:22,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-23 02:29:22,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 268 states and 309 transitions. [2018-11-23 02:29:22,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:22,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:22,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 309 transitions. [2018-11-23 02:29:22,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:22,931 INFO L705 BuchiCegarLoop]: Abstraction has 268 states and 309 transitions. [2018-11-23 02:29:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 309 transitions. [2018-11-23 02:29:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 155. [2018-11-23 02:29:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-23 02:29:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 177 transitions. [2018-11-23 02:29:22,933 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-11-23 02:29:22,933 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 177 transitions. [2018-11-23 02:29:22,933 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 02:29:22,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 177 transitions. [2018-11-23 02:29:22,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2018-11-23 02:29:22,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:22,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:22,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:22,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2018-11-23 02:29:22,934 INFO L794 eck$LassoCheckResult]: Stem: 18430#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 18431#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18442#L12 assume !(10 == main_~i~0); 18440#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18439#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18433#L12 assume !(10 == main_~i~0); 18554#L12-2 assume !(0 == main_~i~0); 18553#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18552#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18551#L12 assume !(10 == main_~i~0); 18550#L12-2 assume !(0 == main_~i~0); 18549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18548#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18547#L12 assume !(10 == main_~i~0); 18546#L12-2 assume !(0 == main_~i~0); 18545#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18544#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18543#L12 assume !(10 == main_~i~0); 18542#L12-2 assume !(0 == main_~i~0); 18541#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18540#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18539#L12 assume !(10 == main_~i~0); 18538#L12-2 assume !(0 == main_~i~0); 18537#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18536#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18535#L12 assume !(10 == main_~i~0); 18534#L12-2 assume !(0 == main_~i~0); 18533#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18532#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18531#L12 assume !(10 == main_~i~0); 18530#L12-2 assume !(0 == main_~i~0); 18529#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18528#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18527#L12 assume !(10 == main_~i~0); 18526#L12-2 assume !(0 == main_~i~0); 18525#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18524#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18484#L12 assume !(10 == main_~i~0); 18522#L12-2 assume !(0 == main_~i~0); 18521#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18483#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18449#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2018-11-23 02:29:22,934 INFO L796 eck$LassoCheckResult]: Loop: 18426#L12-2 assume !(0 == main_~i~0); 18427#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18482#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18481#L12 assume !(10 == main_~i~0); 18480#L12-2 assume !(0 == main_~i~0); 18479#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18477#L12 assume !(10 == main_~i~0); 18476#L12-2 assume !(0 == main_~i~0); 18475#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18473#L12 assume !(10 == main_~i~0); 18472#L12-2 assume !(0 == main_~i~0); 18471#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18470#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18469#L12 assume !(10 == main_~i~0); 18468#L12-2 assume !(0 == main_~i~0); 18467#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18465#L12 assume !(10 == main_~i~0); 18464#L12-2 assume !(0 == main_~i~0); 18463#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18461#L12 assume !(10 == main_~i~0); 18460#L12-2 assume !(0 == main_~i~0); 18459#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18457#L12 assume !(10 == main_~i~0); 18456#L12-2 assume !(0 == main_~i~0); 18455#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18453#L12 assume !(10 == main_~i~0); 18446#L12-2 assume !(0 == main_~i~0); 18448#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18447#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18443#L12 assume !(10 == main_~i~0); 18445#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18520#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18518#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18436#L12 assume !(10 == main_~i~0); 18437#L12-2 assume !(0 == main_~i~0); 18441#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18519#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18517#L12 assume !(10 == main_~i~0); 18516#L12-2 assume !(0 == main_~i~0); 18515#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18514#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18513#L12 assume !(10 == main_~i~0); 18512#L12-2 assume !(0 == main_~i~0); 18511#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18510#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18509#L12 assume !(10 == main_~i~0); 18508#L12-2 assume !(0 == main_~i~0); 18507#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18506#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18505#L12 assume !(10 == main_~i~0); 18504#L12-2 assume !(0 == main_~i~0); 18503#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18502#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18501#L12 assume !(10 == main_~i~0); 18500#L12-2 assume !(0 == main_~i~0); 18499#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18498#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18497#L12 assume !(10 == main_~i~0); 18496#L12-2 assume !(0 == main_~i~0); 18495#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18494#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18493#L12 assume !(10 == main_~i~0); 18492#L12-2 assume !(0 == main_~i~0); 18491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18489#L12 assume !(10 == main_~i~0); 18488#L12-2 assume !(0 == main_~i~0); 18487#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18485#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18486#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18426#L12-2 [2018-11-23 02:29:22,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2018-11-23 02:29:22,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:22,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:22,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:22,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:22,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:22,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:22,942 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2018-11-23 02:29:22,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:22,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:22,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:22,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:22,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 9 times [2018-11-23 02:29:22,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:22,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:22,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:22,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:23,018 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-23 02:29:23,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:29:23,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:29:23,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:29:23,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-11-23 02:29:23,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:23,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:23,092 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-23 02:29:23,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:23,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 02:29:23,334 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 70 [2018-11-23 02:29:23,338 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:23,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:23,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:23,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:23,338 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 02:29:23,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:23,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:23,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:23,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-23 02:29:23,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:23,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:23,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,373 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:23,373 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:23,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 02:29:23,375 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/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-23 02:29:23,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 02:29:23,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 02:29:23,394 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 02:29:23,407 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 02:29:23,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 02:29:23,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 02:29:23,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 02:29:23,407 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 02:29:23,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 02:29:23,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 02:29:23,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 02:29:23,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: UpAndDown_false-termination_true-no-overflow.c_Iteration24_Loop [2018-11-23 02:29:23,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 02:29:23,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 02:29:23,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 02:29:23,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 02:29:23,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 02:29:23,451 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-23 02:29:23,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:23,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:23,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:23,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:23,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 02:29:23,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 02:29:23,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 02:29:23,453 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-23 02:29:23,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 02:29:23,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 02:29:23,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 02:29:23,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 02:29:23,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 02:29:23,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 02:29:23,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 02:29:23,455 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 02:29:23,456 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 02:29:23,456 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 02:29:23,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 02:29:23,456 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 02:29:23,456 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 02:29:23,456 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-23 02:29:23,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 02:29:23,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:23,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:29:23,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:23,624 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-23 02:29:23,624 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-23 02:29:23,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25 Second operand 13 states. [2018-11-23 02:29:24,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 155 states and 177 transitions. cyclomatic complexity: 25. Second operand 13 states. Result 1168 states and 1366 transitions. Complement of second has 43 states. [2018-11-23 02:29:24,109 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-23 02:29:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 02:29:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 98 transitions. [2018-11-23 02:29:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 76 letters. [2018-11-23 02:29:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 119 letters. Loop has 76 letters. [2018-11-23 02:29:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 152 letters. [2018-11-23 02:29:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 02:29:24,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1168 states and 1366 transitions. [2018-11-23 02:29:24,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2018-11-23 02:29:24,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1168 states to 767 states and 892 transitions. [2018-11-23 02:29:24,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-23 02:29:24,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2018-11-23 02:29:24,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 767 states and 892 transitions. [2018-11-23 02:29:24,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:24,118 INFO L705 BuchiCegarLoop]: Abstraction has 767 states and 892 transitions. [2018-11-23 02:29:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states and 892 transitions. [2018-11-23 02:29:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 376. [2018-11-23 02:29:24,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-23 02:29:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 413 transitions. [2018-11-23 02:29:24,124 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 413 transitions. [2018-11-23 02:29:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:29:24,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:29:24,125 INFO L87 Difference]: Start difference. First operand 376 states and 413 transitions. Second operand 12 states. [2018-11-23 02:29:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:24,203 INFO L93 Difference]: Finished difference Result 359 states and 404 transitions. [2018-11-23 02:29:24,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:29:24,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 404 transitions. [2018-11-23 02:29:24,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2018-11-23 02:29:24,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 284 states and 329 transitions. [2018-11-23 02:29:24,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-23 02:29:24,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 02:29:24,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 329 transitions. [2018-11-23 02:29:24,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 02:29:24,209 INFO L705 BuchiCegarLoop]: Abstraction has 284 states and 329 transitions. [2018-11-23 02:29:24,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 329 transitions. [2018-11-23 02:29:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 163. [2018-11-23 02:29:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-23 02:29:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 187 transitions. [2018-11-23 02:29:24,213 INFO L728 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2018-11-23 02:29:24,213 INFO L608 BuchiCegarLoop]: Abstraction has 163 states and 187 transitions. [2018-11-23 02:29:24,213 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 02:29:24,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163 states and 187 transitions. [2018-11-23 02:29:24,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-23 02:29:24,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 02:29:24,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 02:29:24,214 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2018-11-23 02:29:24,214 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2018-11-23 02:29:24,215 INFO L794 eck$LassoCheckResult]: Stem: 21306#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~up~0;havoc main_~i~0;havoc main_~up~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~up~0 := 0; 21307#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21318#L12 assume !(10 == main_~i~0); 21316#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21315#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21308#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21309#L12 assume !(10 == main_~i~0); 21434#L12-2 assume !(0 == main_~i~0); 21433#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21432#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21431#L12 assume !(10 == main_~i~0); 21430#L12-2 assume !(0 == main_~i~0); 21429#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21427#L12 assume !(10 == main_~i~0); 21426#L12-2 assume !(0 == main_~i~0); 21425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21423#L12 assume !(10 == main_~i~0); 21422#L12-2 assume !(0 == main_~i~0); 21421#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21420#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21419#L12 assume !(10 == main_~i~0); 21418#L12-2 assume !(0 == main_~i~0); 21417#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21416#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21415#L12 assume !(10 == main_~i~0); 21414#L12-2 assume !(0 == main_~i~0); 21413#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21412#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21411#L12 assume !(10 == main_~i~0); 21410#L12-2 assume !(0 == main_~i~0); 21409#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21408#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21407#L12 assume !(10 == main_~i~0); 21406#L12-2 assume !(0 == main_~i~0); 21405#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21404#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21366#L12 assume !(10 == main_~i~0); 21402#L12-2 assume !(0 == main_~i~0); 21401#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21325#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2018-11-23 02:29:24,215 INFO L796 eck$LassoCheckResult]: Loop: 21302#L12-2 assume !(0 == main_~i~0); 21303#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21361#L12 assume !(10 == main_~i~0); 21360#L12-2 assume !(0 == main_~i~0); 21359#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21358#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21357#L12 assume !(10 == main_~i~0); 21356#L12-2 assume !(0 == main_~i~0); 21355#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21354#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21353#L12 assume !(10 == main_~i~0); 21352#L12-2 assume !(0 == main_~i~0); 21351#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21350#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21349#L12 assume !(10 == main_~i~0); 21348#L12-2 assume !(0 == main_~i~0); 21347#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21346#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21345#L12 assume !(10 == main_~i~0); 21344#L12-2 assume !(0 == main_~i~0); 21343#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21342#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21341#L12 assume !(10 == main_~i~0); 21340#L12-2 assume !(0 == main_~i~0); 21339#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21337#L12 assume !(10 == main_~i~0); 21336#L12-2 assume !(0 == main_~i~0); 21335#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21333#L12 assume !(10 == main_~i~0); 21332#L12-2 assume !(0 == main_~i~0); 21331#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21329#L12 assume !(10 == main_~i~0); 21322#L12-2 assume !(0 == main_~i~0); 21324#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21323#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21319#L12 assume !(10 == main_~i~0); 21321#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21400#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21398#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21312#L12 assume !(10 == main_~i~0); 21313#L12-2 assume !(0 == main_~i~0); 21317#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21399#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21397#L12 assume !(10 == main_~i~0); 21396#L12-2 assume !(0 == main_~i~0); 21395#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21393#L12 assume !(10 == main_~i~0); 21392#L12-2 assume !(0 == main_~i~0); 21391#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21390#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21389#L12 assume !(10 == main_~i~0); 21388#L12-2 assume !(0 == main_~i~0); 21387#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21385#L12 assume !(10 == main_~i~0); 21384#L12-2 assume !(0 == main_~i~0); 21383#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21381#L12 assume !(10 == main_~i~0); 21380#L12-2 assume !(0 == main_~i~0); 21379#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21377#L12 assume !(10 == main_~i~0); 21376#L12-2 assume !(0 == main_~i~0); 21375#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21374#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21373#L12 assume !(10 == main_~i~0); 21372#L12-2 assume !(0 == main_~i~0); 21371#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21369#L12 assume !(10 == main_~i~0); 21368#L12-2 assume !(0 == main_~i~0); 21367#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21363#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21364#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21302#L12-2 [2018-11-23 02:29:24,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:24,215 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 17 times [2018-11-23 02:29:24,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:24,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:24,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:24,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash -312487543, now seen corresponding path program 17 times [2018-11-23 02:29:24,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:24,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:24,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:24,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 799661767, now seen corresponding path program 10 times [2018-11-23 02:29:24,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:29:24,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:29:24,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:24,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:29:24,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:29:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:29:24,535 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 73 ----- 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); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [?] 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [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 ----- [2018-11-23 02:29:24,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 02:29:24 BoogieIcfgContainer [2018-11-23 02:29:24,766 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 02:29:24,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:29:24,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:29:24,766 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:29:24,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:29:13" (3/4) ... [2018-11-23 02:29:24,768 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); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [?] 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [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 ----- [2018-11-23 02:29:25,561 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b0cd0b04-96cf-4086-95f6-d540557cac40/bin-2019/uautomizer/witness.graphml [2018-11-23 02:29:25,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:29:25,562 INFO L168 Benchmark]: Toolchain (without parser) took 12839.58 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -163.1 MB). Peak memory consumption was 143.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:29:25,563 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:29:25,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.74 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:29:25,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:29:25,567 INFO L168 Benchmark]: Boogie Preprocessor took 10.68 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:29:25,567 INFO L168 Benchmark]: RCFGBuilder took 149.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:29:25,567 INFO L168 Benchmark]: BuchiAutomizer took 11716.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.9 MB). Peak memory consumption was 449.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:29:25,568 INFO L168 Benchmark]: Witness Printer took 795.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:29:25,569 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.74 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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.14 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.68 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 149.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -179.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11716.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -5.9 MB). Peak memory consumption was 449.6 MB. Max. memory is 11.5 GB. * Witness Printer took 795.63 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 35 terminating modules (22 trivial, 12 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + 6 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 163 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 25 iterations. TraceHistogramMax:20. Analysis of lassos took 7.4s. Construction of modules took 1.1s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 34. Automata minimization 0.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 2269 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 163 states and ocurred in iteration 24. Nontrivial modules had stage [12, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1368/3680 HoareTripleCheckerStatistics: 262 SDtfs, 787 SDslu, 9 SDs, 0 SdLazy, 2168 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT9 SILN0 SILU0 SILI10 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax175 hnf100 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf92 smp94 dnf134 smp100 tf108 neg93 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {up=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7857e1d4=0, \result=0, i=10} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: 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); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [?] 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [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 ----- ----- 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); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [?] 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- 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); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [?] 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- 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)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume 0 == main_~i~0;main_~up~0 := 1; [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume !(10 == main_~i~0); [?] assume !(0 == main_~i~0); [?] assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; [?] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [?] assume 10 == main_~i~0;main_~up~0 := 0; [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume !(1 == main_~up~0); [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume 0 == main_~i~0; [L16] main_~up~0 := 1; [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume !(10 == main_~i~0); [L15-L17] assume !(0 == main_~i~0); [L18-L22] assume 1 == main_~up~0; [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] assume !!(0 <= main_~i~0 && main_~i~0 <= 10); [L12-L14] assume 10 == main_~i~0; [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND FALSE !(1 == main_~up~0) [L21] main_~i~0 := main_~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND TRUE 0 == main_~i~0 [L16] main_~up~0 := 1; [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND FALSE !(10 == main_~i~0) [L15] COND FALSE !(0 == main_~i~0) [L18] COND TRUE 1 == main_~up~0 [L19] main_~i~0 := 1 + main_~i~0; [L11-L23] COND FALSE !(!(0 <= main_~i~0 && main_~i~0 <= 10)) [L12] COND TRUE 10 == main_~i~0 [L13] main_~up~0 := 0; [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND FALSE !(1 == ~up~0) [L21] ~i~0 := ~i~0 - 1; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND TRUE 0 == ~i~0 [L16] ~up~0 := 1; [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND FALSE !(10 == ~i~0) [L15] COND FALSE !(0 == ~i~0) [L18] COND TRUE 1 == ~up~0 [L19] ~i~0 := 1 + ~i~0; [L11-L23] COND FALSE !(!(0 <= ~i~0 && ~i~0 <= 10)) [L12] COND TRUE 10 == ~i~0 [L13] ~up~0 := 0; [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [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 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...