./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/UpAndDown.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.25-9a8b2e8 [2020-10-20 06:36:07,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:36:07,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:36:07,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:36:07,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:36:07,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:36:07,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:36:07,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:36:07,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:36:07,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:36:07,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:36:07,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:36:07,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:36:07,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:36:07,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:36:07,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:36:07,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:36:07,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:36:07,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:36:07,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:36:07,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:36:07,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:36:07,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:36:07,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:36:07,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:36:07,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:36:07,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:36:07,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:36:07,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:36:07,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:36:07,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:36:07,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:36:07,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:36:07,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:36:07,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:36:07,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:36:07,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:36:07,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:36:07,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:36:07,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:36:07,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:36:07,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-20 06:36:08,019 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:36:08,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:36:08,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:36:08,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:36:08,022 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:36:08,023 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 06:36:08,023 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 06:36:08,023 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 06:36:08,023 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 06:36:08,023 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 06:36:08,024 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 06:36:08,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:36:08,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:36:08,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:36:08,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:36:08,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 06:36:08,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 06:36:08,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 06:36:08,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 06:36:08,026 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 06:36:08,027 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:36:08,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 06:36:08,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:36:08,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:36:08,027 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 06:36:08,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:36:08,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:36:08,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:36:08,028 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 06:36:08,030 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 06:36:08,030 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2020-10-20 06:36:08,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:36:08,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:36:08,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:36:08,252 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:36:08,252 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:36:08,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2020-10-20 06:36:08,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e7fb936/bbcc85a6d43849bca573df895984b5c5/FLAG473c1f395 [2020-10-20 06:36:08,825 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:36:08,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDown.c [2020-10-20 06:36:08,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e7fb936/bbcc85a6d43849bca573df895984b5c5/FLAG473c1f395 [2020-10-20 06:36:09,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e7fb936/bbcc85a6d43849bca573df895984b5c5 [2020-10-20 06:36:09,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:36:09,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 06:36:09,269 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:36:09,269 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:36:09,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:36:09,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5596cb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09, skipping insertion in model container [2020-10-20 06:36:09,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:36:09,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:36:09,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:36:09,497 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:36:09,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:36:09,531 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:36:09,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09 WrapperNode [2020-10-20 06:36:09,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:36:09,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 06:36:09,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 06:36:09,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 06:36:09,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 06:36:09,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:36:09,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:36:09,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:36:09,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... [2020-10-20 06:36:09,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:36:09,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:36:09,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:36:09,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:36:09,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:09,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:36:09,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:36:09,806 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:36:09,806 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-20 06:36:09,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:36:09 BoogieIcfgContainer [2020-10-20 06:36:09,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:36:09,809 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 06:36:09,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 06:36:09,813 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 06:36:09,814 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:36:09,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 06:36:09" (1/3) ... [2020-10-20 06:36:09,816 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@276fecdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:36:09, skipping insertion in model container [2020-10-20 06:36:09,816 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:36:09,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:36:09" (2/3) ... [2020-10-20 06:36:09,817 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@276fecdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 06:36:09, skipping insertion in model container [2020-10-20 06:36:09,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 06:36:09,818 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:36:09" (3/3) ... [2020-10-20 06:36:09,828 INFO L373 chiAutomizerObserver]: Analyzing ICFG UpAndDown.c [2020-10-20 06:36:09,875 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 06:36:09,876 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 06:36:09,876 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 06:36:09,876 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:36:09,876 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:36:09,876 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 06:36:09,876 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:36:09,876 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 06:36:09,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-10-20 06:36:09,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:36:09,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:09,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:09,914 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:36:09,914 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:09,914 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 06:36:09,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-10-20 06:36:09,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 06:36:09,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:09,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:09,916 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:36:09,916 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:09,922 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 [2020-10-20 06:36:09,923 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 [2020-10-20 06:36:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:09,928 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-10-20 06:36:09,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:09,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596624814] [2020-10-20 06:36:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,017 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,039 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1234538, now seen corresponding path program 1 times [2020-10-20 06:36:10,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:10,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415698142] [2020-10-20 06:36:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:10,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415698142] [2020-10-20 06:36:10,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:10,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:10,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048775068] [2020-10-20 06:36:10,122 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:10,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:10,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:36:10,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:36:10,143 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-10-20 06:36:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:10,208 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-10-20 06:36:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:36:10,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. [2020-10-20 06:36:10,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:36:10,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 9 states and 14 transitions. [2020-10-20 06:36:10,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 06:36:10,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-20 06:36:10,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2020-10-20 06:36:10,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 06:36:10,221 INFO L691 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-10-20 06:36:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2020-10-20 06:36:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-20 06:36:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:36:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-10-20 06:36:10,259 INFO L714 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-10-20 06:36:10,259 INFO L594 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-10-20 06:36:10,259 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 06:36:10,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-10-20 06:36:10,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-20 06:36:10,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:10,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:10,262 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-10-20 06:36:10,262 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:10,262 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 [2020-10-20 06:36:10,263 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 [2020-10-20 06:36:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:10,263 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-10-20 06:36:10,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:10,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178124005] [2020-10-20 06:36:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,270 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,275 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1234602, now seen corresponding path program 1 times [2020-10-20 06:36:10,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:10,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784020467] [2020-10-20 06:36:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,301 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:10,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:10,302 INFO L82 PathProgramCache]: Analyzing trace with hash 29863753, now seen corresponding path program 1 times [2020-10-20 06:36:10,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:10,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246824646] [2020-10-20 06:36:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,316 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:10,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:10,334 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:10,443 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:10,444 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:10,444 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:10,444 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:10,444 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:10,444 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:10,444 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:10,444 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:10,445 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2020-10-20 06:36:10,445 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:10,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:10,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,582 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:10,583 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:10,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:10,592 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:10,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:10,603 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:10,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:10,642 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:10,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:10,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:10,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:10,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:10,676 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:10,676 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:10,708 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:10,708 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:10,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:10,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:10,763 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:10,796 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:10,796 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:10,796 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:10,796 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:10,797 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:10,797 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:10,797 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:10,797 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:10,797 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration2_Loop [2020-10-20 06:36:10,797 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:10,797 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:10,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:10,939 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:10,944 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:10,949 INFO L120 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 [2020-10-20 06:36:10,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:10,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:10,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:10,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:10,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:10,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:10,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:10,993 INFO L120 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 [2020-10-20 06:36:10,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:10,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:10,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:10,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:10,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:11,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:11,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:11,037 INFO L120 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 [2020-10-20 06:36:11,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:11,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:11,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:11,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:11,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:11,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:11,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:11,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:11,095 INFO L120 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 [2020-10-20 06:36:11,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:11,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:11,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:11,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:11,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:11,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:11,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:11,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:11,112 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:11,112 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:11,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:11,131 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:11,132 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:11,132 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:11,156 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:11,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:11,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:11,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:11,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:11,226 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:36:11,227 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-10-20 06:36:11,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 14 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 24 states and 37 transitions. Complement of second has 7 states. [2020-10-20 06:36:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-10-20 06:36:11,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2020-10-20 06:36:11,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-20 06:36:11,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:11,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 1 letters. Loop has 8 letters. [2020-10-20 06:36:11,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:11,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 37 transitions. [2020-10-20 06:36:11,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 06:36:11,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 37 transitions. [2020-10-20 06:36:11,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 06:36:11,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 06:36:11,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 37 transitions. [2020-10-20 06:36:11,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:11,337 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 37 transitions. [2020-10-20 06:36:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 37 transitions. [2020-10-20 06:36:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-10-20 06:36:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-20 06:36:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2020-10-20 06:36:11,341 INFO L714 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-10-20 06:36:11,341 INFO L594 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2020-10-20 06:36:11,341 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 06:36:11,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-10-20 06:36:11,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 06:36:11,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:11,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:11,343 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:36:11,344 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:11,344 INFO L794 eck$LassoCheckResult]: Stem: 111#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; 112#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 122#L12 [2020-10-20 06:36:11,344 INFO L796 eck$LassoCheckResult]: Loop: 122#L12 assume !(10 == main_~i~0); 125#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 128#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 126#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 122#L12 [2020-10-20 06:36:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-10-20 06:36:11,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:11,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712664157] [2020-10-20 06:36:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,353 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:11,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:11,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1389492, now seen corresponding path program 1 times [2020-10-20 06:36:11,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:11,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653211081] [2020-10-20 06:36:11,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:11,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653211081] [2020-10-20 06:36:11,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:11,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:11,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907148905] [2020-10-20 06:36:11,369 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:11,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:36:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:36:11,370 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 15 Second operand 3 states. [2020-10-20 06:36:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:11,382 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2020-10-20 06:36:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:36:11,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2020-10-20 06:36:11,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-10-20 06:36:11,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 43 transitions. [2020-10-20 06:36:11,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-10-20 06:36:11,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 06:36:11,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2020-10-20 06:36:11,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:11,386 INFO L691 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-10-20 06:36:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2020-10-20 06:36:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-10-20 06:36:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 06:36:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-10-20 06:36:11,391 INFO L714 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-20 06:36:11,391 INFO L594 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-10-20 06:36:11,391 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 06:36:11,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-10-20 06:36:11,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-10-20 06:36:11,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:11,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:11,394 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 06:36:11,394 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:11,394 INFO L794 eck$LassoCheckResult]: Stem: 171#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; 172#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 177#L12 [2020-10-20 06:36:11,394 INFO L796 eck$LassoCheckResult]: Loop: 177#L12 assume !(10 == main_~i~0); 178#L12-2 assume !(0 == main_~i~0); 188#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 187#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 177#L12 [2020-10-20 06:36:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 2 times [2020-10-20 06:36:11,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:11,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301157061] [2020-10-20 06:36:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,402 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,403 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1391414, now seen corresponding path program 1 times [2020-10-20 06:36:11,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:11,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907111771] [2020-10-20 06:36:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:11,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash 925835935, now seen corresponding path program 1 times [2020-10-20 06:36:11,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:11,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001714507] [2020-10-20 06:36:11,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,423 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:11,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:11,429 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:11,485 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:11,485 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:11,485 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:11,485 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:11,486 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:11,486 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:11,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:11,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:11,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2020-10-20 06:36:11,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:11,486 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:11,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:11,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:11,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:11,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:11,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:11,612 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:11,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:11,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:11,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:11,624 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:11,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:11,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:11,678 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:11,678 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:11,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:11,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:11,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:11,733 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0=-8} Honda state: {ULTIMATE.start_main_~up~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:11,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:11,782 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:11,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:11,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:12,001 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:12,003 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:12,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:12,004 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:12,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:12,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:12,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:12,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:12,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration4_Loop [2020-10-20 06:36:12,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:12,005 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:12,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,105 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:12,105 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:12,114 INFO L120 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 [2020-10-20 06:36:12,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:12,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:12,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:12,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:12,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:12,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:12,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,164 INFO L120 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 [2020-10-20 06:36:12,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:12,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:12,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:12,167 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:12,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:12,168 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:12,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:12,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:12,219 INFO L120 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 [2020-10-20 06:36:12,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:12,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:12,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:12,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:12,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:12,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:12,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:12,293 INFO L120 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 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:12,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:12,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:12,296 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:12,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:12,298 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:12,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:12,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:12,306 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:12,306 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:12,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:12,327 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:12,327 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:12,327 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,370 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:12,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:12,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:12,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:12,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:12,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:12,438 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 [2020-10-20 06:36:12,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-10-20 06:36:12,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 43 states and 59 transitions. Complement of second has 7 states. [2020-10-20 06:36:12,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-20 06:36:12,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 06:36:12,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:12,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-10-20 06:36:12,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:12,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2020-10-20 06:36:12,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:12,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 59 transitions. [2020-10-20 06:36:12,477 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 06:36:12,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 33 states and 48 transitions. [2020-10-20 06:36:12,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 06:36:12,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-20 06:36:12,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2020-10-20 06:36:12,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:12,480 INFO L691 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-10-20 06:36:12,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2020-10-20 06:36:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2020-10-20 06:36:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 06:36:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-10-20 06:36:12,485 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-10-20 06:36:12,485 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-10-20 06:36:12,485 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 06:36:12,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2020-10-20 06:36:12,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 06:36:12,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:12,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:12,487 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-20 06:36:12,487 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:12,487 INFO L794 eck$LassoCheckResult]: Stem: 283#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; 284#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 289#L12 assume 10 == main_~i~0;main_~up~0 := 0; 279#L12-2 [2020-10-20 06:36:12,488 INFO L796 eck$LassoCheckResult]: Loop: 279#L12-2 assume !(0 == main_~i~0); 280#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 285#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 286#L12 assume !(10 == main_~i~0); 279#L12-2 [2020-10-20 06:36:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-10-20 06:36:12,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:12,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564964400] [2020-10-20 06:36:12,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:12,494 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:12,497 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:12,498 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:12,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:12,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1573482, now seen corresponding path program 1 times [2020-10-20 06:36:12,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:12,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430493151] [2020-10-20 06:36:12,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:12,505 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:12,509 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:12,510 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:12,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1365706036, now seen corresponding path program 1 times [2020-10-20 06:36:12,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:12,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94685143] [2020-10-20 06:36:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:12,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:12,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94685143] [2020-10-20 06:36:12,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:12,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:12,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081742012] [2020-10-20 06:36:12,556 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:12,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:12,556 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:12,556 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:12,557 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:12,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:12,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:12,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2020-10-20 06:36:12,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:12,558 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:12,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,779 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:12,779 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:12,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:12,784 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:12,790 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:12,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:12,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:12,820 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,842 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:12,843 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:12,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:12,930 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:12,932 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:12,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:12,933 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:12,933 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:12,933 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:12,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:12,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:12,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:12,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration5_Loop [2020-10-20 06:36:12,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:12,933 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:12,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:12,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,078 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:13,079 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:13,083 INFO L120 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 [2020-10-20 06:36:13,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:13,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:13,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:13,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:13,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:13,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:13,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,116 INFO L120 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 [2020-10-20 06:36:13,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:13,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:13,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:13,117 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:13,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:13,119 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:13,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:13,123 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:13,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:13,126 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,130 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:13,130 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:13,131 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:13,131 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2020-10-20 06:36:13,151 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:13,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:13,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:13,209 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:13,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:13,240 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 [2020-10-20 06:36:13,241 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-20 06:36:13,313 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 78 states and 116 transitions. Complement of second has 9 states. [2020-10-20 06:36:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:36:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-10-20 06:36:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-20 06:36:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-20 06:36:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 3 letters. Loop has 8 letters. [2020-10-20 06:36:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:13,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 116 transitions. [2020-10-20 06:36:13,319 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2020-10-20 06:36:13,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 77 states and 115 transitions. [2020-10-20 06:36:13,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-20 06:36:13,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2020-10-20 06:36:13,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 115 transitions. [2020-10-20 06:36:13,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:13,322 INFO L691 BuchiCegarLoop]: Abstraction has 77 states and 115 transitions. [2020-10-20 06:36:13,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 115 transitions. [2020-10-20 06:36:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2020-10-20 06:36:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 06:36:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 98 transitions. [2020-10-20 06:36:13,329 INFO L714 BuchiCegarLoop]: Abstraction has 63 states and 98 transitions. [2020-10-20 06:36:13,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 06:36:13,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 06:36:13,330 INFO L87 Difference]: Start difference. First operand 63 states and 98 transitions. Second operand 3 states. [2020-10-20 06:36:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:13,337 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2020-10-20 06:36:13,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 06:36:13,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 60 transitions. [2020-10-20 06:36:13,339 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 06:36:13,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 37 states and 50 transitions. [2020-10-20 06:36:13,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 06:36:13,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-10-20 06:36:13,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2020-10-20 06:36:13,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:13,341 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2020-10-20 06:36:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2020-10-20 06:36:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2020-10-20 06:36:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:36:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-10-20 06:36:13,343 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 06:36:13,344 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-10-20 06:36:13,344 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 06:36:13,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-10-20 06:36:13,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-20 06:36:13,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:13,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:13,345 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:36:13,345 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:13,345 INFO L794 eck$LassoCheckResult]: Stem: 546#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; 547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 557#L12 assume !(10 == main_~i~0); 553#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 558#L15-1 [2020-10-20 06:36:13,345 INFO L796 eck$LassoCheckResult]: Loop: 558#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 559#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 563#L12 assume !(10 == main_~i~0); 560#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 558#L15-1 [2020-10-20 06:36:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 1 times [2020-10-20 06:36:13,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572860344] [2020-10-20 06:36:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,354 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,355 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1678390, now seen corresponding path program 1 times [2020-10-20 06:36:13,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418475430] [2020-10-20 06:36:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,363 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,367 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash 668197123, now seen corresponding path program 1 times [2020-10-20 06:36:13,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67049263] [2020-10-20 06:36:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:13,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67049263] [2020-10-20 06:36:13,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:13,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:13,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973648342] [2020-10-20 06:36:13,418 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:13,419 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:13,419 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:13,419 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:13,419 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:13,419 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,419 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:13,419 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:13,419 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2020-10-20 06:36:13,419 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:13,419 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:13,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,502 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:13,502 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:13,510 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:13,510 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:13,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:13,610 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:13,612 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:13,613 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:13,613 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:13,613 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:13,613 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:13,613 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,613 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:13,613 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:13,613 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration6_Loop [2020-10-20 06:36:13,613 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:13,613 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,682 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:13,682 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:13,689 INFO L120 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 [2020-10-20 06:36:13,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:13,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:13,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:13,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:13,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:13,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:13,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:13,707 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 06:36:13,707 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:13,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:13,719 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:13,719 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:13,719 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,746 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:13,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:13,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:13,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:13,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:13,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:13,802 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 [2020-10-20 06:36:13,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-10-20 06:36:13,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 33 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 51 states and 68 transitions. Complement of second has 7 states. [2020-10-20 06:36:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 06:36:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-10-20 06:36:13,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-20 06:36:13,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:13,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-20 06:36:13,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:13,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 4 letters. Loop has 8 letters. [2020-10-20 06:36:13,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:13,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 68 transitions. [2020-10-20 06:36:13,860 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2020-10-20 06:36:13,861 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 49 states and 65 transitions. [2020-10-20 06:36:13,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 06:36:13,862 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-10-20 06:36:13,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2020-10-20 06:36:13,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:13,862 INFO L691 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2020-10-20 06:36:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2020-10-20 06:36:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2020-10-20 06:36:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-20 06:36:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 60 transitions. [2020-10-20 06:36:13,866 INFO L714 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2020-10-20 06:36:13,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:13,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:36:13,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:36:13,867 INFO L87 Difference]: Start difference. First operand 44 states and 60 transitions. Second operand 4 states. [2020-10-20 06:36:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:13,890 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-10-20 06:36:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:36:13,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 59 transitions. [2020-10-20 06:36:13,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2020-10-20 06:36:13,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 47 transitions. [2020-10-20 06:36:13,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-10-20 06:36:13,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-10-20 06:36:13,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 47 transitions. [2020-10-20 06:36:13,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:13,894 INFO L691 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2020-10-20 06:36:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 47 transitions. [2020-10-20 06:36:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2020-10-20 06:36:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 06:36:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-10-20 06:36:13,896 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-10-20 06:36:13,897 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-10-20 06:36:13,897 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 06:36:13,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2020-10-20 06:36:13,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-10-20 06:36:13,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:13,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:13,898 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 06:36:13,898 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:13,898 INFO L794 eck$LassoCheckResult]: Stem: 761#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; 762#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 774#L12 assume !(10 == main_~i~0); 770#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 758#L15-1 [2020-10-20 06:36:13,898 INFO L796 eck$LassoCheckResult]: Loop: 758#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 767#L12 assume !(10 == main_~i~0); 757#L12-2 assume !(0 == main_~i~0); 758#L15-1 [2020-10-20 06:36:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2020-10-20 06:36:13,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398308763] [2020-10-20 06:36:13,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,917 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1678392, now seen corresponding path program 2 times [2020-10-20 06:36:13,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168032443] [2020-10-20 06:36:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,934 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:13,939 INFO L82 PathProgramCache]: Analyzing trace with hash 668197125, now seen corresponding path program 1 times [2020-10-20 06:36:13,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:13,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677736692] [2020-10-20 06:36:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:13,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:13,965 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:13,985 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:13,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:13,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:13,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:13,986 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:13,986 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:13,986 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:13,986 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:13,986 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2020-10-20 06:36:13,986 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:13,986 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:13,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:13,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,085 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:14,086 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,094 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:14,097 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,097 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:14,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:14,148 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,148 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,170 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:14,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:14,307 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:14,308 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:14,308 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:14,308 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:14,308 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:14,309 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:14,309 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,309 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:14,309 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:14,309 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration7_Loop [2020-10-20 06:36:14,309 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:14,309 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:14,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,387 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:14,387 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,391 INFO L120 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 [2020-10-20 06:36:14,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:14,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:14,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:14,445 INFO L120 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 [2020-10-20 06:36:14,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:14,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:14,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:14,490 INFO L120 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 [2020-10-20 06:36:14,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:14,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:14,532 INFO L120 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 [2020-10-20 06:36:14,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:14,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:14,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:14,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:14,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:14,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:14,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:14,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:14,541 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:14,541 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:14,543 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:14,544 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:14,544 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:14,544 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2020-10-20 06:36:14,564 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:14,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,588 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:14,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:14,633 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 [2020-10-20 06:36:14,633 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-10-20 06:36:14,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 48 states and 62 transitions. Complement of second has 9 states. [2020-10-20 06:36:14,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 06:36:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-10-20 06:36:14,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 4 letters. [2020-10-20 06:36:14,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:14,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 8 letters. Loop has 4 letters. [2020-10-20 06:36:14,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:14,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 8 letters. [2020-10-20 06:36:14,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:14,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 62 transitions. [2020-10-20 06:36:14,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 06:36:14,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 59 transitions. [2020-10-20 06:36:14,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-10-20 06:36:14,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-20 06:36:14,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 59 transitions. [2020-10-20 06:36:14,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:14,704 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2020-10-20 06:36:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 59 transitions. [2020-10-20 06:36:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-10-20 06:36:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 06:36:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2020-10-20 06:36:14,708 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-10-20 06:36:14,708 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2020-10-20 06:36:14,708 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 06:36:14,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-10-20 06:36:14,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-10-20 06:36:14,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:14,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:14,709 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 06:36:14,709 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-10-20 06:36:14,709 INFO L794 eck$LassoCheckResult]: Stem: 886#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; 887#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 898#L12 assume !(10 == main_~i~0); 902#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 899#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 888#L18-1 [2020-10-20 06:36:14,709 INFO L796 eck$LassoCheckResult]: Loop: 888#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 889#L12 assume 10 == main_~i~0;main_~up~0 := 0; 892#L12-2 assume !(0 == main_~i~0); 895#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 896#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 922#L12 assume !(10 == main_~i~0); 917#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 905#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 888#L18-1 [2020-10-20 06:36:14,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash 29865611, now seen corresponding path program 2 times [2020-10-20 06:36:14,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474996051] [2020-10-20 06:36:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2014853141, now seen corresponding path program 1 times [2020-10-20 06:36:14,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416860193] [2020-10-20 06:36:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416860193] [2020-10-20 06:36:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383478119] [2020-10-20 06:36:14,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-10-20 06:36:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 06:36:14,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:14,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:14,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:14,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-20 06:36:14,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768036018] [2020-10-20 06:36:14,805 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:14,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:36:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:36:14,806 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 18 Second operand 4 states. [2020-10-20 06:36:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:14,840 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-10-20 06:36:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:36:14,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2020-10-20 06:36:14,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-20 06:36:14,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 48 states and 61 transitions. [2020-10-20 06:36:14,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 06:36:14,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-10-20 06:36:14,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2020-10-20 06:36:14,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:14,843 INFO L691 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2020-10-20 06:36:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2020-10-20 06:36:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2020-10-20 06:36:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 06:36:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2020-10-20 06:36:14,846 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-10-20 06:36:14,846 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2020-10-20 06:36:14,846 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 06:36:14,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2020-10-20 06:36:14,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:36:14,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:14,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:14,848 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-10-20 06:36:14,848 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:14,848 INFO L794 eck$LassoCheckResult]: Stem: 1010#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; 1011#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1026#L12 assume !(10 == main_~i~0); 1023#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1019#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1021#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1016#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1006#L12-2 [2020-10-20 06:36:14,848 INFO L796 eck$LassoCheckResult]: Loop: 1006#L12-2 assume !(0 == main_~i~0); 1007#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1012#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1013#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1006#L12-2 [2020-10-20 06:36:14,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1363918578, now seen corresponding path program 1 times [2020-10-20 06:36:14,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438940456] [2020-10-20 06:36:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:14,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:14,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438940456] [2020-10-20 06:36:14,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:36:14,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:36:14,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914089967] [2020-10-20 06:36:14,866 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 2 times [2020-10-20 06:36:14,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:14,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966036701] [2020-10-20 06:36:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:14,872 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:14,873 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:14,895 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:14,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:14,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:14,896 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:14,896 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:14,896 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:14,896 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:14,896 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:14,896 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration9_Loop [2020-10-20 06:36:14,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:14,896 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:14,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:14,985 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:14,986 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:14,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:14,991 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:14,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:14,995 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:15,021 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:15,021 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:15,047 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:15,047 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,071 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:15,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:15,117 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,219 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:15,220 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:15,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:15,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:15,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:15,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:15,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:15,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:15,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration9_Loop [2020-10-20 06:36:15,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:15,221 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:15,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,306 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:15,307 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,309 INFO L120 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 [2020-10-20 06:36:15,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:15,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:15,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:15,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:15,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:15,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:15,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,339 INFO L120 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 [2020-10-20 06:36:15,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:15,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:15,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:15,342 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:15,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:15,343 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:15,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:15,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:15,370 INFO L120 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 [2020-10-20 06:36:15,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:15,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:15,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:15,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:15,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:15,374 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,399 INFO L120 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 [2020-10-20 06:36:15,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:15,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:15,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:15,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:15,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:15,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:15,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:15,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:15,406 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 06:36:15,406 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:15,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:15,409 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:15,409 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:15,429 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:15,472 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 [2020-10-20 06:36:15,473 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-10-20 06:36:15,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 86 states and 109 transitions. Complement of second has 7 states. [2020-10-20 06:36:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 06:36:15,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-20 06:36:15,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-20 06:36:15,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2020-10-20 06:36:15,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:15,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 109 transitions. [2020-10-20 06:36:15,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-10-20 06:36:15,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 67 states and 85 transitions. [2020-10-20 06:36:15,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 06:36:15,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 06:36:15,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 85 transitions. [2020-10-20 06:36:15,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:15,516 INFO L691 BuchiCegarLoop]: Abstraction has 67 states and 85 transitions. [2020-10-20 06:36:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 85 transitions. [2020-10-20 06:36:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2020-10-20 06:36:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-20 06:36:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 77 transitions. [2020-10-20 06:36:15,520 INFO L714 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2020-10-20 06:36:15,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:15,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:36:15,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:36:15,520 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand 4 states. [2020-10-20 06:36:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:15,543 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2020-10-20 06:36:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:36:15,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 96 transitions. [2020-10-20 06:36:15,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-10-20 06:36:15,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 75 states and 92 transitions. [2020-10-20 06:36:15,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-10-20 06:36:15,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2020-10-20 06:36:15,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 92 transitions. [2020-10-20 06:36:15,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:15,547 INFO L691 BuchiCegarLoop]: Abstraction has 75 states and 92 transitions. [2020-10-20 06:36:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 92 transitions. [2020-10-20 06:36:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2020-10-20 06:36:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 06:36:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2020-10-20 06:36:15,551 INFO L714 BuchiCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-10-20 06:36:15,551 INFO L594 BuchiCegarLoop]: Abstraction has 63 states and 78 transitions. [2020-10-20 06:36:15,551 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 06:36:15,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 78 transitions. [2020-10-20 06:36:15,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-10-20 06:36:15,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:15,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:15,553 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 3, 2, 2, 2, 1, 1] [2020-10-20 06:36:15,553 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 06:36:15,553 INFO L794 eck$LassoCheckResult]: Stem: 1330#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; 1331#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1355#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1363#L12-2 assume !(0 == main_~i~0); 1362#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1361#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1360#L12 assume !(10 == main_~i~0); 1354#L12-2 assume !(0 == main_~i~0); 1359#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1358#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1353#L12 assume !(10 == main_~i~0); 1348#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 1349#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1334#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1335#L12 assume !(10 == main_~i~0); 1327#L12-2 assume !(0 == main_~i~0); 1329#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 1384#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1344#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1345#L12-2 [2020-10-20 06:36:15,553 INFO L796 eck$LassoCheckResult]: Loop: 1345#L12-2 assume !(0 == main_~i~0); 1376#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 1375#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 1346#L12 assume 10 == main_~i~0;main_~up~0 := 0; 1345#L12-2 [2020-10-20 06:36:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash -976997301, now seen corresponding path program 1 times [2020-10-20 06:36:15,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115638702] [2020-10-20 06:36:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:36:15,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115638702] [2020-10-20 06:36:15,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037141061] [2020-10-20 06:36:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:15,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:15,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 06:36:15,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:15,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:36:15,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625708399] [2020-10-20 06:36:15,658 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:15,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1575402, now seen corresponding path program 3 times [2020-10-20 06:36:15,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:15,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130850704] [2020-10-20 06:36:15,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:15,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:15,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:15,705 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:15,705 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:15,705 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:15,705 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:15,706 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:15,706 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,706 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:15,706 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:15,706 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2020-10-20 06:36:15,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:15,706 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:15,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,790 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:15,791 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,796 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:15,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:15,800 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:15,823 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:15,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:15,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:15,955 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:15,956 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:15,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:15,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:15,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:15,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:15,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:15,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:15,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:15,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration10_Loop [2020-10-20 06:36:15,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:15,957 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:15,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:15,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:16,040 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:16,040 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:16,048 INFO L120 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 [2020-10-20 06:36:16,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:16,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,050 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:16,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,051 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:16,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:16,083 INFO L120 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 [2020-10-20 06:36:16,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:16,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:16,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:16,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:16,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:16,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:16,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:16,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:16,092 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:16,092 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-20 06:36:16,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:16,097 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:16,097 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:16,097 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 06:36:16,119 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,163 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 [2020-10-20 06:36:16,164 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 78 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-10-20 06:36:16,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 78 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 89 states and 110 transitions. Complement of second has 7 states. [2020-10-20 06:36:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-10-20 06:36:16,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 06:36:16,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,201 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:36:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 06:36:16,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 78 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-10-20 06:36:16,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 78 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 108 states and 129 transitions. Complement of second has 7 states. [2020-10-20 06:36:16,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-10-20 06:36:16,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 06:36:16,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,292 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 06:36:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,351 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 2 loop predicates [2020-10-20 06:36:16,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 78 transitions. cyclomatic complexity: 22 Second operand 4 states. [2020-10-20 06:36:16,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 78 transitions. cyclomatic complexity: 22. Second operand 4 states. Result 97 states and 122 transitions. Complement of second has 8 states. [2020-10-20 06:36:16,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 06:36:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-10-20 06:36:16,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 4 letters. [2020-10-20 06:36:16,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 23 letters. Loop has 4 letters. [2020-10-20 06:36:16,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 8 letters. [2020-10-20 06:36:16,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:16,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 122 transitions. [2020-10-20 06:36:16,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-10-20 06:36:16,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 70 states and 86 transitions. [2020-10-20 06:36:16,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-10-20 06:36:16,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-10-20 06:36:16,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 86 transitions. [2020-10-20 06:36:16,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:16,398 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-10-20 06:36:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 86 transitions. [2020-10-20 06:36:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 41. [2020-10-20 06:36:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 06:36:16,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2020-10-20 06:36:16,404 INFO L714 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-10-20 06:36:16,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:16,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:36:16,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:36:16,405 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 5 states. [2020-10-20 06:36:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:16,438 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2020-10-20 06:36:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:36:16,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 75 transitions. [2020-10-20 06:36:16,440 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 06:36:16,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 60 states and 73 transitions. [2020-10-20 06:36:16,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 06:36:16,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 06:36:16,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 73 transitions. [2020-10-20 06:36:16,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:16,441 INFO L691 BuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2020-10-20 06:36:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 73 transitions. [2020-10-20 06:36:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2020-10-20 06:36:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-20 06:36:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2020-10-20 06:36:16,445 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-10-20 06:36:16,445 INFO L594 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-10-20 06:36:16,445 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 06:36:16,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2020-10-20 06:36:16,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2020-10-20 06:36:16,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:16,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:16,447 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2020-10-20 06:36:16,447 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 3, 2, 1, 1] [2020-10-20 06:36:16,447 INFO L794 eck$LassoCheckResult]: Stem: 2094#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; 2095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2110#L12 assume !(10 == main_~i~0); 2107#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2104#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2105#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2129#L12 assume !(10 == main_~i~0); 2122#L12-2 assume !(0 == main_~i~0); 2124#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2134#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2100#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2090#L12-2 [2020-10-20 06:36:16,448 INFO L796 eck$LassoCheckResult]: Loop: 2090#L12-2 assume !(0 == main_~i~0); 2091#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2136#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2101#L12 assume !(10 == main_~i~0); 2103#L12-2 assume !(0 == main_~i~0); 2138#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2137#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2135#L12 assume !(10 == main_~i~0); 2128#L12-2 assume !(0 == main_~i~0); 2131#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2130#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2127#L12 assume !(10 == main_~i~0); 2121#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2106#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2096#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2097#L12 assume !(10 == main_~i~0); 2125#L12-2 assume !(0 == main_~i~0); 2126#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2133#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2132#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2090#L12-2 [2020-10-20 06:36:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash -912841737, now seen corresponding path program 1 times [2020-10-20 06:36:16,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497602777] [2020-10-20 06:36:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497602777] [2020-10-20 06:36:16,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693380900] [2020-10-20 06:36:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:16,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-20 06:36:16,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566246590] [2020-10-20 06:36:16,512 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:16,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1872990932, now seen corresponding path program 2 times [2020-10-20 06:36:16,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71705125] [2020-10-20 06:36:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:16,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71705125] [2020-10-20 06:36:16,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344863149] [2020-10-20 06:36:16,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:16,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:16,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:16,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:16,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:16,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-10-20 06:36:16,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392735481] [2020-10-20 06:36:16,566 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:16,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:36:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:36:16,567 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-10-20 06:36:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:16,593 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2020-10-20 06:36:16,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:36:16,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 79 transitions. [2020-10-20 06:36:16,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2020-10-20 06:36:16,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 64 states and 76 transitions. [2020-10-20 06:36:16,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-10-20 06:36:16,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-10-20 06:36:16,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 76 transitions. [2020-10-20 06:36:16,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:16,597 INFO L691 BuchiCegarLoop]: Abstraction has 64 states and 76 transitions. [2020-10-20 06:36:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 76 transitions. [2020-10-20 06:36:16,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2020-10-20 06:36:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 06:36:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2020-10-20 06:36:16,603 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2020-10-20 06:36:16,604 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2020-10-20 06:36:16,604 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 06:36:16,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2020-10-20 06:36:16,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-10-20 06:36:16,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:16,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:16,606 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 1, 1, 1] [2020-10-20 06:36:16,606 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 5, 3, 3, 1, 1] [2020-10-20 06:36:16,606 INFO L794 eck$LassoCheckResult]: Stem: 2308#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; 2309#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2334#L12 assume !(10 == main_~i~0); 2328#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2316#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2312#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2313#L12 assume !(10 == main_~i~0); 2306#L12-2 assume !(0 == main_~i~0); 2307#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2359#L12 assume !(10 == main_~i~0); 2358#L12-2 assume !(0 == main_~i~0); 2331#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2329#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2320#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2321#L12-2 [2020-10-20 06:36:16,606 INFO L796 eck$LassoCheckResult]: Loop: 2321#L12-2 assume !(0 == main_~i~0); 2352#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2350#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2348#L12 assume !(10 == main_~i~0); 2347#L12-2 assume !(0 == main_~i~0); 2346#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2344#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2343#L12 assume !(10 == main_~i~0); 2325#L12-2 assume !(0 == main_~i~0); 2340#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2338#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2323#L12 assume !(10 == main_~i~0); 2326#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2356#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2310#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2311#L12 assume !(10 == main_~i~0); 2357#L12-2 assume !(0 == main_~i~0); 2318#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2319#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2322#L12 assume !(10 == main_~i~0); 2304#L12-2 assume !(0 == main_~i~0); 2305#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2330#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2327#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2321#L12-2 [2020-10-20 06:36:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 554461792, now seen corresponding path program 2 times [2020-10-20 06:36:16,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480385144] [2020-10-20 06:36:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480385144] [2020-10-20 06:36:16,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141075982] [2020-10-20 06:36:16,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:16,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:16,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:16,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:16,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:36:16,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34159355] [2020-10-20 06:36:16,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:16,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,677 INFO L82 PathProgramCache]: Analyzing trace with hash -77847875, now seen corresponding path program 3 times [2020-10-20 06:36:16,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186608374] [2020-10-20 06:36:16,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:16,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186608374] [2020-10-20 06:36:16,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045202951] [2020-10-20 06:36:16,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:16,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 06:36:16,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:16,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:16,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:16,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-10-20 06:36:16,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693202119] [2020-10-20 06:36:16,743 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:16,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:16,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:36:16,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:36:16,744 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 15 Second operand 6 states. [2020-10-20 06:36:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:16,789 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2020-10-20 06:36:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:36:16,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 87 transitions. [2020-10-20 06:36:16,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2020-10-20 06:36:16,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 72 states and 84 transitions. [2020-10-20 06:36:16,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 06:36:16,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-20 06:36:16,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 84 transitions. [2020-10-20 06:36:16,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:16,794 INFO L691 BuchiCegarLoop]: Abstraction has 72 states and 84 transitions. [2020-10-20 06:36:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 84 transitions. [2020-10-20 06:36:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2020-10-20 06:36:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 06:36:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-10-20 06:36:16,797 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-10-20 06:36:16,797 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-10-20 06:36:16,797 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 06:36:16,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 75 transitions. [2020-10-20 06:36:16,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2020-10-20 06:36:16,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:16,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:16,799 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 1, 1, 1] [2020-10-20 06:36:16,799 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 6, 4, 3, 1, 1] [2020-10-20 06:36:16,799 INFO L794 eck$LassoCheckResult]: Stem: 2563#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; 2564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2593#L12 assume !(10 == main_~i~0); 2584#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2572#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2567#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2568#L12 assume !(10 == main_~i~0); 2571#L12-2 assume !(0 == main_~i~0); 2573#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2574#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2622#L12 assume !(10 == main_~i~0); 2561#L12-2 assume !(0 == main_~i~0); 2562#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2619#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2614#L12 assume !(10 == main_~i~0); 2613#L12-2 assume !(0 == main_~i~0); 2587#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2585#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2575#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2576#L12-2 [2020-10-20 06:36:16,799 INFO L796 eck$LassoCheckResult]: Loop: 2576#L12-2 assume !(0 == main_~i~0); 2609#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2607#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2605#L12 assume !(10 == main_~i~0); 2604#L12-2 assume !(0 == main_~i~0); 2603#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2601#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2600#L12 assume !(10 == main_~i~0); 2580#L12-2 assume !(0 == main_~i~0); 2597#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2595#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2578#L12 assume !(10 == main_~i~0); 2581#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2621#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2620#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2577#L12 assume !(10 == main_~i~0); 2559#L12-2 assume !(0 == main_~i~0); 2560#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2565#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2566#L12 assume !(10 == main_~i~0); 2618#L12-2 assume !(0 == main_~i~0); 2617#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2616#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2615#L12 assume !(10 == main_~i~0); 2583#L12-2 assume !(0 == main_~i~0); 2588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2586#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2582#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2576#L12-2 [2020-10-20 06:36:16,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1774824375, now seen corresponding path program 3 times [2020-10-20 06:36:16,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051105433] [2020-10-20 06:36:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051105433] [2020-10-20 06:36:16,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627469929] [2020-10-20 06:36:16,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:16,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 06:36:16,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:16,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:16,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:16,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 06:36:16,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734902184] [2020-10-20 06:36:16,870 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:16,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash -687303130, now seen corresponding path program 4 times [2020-10-20 06:36:16,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:16,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938766109] [2020-10-20 06:36:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:16,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938766109] [2020-10-20 06:36:16,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492769487] [2020-10-20 06:36:16,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:16,940 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:16,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:16,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:16,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:16,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:16,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 06:36:16,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829743634] [2020-10-20 06:36:16,954 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:16,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:16,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:36:16,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:36:16,954 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-10-20 06:36:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,006 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2020-10-20 06:36:17,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:36:17,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 95 transitions. [2020-10-20 06:36:17,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-20 06:36:17,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 80 states and 92 transitions. [2020-10-20 06:36:17,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2020-10-20 06:36:17,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2020-10-20 06:36:17,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 92 transitions. [2020-10-20 06:36:17,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,010 INFO L691 BuchiCegarLoop]: Abstraction has 80 states and 92 transitions. [2020-10-20 06:36:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 92 transitions. [2020-10-20 06:36:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2020-10-20 06:36:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 06:36:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2020-10-20 06:36:17,013 INFO L714 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2020-10-20 06:36:17,013 INFO L594 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2020-10-20 06:36:17,013 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 06:36:17,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 83 transitions. [2020-10-20 06:36:17,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-20 06:36:17,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,014 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 1, 1, 1] [2020-10-20 06:36:17,015 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 7, 5, 3, 1, 1] [2020-10-20 06:36:17,015 INFO L794 eck$LassoCheckResult]: Stem: 2860#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; 2861#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2890#L12 assume !(10 == main_~i~0); 2881#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2868#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2869#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2927#L12 assume !(10 == main_~i~0); 2926#L12-2 assume !(0 == main_~i~0); 2870#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2864#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2865#L12 assume !(10 == main_~i~0); 2858#L12-2 assume !(0 == main_~i~0); 2859#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2925#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2924#L12 assume !(10 == main_~i~0); 2923#L12-2 assume !(0 == main_~i~0); 2911#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2921#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2912#L12 assume !(10 == main_~i~0); 2910#L12-2 assume !(0 == main_~i~0); 2884#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2882#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2872#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2873#L12-2 [2020-10-20 06:36:17,015 INFO L796 eck$LassoCheckResult]: Loop: 2873#L12-2 assume !(0 == main_~i~0); 2906#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2904#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2902#L12 assume !(10 == main_~i~0); 2901#L12-2 assume !(0 == main_~i~0); 2900#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2898#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2897#L12 assume !(10 == main_~i~0); 2878#L12-2 assume !(0 == main_~i~0); 2894#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 2892#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2876#L12 assume !(10 == main_~i~0); 2856#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 2857#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); 2874#L12 assume !(10 == main_~i~0); 2875#L12-2 assume !(0 == main_~i~0); 2871#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2862#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2863#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); 2916#L12-2 assume !(0 == main_~i~0); 2915#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2914#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2913#L12 assume !(10 == main_~i~0); 2880#L12-2 assume !(0 == main_~i~0); 2885#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 2883#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 2879#L12 assume 10 == main_~i~0;main_~up~0 := 0; 2873#L12-2 [2020-10-20 06:36:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash 790045106, now seen corresponding path program 4 times [2020-10-20 06:36:17,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583216369] [2020-10-20 06:36:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583216369] [2020-10-20 06:36:17,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781676771] [2020-10-20 06:36:17,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:17,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:17,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 06:36:17,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705395095] [2020-10-20 06:36:17,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:17,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1460350223, now seen corresponding path program 5 times [2020-10-20 06:36:17,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090714880] [2020-10-20 06:36:17,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 61 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:17,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090714880] [2020-10-20 06:36:17,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055396762] [2020-10-20 06:36:17,158 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,193 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-10-20 06:36:17,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:17,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 61 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:17,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 06:36:17,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323765343] [2020-10-20 06:36:17,210 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:17,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:17,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:36:17,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:36:17,211 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. cyclomatic complexity: 15 Second operand 8 states. [2020-10-20 06:36:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,279 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2020-10-20 06:36:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:36:17,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 103 transitions. [2020-10-20 06:36:17,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 [2020-10-20 06:36:17,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 88 states and 100 transitions. [2020-10-20 06:36:17,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-20 06:36:17,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-20 06:36:17,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 100 transitions. [2020-10-20 06:36:17,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,282 INFO L691 BuchiCegarLoop]: Abstraction has 88 states and 100 transitions. [2020-10-20 06:36:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 100 transitions. [2020-10-20 06:36:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2020-10-20 06:36:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-20 06:36:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2020-10-20 06:36:17,285 INFO L714 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2020-10-20 06:36:17,285 INFO L594 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2020-10-20 06:36:17,285 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 06:36:17,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 91 transitions. [2020-10-20 06:36:17,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2020-10-20 06:36:17,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,287 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2020-10-20 06:36:17,287 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 8, 6, 3, 1, 1] [2020-10-20 06:36:17,287 INFO L794 eck$LassoCheckResult]: Stem: 3199#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; 3200#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3227#L12 assume !(10 == main_~i~0); 3218#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3207#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3203#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3204#L12 assume !(10 == main_~i~0); 3197#L12-2 assume !(0 == main_~i~0); 3198#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3208#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3274#L12 assume !(10 == main_~i~0); 3273#L12-2 assume !(0 == main_~i~0); 3272#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3271#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3270#L12 assume !(10 == main_~i~0); 3269#L12-2 assume !(0 == main_~i~0); 3268#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3267#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3266#L12 assume !(10 == main_~i~0); 3265#L12-2 assume !(0 == main_~i~0); 3248#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3262#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3249#L12 assume !(10 == main_~i~0); 3247#L12-2 assume !(0 == main_~i~0); 3221#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3219#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3209#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3210#L12-2 [2020-10-20 06:36:17,287 INFO L796 eck$LassoCheckResult]: Loop: 3210#L12-2 assume !(0 == main_~i~0); 3243#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3241#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3239#L12 assume !(10 == main_~i~0); 3238#L12-2 assume !(0 == main_~i~0); 3237#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3236#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3234#L12 assume !(10 == main_~i~0); 3214#L12-2 assume !(0 == main_~i~0); 3231#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3229#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3211#L12 assume !(10 == main_~i~0); 3213#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; 3263#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3215#L12 assume !(10 == main_~i~0); 3195#L12-2 assume !(0 == main_~i~0); 3196#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3201#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3202#L12 assume !(10 == main_~i~0); 3261#L12-2 assume !(0 == main_~i~0); 3260#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3259#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3258#L12 assume !(10 == main_~i~0); 3257#L12-2 assume !(0 == main_~i~0); 3256#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3255#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3254#L12 assume !(10 == main_~i~0); 3253#L12-2 assume !(0 == main_~i~0); 3252#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3251#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3250#L12 assume !(10 == main_~i~0); 3217#L12-2 assume !(0 == main_~i~0); 3222#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3220#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3216#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3210#L12-2 [2020-10-20 06:36:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1500441957, now seen corresponding path program 5 times [2020-10-20 06:36:17,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356453628] [2020-10-20 06:36:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356453628] [2020-10-20 06:36:17,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892283095] [2020-10-20 06:36:17,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,372 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-10-20 06:36:17,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:17,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 06:36:17,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189504514] [2020-10-20 06:36:17,389 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1420175224, now seen corresponding path program 6 times [2020-10-20 06:36:17,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112422877] [2020-10-20 06:36:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:17,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112422877] [2020-10-20 06:36:17,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750344595] [2020-10-20 06:36:17,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2020-10-20 06:36:17,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:17,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:17,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 06:36:17,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120016998] [2020-10-20 06:36:17,504 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:17,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:17,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:36:17,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:36:17,505 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. cyclomatic complexity: 15 Second operand 9 states. [2020-10-20 06:36:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,561 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2020-10-20 06:36:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:36:17,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 111 transitions. [2020-10-20 06:36:17,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2020-10-20 06:36:17,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 96 states and 108 transitions. [2020-10-20 06:36:17,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2020-10-20 06:36:17,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-10-20 06:36:17,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 108 transitions. [2020-10-20 06:36:17,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,565 INFO L691 BuchiCegarLoop]: Abstraction has 96 states and 108 transitions. [2020-10-20 06:36:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 108 transitions. [2020-10-20 06:36:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2020-10-20 06:36:17,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-20 06:36:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2020-10-20 06:36:17,568 INFO L714 BuchiCegarLoop]: Abstraction has 88 states and 99 transitions. [2020-10-20 06:36:17,568 INFO L594 BuchiCegarLoop]: Abstraction has 88 states and 99 transitions. [2020-10-20 06:36:17,568 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 06:36:17,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 99 transitions. [2020-10-20 06:36:17,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2020-10-20 06:36:17,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,570 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 6, 1, 1, 1] [2020-10-20 06:36:17,570 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 7, 3, 1, 1] [2020-10-20 06:36:17,571 INFO L794 eck$LassoCheckResult]: Stem: 3580#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; 3581#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3609#L12 assume !(10 == main_~i~0); 3600#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3588#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3584#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3585#L12 assume !(10 == main_~i~0); 3578#L12-2 assume !(0 == main_~i~0); 3579#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3589#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3663#L12 assume !(10 == main_~i~0); 3662#L12-2 assume !(0 == main_~i~0); 3661#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3660#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3659#L12 assume !(10 == main_~i~0); 3658#L12-2 assume !(0 == main_~i~0); 3657#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3656#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3655#L12 assume !(10 == main_~i~0); 3654#L12-2 assume !(0 == main_~i~0); 3653#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3651#L12 assume !(10 == main_~i~0); 3650#L12-2 assume !(0 == main_~i~0); 3630#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3649#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3631#L12 assume !(10 == main_~i~0); 3629#L12-2 assume !(0 == main_~i~0); 3603#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3601#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3591#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3592#L12-2 [2020-10-20 06:36:17,571 INFO L796 eck$LassoCheckResult]: Loop: 3592#L12-2 assume !(0 == main_~i~0); 3625#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3623#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3621#L12 assume !(10 == main_~i~0); 3620#L12-2 assume !(0 == main_~i~0); 3619#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3617#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3616#L12 assume !(10 == main_~i~0); 3599#L12-2 assume !(0 == main_~i~0); 3613#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 3611#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3597#L12 assume !(10 == main_~i~0); 3576#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 3577#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3648#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3593#L12 assume !(10 == main_~i~0); 3594#L12-2 assume !(0 == main_~i~0); 3590#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3582#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3583#L12 assume !(10 == main_~i~0); 3647#L12-2 assume !(0 == main_~i~0); 3646#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3645#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3644#L12 assume !(10 == main_~i~0); 3643#L12-2 assume !(0 == main_~i~0); 3642#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3641#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3640#L12 assume !(10 == main_~i~0); 3639#L12-2 assume !(0 == main_~i~0); 3638#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3637#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3636#L12 assume !(10 == main_~i~0); 3635#L12-2 assume !(0 == main_~i~0); 3634#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3633#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3632#L12 assume !(10 == main_~i~0); 3596#L12-2 assume !(0 == main_~i~0); 3604#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 3602#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 3595#L12 assume 10 == main_~i~0;main_~up~0 := 0; 3592#L12-2 [2020-10-20 06:36:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash -60397820, now seen corresponding path program 6 times [2020-10-20 06:36:17,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484479028] [2020-10-20 06:36:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484479028] [2020-10-20 06:36:17,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719844831] [2020-10-20 06:36:17,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,664 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2020-10-20 06:36:17,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:17,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 06:36:17,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247180123] [2020-10-20 06:36:17,682 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1107573407, now seen corresponding path program 7 times [2020-10-20 06:36:17,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667567301] [2020-10-20 06:36:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:17,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667567301] [2020-10-20 06:36:17,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080791452] [2020-10-20 06:36:17,761 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:17,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 87 proven. 78 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:17,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:17,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 06:36:17,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164159147] [2020-10-20 06:36:17,806 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:17,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:36:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:36:17,807 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. cyclomatic complexity: 15 Second operand 10 states. [2020-10-20 06:36:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:17,885 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2020-10-20 06:36:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:36:17,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 119 transitions. [2020-10-20 06:36:17,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2020-10-20 06:36:17,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 104 states and 116 transitions. [2020-10-20 06:36:17,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2020-10-20 06:36:17,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2020-10-20 06:36:17,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 116 transitions. [2020-10-20 06:36:17,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:17,888 INFO L691 BuchiCegarLoop]: Abstraction has 104 states and 116 transitions. [2020-10-20 06:36:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 116 transitions. [2020-10-20 06:36:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2020-10-20 06:36:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-20 06:36:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2020-10-20 06:36:17,891 INFO L714 BuchiCegarLoop]: Abstraction has 96 states and 107 transitions. [2020-10-20 06:36:17,891 INFO L594 BuchiCegarLoop]: Abstraction has 96 states and 107 transitions. [2020-10-20 06:36:17,891 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 06:36:17,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 107 transitions. [2020-10-20 06:36:17,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2020-10-20 06:36:17,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:17,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:17,893 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 7, 1, 1, 1] [2020-10-20 06:36:17,893 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 8, 3, 1, 1] [2020-10-20 06:36:17,893 INFO L794 eck$LassoCheckResult]: Stem: 4003#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; 4004#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4032#L12 assume !(10 == main_~i~0); 4023#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4011#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4007#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4008#L12 assume !(10 == main_~i~0); 4001#L12-2 assume !(0 == main_~i~0); 4002#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4012#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4094#L12 assume !(10 == main_~i~0); 4093#L12-2 assume !(0 == main_~i~0); 4092#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4091#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4090#L12 assume !(10 == main_~i~0); 4089#L12-2 assume !(0 == main_~i~0); 4088#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4087#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4086#L12 assume !(10 == main_~i~0); 4085#L12-2 assume !(0 == main_~i~0); 4084#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4083#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4082#L12 assume !(10 == main_~i~0); 4081#L12-2 assume !(0 == main_~i~0); 4080#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4079#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4078#L12 assume !(10 == main_~i~0); 4077#L12-2 assume !(0 == main_~i~0); 4053#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4076#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4054#L12 assume !(10 == main_~i~0); 4052#L12-2 assume !(0 == main_~i~0); 4026#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4024#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4014#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4015#L12-2 [2020-10-20 06:36:17,893 INFO L796 eck$LassoCheckResult]: Loop: 4015#L12-2 assume !(0 == main_~i~0); 4048#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4046#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4044#L12 assume !(10 == main_~i~0); 4043#L12-2 assume !(0 == main_~i~0); 4042#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4040#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4039#L12 assume !(10 == main_~i~0); 4020#L12-2 assume !(0 == main_~i~0); 4036#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4034#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4018#L12 assume !(10 == main_~i~0); 3999#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4000#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4016#L12 assume !(10 == main_~i~0); 4017#L12-2 assume !(0 == main_~i~0); 4013#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4006#L12 assume !(10 == main_~i~0); 4074#L12-2 assume !(0 == main_~i~0); 4073#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4072#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4071#L12 assume !(10 == main_~i~0); 4070#L12-2 assume !(0 == main_~i~0); 4069#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4068#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4067#L12 assume !(10 == main_~i~0); 4066#L12-2 assume !(0 == main_~i~0); 4065#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4064#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4063#L12 assume !(10 == main_~i~0); 4062#L12-2 assume !(0 == main_~i~0); 4061#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4060#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4059#L12 assume !(10 == main_~i~0); 4058#L12-2 assume !(0 == main_~i~0); 4057#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4056#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4055#L12 assume !(10 == main_~i~0); 4022#L12-2 assume !(0 == main_~i~0); 4027#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4025#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4021#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4015#L12-2 [2020-10-20 06:36:17,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:17,894 INFO L82 PathProgramCache]: Analyzing trace with hash 87645933, now seen corresponding path program 7 times [2020-10-20 06:36:17,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:17,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188633830] [2020-10-20 06:36:17,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:17,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188633830] [2020-10-20 06:36:17,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170938773] [2020-10-20 06:36:17,984 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-10-20 06:36:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-20 06:36:18,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698648667] [2020-10-20 06:36:18,024 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,024 INFO L82 PathProgramCache]: Analyzing trace with hash 638469834, now seen corresponding path program 8 times [2020-10-20 06:36:18,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131651926] [2020-10-20 06:36:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:18,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131651926] [2020-10-20 06:36:18,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449105361] [2020-10-20 06:36:18,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:18,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 105 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:18,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-20 06:36:18,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173090017] [2020-10-20 06:36:18,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:18,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:18,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:36:18,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:36:18,143 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. cyclomatic complexity: 15 Second operand 11 states. [2020-10-20 06:36:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:18,244 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2020-10-20 06:36:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:36:18,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 127 transitions. [2020-10-20 06:36:18,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2020-10-20 06:36:18,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 112 states and 124 transitions. [2020-10-20 06:36:18,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-10-20 06:36:18,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2020-10-20 06:36:18,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 124 transitions. [2020-10-20 06:36:18,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:18,247 INFO L691 BuchiCegarLoop]: Abstraction has 112 states and 124 transitions. [2020-10-20 06:36:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 124 transitions. [2020-10-20 06:36:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2020-10-20 06:36:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-20 06:36:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2020-10-20 06:36:18,250 INFO L714 BuchiCegarLoop]: Abstraction has 104 states and 115 transitions. [2020-10-20 06:36:18,251 INFO L594 BuchiCegarLoop]: Abstraction has 104 states and 115 transitions. [2020-10-20 06:36:18,251 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 06:36:18,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 115 transitions. [2020-10-20 06:36:18,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2020-10-20 06:36:18,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:18,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:18,253 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 8, 1, 1, 1] [2020-10-20 06:36:18,253 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [12, 11, 11, 9, 3, 1, 1] [2020-10-20 06:36:18,253 INFO L794 eck$LassoCheckResult]: Stem: 4468#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; 4469#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4497#L12 assume !(10 == main_~i~0); 4488#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4476#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4472#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4473#L12 assume !(10 == main_~i~0); 4466#L12-2 assume !(0 == main_~i~0); 4467#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4477#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4567#L12 assume !(10 == main_~i~0); 4566#L12-2 assume !(0 == main_~i~0); 4565#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4564#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4563#L12 assume !(10 == main_~i~0); 4562#L12-2 assume !(0 == main_~i~0); 4561#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4560#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4559#L12 assume !(10 == main_~i~0); 4558#L12-2 assume !(0 == main_~i~0); 4557#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4556#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4555#L12 assume !(10 == main_~i~0); 4554#L12-2 assume !(0 == main_~i~0); 4553#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4552#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4551#L12 assume !(10 == main_~i~0); 4550#L12-2 assume !(0 == main_~i~0); 4549#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4548#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4547#L12 assume !(10 == main_~i~0); 4546#L12-2 assume !(0 == main_~i~0); 4518#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4545#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4519#L12 assume !(10 == main_~i~0); 4517#L12-2 assume !(0 == main_~i~0); 4491#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4489#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4479#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4480#L12-2 [2020-10-20 06:36:18,254 INFO L796 eck$LassoCheckResult]: Loop: 4480#L12-2 assume !(0 == main_~i~0); 4513#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4511#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4509#L12 assume !(10 == main_~i~0); 4508#L12-2 assume !(0 == main_~i~0); 4507#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4505#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4504#L12 assume !(10 == main_~i~0); 4485#L12-2 assume !(0 == main_~i~0); 4501#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 4499#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4483#L12 assume !(10 == main_~i~0); 4464#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4465#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4544#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4481#L12 assume !(10 == main_~i~0); 4482#L12-2 assume !(0 == main_~i~0); 4478#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4470#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4471#L12 assume !(10 == main_~i~0); 4543#L12-2 assume !(0 == main_~i~0); 4542#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4541#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4540#L12 assume !(10 == main_~i~0); 4539#L12-2 assume !(0 == main_~i~0); 4538#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4537#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4536#L12 assume !(10 == main_~i~0); 4535#L12-2 assume !(0 == main_~i~0); 4534#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4533#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4532#L12 assume !(10 == main_~i~0); 4531#L12-2 assume !(0 == main_~i~0); 4530#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4529#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4528#L12 assume !(10 == main_~i~0); 4527#L12-2 assume !(0 == main_~i~0); 4526#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4525#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4524#L12 assume !(10 == main_~i~0); 4523#L12-2 assume !(0 == main_~i~0); 4522#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4521#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4520#L12 assume !(10 == main_~i~0); 4487#L12-2 assume !(0 == main_~i~0); 4492#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4490#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4486#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4480#L12-2 [2020-10-20 06:36:18,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,254 INFO L82 PathProgramCache]: Analyzing trace with hash -91473322, now seen corresponding path program 8 times [2020-10-20 06:36:18,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023986329] [2020-10-20 06:36:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023986329] [2020-10-20 06:36:18,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666320576] [2020-10-20 06:36:18,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:18,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 26 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:36:18,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-10-20 06:36:18,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2583805] [2020-10-20 06:36:18,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 06:36:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1421863859, now seen corresponding path program 9 times [2020-10-20 06:36:18,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485919110] [2020-10-20 06:36:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 136 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:18,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485919110] [2020-10-20 06:36:18,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960605451] [2020-10-20 06:36:18,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2020-10-20 06:36:18,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 136 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-20 06:36:18,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-10-20 06:36:18,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188817237] [2020-10-20 06:36:18,570 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 06:36:18,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:36:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:36:18,571 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. cyclomatic complexity: 15 Second operand 12 states. [2020-10-20 06:36:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:18,649 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2020-10-20 06:36:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:36:18,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 135 transitions. [2020-10-20 06:36:18,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2020-10-20 06:36:18,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 120 states and 132 transitions. [2020-10-20 06:36:18,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2020-10-20 06:36:18,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2020-10-20 06:36:18,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 132 transitions. [2020-10-20 06:36:18,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:18,654 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 132 transitions. [2020-10-20 06:36:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 132 transitions. [2020-10-20 06:36:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2020-10-20 06:36:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-20 06:36:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2020-10-20 06:36:18,657 INFO L714 BuchiCegarLoop]: Abstraction has 112 states and 123 transitions. [2020-10-20 06:36:18,657 INFO L594 BuchiCegarLoop]: Abstraction has 112 states and 123 transitions. [2020-10-20 06:36:18,657 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 06:36:18,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 123 transitions. [2020-10-20 06:36:18,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2020-10-20 06:36:18,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:18,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:18,659 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:18,659 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [13, 12, 12, 10, 3, 1, 1] [2020-10-20 06:36:18,660 INFO L794 eck$LassoCheckResult]: Stem: 4975#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; 4976#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5003#L12 assume !(10 == main_~i~0); 4994#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 4983#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4979#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4980#L12 assume !(10 == main_~i~0); 4973#L12-2 assume !(0 == main_~i~0); 4974#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4984#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5082#L12 assume !(10 == main_~i~0); 5081#L12-2 assume !(0 == main_~i~0); 5080#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5079#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5078#L12 assume !(10 == main_~i~0); 5077#L12-2 assume !(0 == main_~i~0); 5076#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5075#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5074#L12 assume !(10 == main_~i~0); 5073#L12-2 assume !(0 == main_~i~0); 5072#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5071#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5070#L12 assume !(10 == main_~i~0); 5069#L12-2 assume !(0 == main_~i~0); 5068#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5067#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5066#L12 assume !(10 == main_~i~0); 5065#L12-2 assume !(0 == main_~i~0); 5064#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5063#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5062#L12 assume !(10 == main_~i~0); 5061#L12-2 assume !(0 == main_~i~0); 5060#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5059#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5058#L12 assume !(10 == main_~i~0); 5057#L12-2 assume !(0 == main_~i~0); 5024#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5054#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5025#L12 assume !(10 == main_~i~0); 5023#L12-2 assume !(0 == main_~i~0); 4997#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4995#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4985#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4986#L12-2 [2020-10-20 06:36:18,660 INFO L796 eck$LassoCheckResult]: Loop: 4986#L12-2 assume !(0 == main_~i~0); 5019#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5017#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5015#L12 assume !(10 == main_~i~0); 5014#L12-2 assume !(0 == main_~i~0); 5013#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5012#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5010#L12 assume !(10 == main_~i~0); 4990#L12-2 assume !(0 == main_~i~0); 5007#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 5005#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4987#L12 assume !(10 == main_~i~0); 4989#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 5056#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5055#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4991#L12 assume !(10 == main_~i~0); 4971#L12-2 assume !(0 == main_~i~0); 4972#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4977#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4978#L12 assume !(10 == main_~i~0); 5053#L12-2 assume !(0 == main_~i~0); 5052#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5051#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5050#L12 assume !(10 == main_~i~0); 5049#L12-2 assume !(0 == main_~i~0); 5048#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5047#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5046#L12 assume !(10 == main_~i~0); 5045#L12-2 assume !(0 == main_~i~0); 5044#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5043#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5042#L12 assume !(10 == main_~i~0); 5041#L12-2 assume !(0 == main_~i~0); 5040#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5039#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5038#L12 assume !(10 == main_~i~0); 5037#L12-2 assume !(0 == main_~i~0); 5036#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5035#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5034#L12 assume !(10 == main_~i~0); 5033#L12-2 assume !(0 == main_~i~0); 5032#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5031#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5030#L12 assume !(10 == main_~i~0); 5029#L12-2 assume !(0 == main_~i~0); 5028#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 5027#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 5026#L12 assume !(10 == main_~i~0); 4993#L12-2 assume !(0 == main_~i~0); 4998#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 4996#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 4992#L12 assume 10 == main_~i~0;main_~up~0 := 0; 4986#L12-2 [2020-10-20 06:36:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 9 times [2020-10-20 06:36:18,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057739139] [2020-10-20 06:36:18,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:18,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:18,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:18,676 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash -690818020, now seen corresponding path program 10 times [2020-10-20 06:36:18,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161401729] [2020-10-20 06:36:18,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:18,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:18,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:18,693 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:18,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:18,694 INFO L82 PathProgramCache]: Analyzing trace with hash -120542630, now seen corresponding path program 2 times [2020-10-20 06:36:18,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:18,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095989456] [2020-10-20 06:36:18,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:18,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095989456] [2020-10-20 06:36:18,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412351251] [2020-10-20 06:36:18,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:18,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:18,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:18,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 06:36:18,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 672 proven. 15 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:18,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:18,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-10-20 06:36:18,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97864717] [2020-10-20 06:36:19,078 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 52 [2020-10-20 06:36:19,097 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:19,097 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:19,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:19,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:19,097 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:19,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:19,097 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:19,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration19_Loop [2020-10-20 06:36:19,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:19,098 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:19,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,166 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:19,166 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:19,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:19,175 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,179 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:19,179 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:19,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:19,215 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:19,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:19,254 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,258 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:19,283 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:19,283 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:19,284 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:19,284 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:19,284 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:19,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:19,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:19,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration19_Loop [2020-10-20 06:36:19,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:19,284 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:19,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:19,366 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:19,367 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,370 INFO L120 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 [2020-10-20 06:36:19,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:19,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:19,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:19,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:19,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:19,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:19,380 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,420 INFO L120 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 [2020-10-20 06:36:19,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:19,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:19,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:19,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:19,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:19,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:19,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:19,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:19,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:19,430 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:19,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:19,432 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:19,432 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:19,432 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 13 Supporting invariants [] [2020-10-20 06:36:19,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:19,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:19,545 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 [2020-10-20 06:36:19,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 123 transitions. cyclomatic complexity: 15 Second operand 7 states. [2020-10-20 06:36:19,779 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 123 transitions. cyclomatic complexity: 15. Second operand 7 states. Result 461 states and 502 transitions. Complement of second has 19 states. [2020-10-20 06:36:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:19,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 06:36:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-10-20 06:36:19,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 52 letters. [2020-10-20 06:36:19,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:19,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 95 letters. Loop has 52 letters. [2020-10-20 06:36:19,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:19,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 44 transitions. Stem has 43 letters. Loop has 104 letters. [2020-10-20 06:36:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:19,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 461 states and 502 transitions. [2020-10-20 06:36:19,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2020-10-20 06:36:19,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 461 states to 386 states and 420 transitions. [2020-10-20 06:36:19,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2020-10-20 06:36:19,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2020-10-20 06:36:19,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 420 transitions. [2020-10-20 06:36:19,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:19,812 INFO L691 BuchiCegarLoop]: Abstraction has 386 states and 420 transitions. [2020-10-20 06:36:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 420 transitions. [2020-10-20 06:36:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 326. [2020-10-20 06:36:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-10-20 06:36:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 350 transitions. [2020-10-20 06:36:19,819 INFO L714 BuchiCegarLoop]: Abstraction has 326 states and 350 transitions. [2020-10-20 06:36:19,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:36:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:36:19,820 INFO L87 Difference]: Start difference. First operand 326 states and 350 transitions. Second operand 6 states. [2020-10-20 06:36:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:19,882 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2020-10-20 06:36:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:36:19,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 255 transitions. [2020-10-20 06:36:19,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2020-10-20 06:36:19,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 207 states and 229 transitions. [2020-10-20 06:36:19,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:19,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:19,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 229 transitions. [2020-10-20 06:36:19,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:19,886 INFO L691 BuchiCegarLoop]: Abstraction has 207 states and 229 transitions. [2020-10-20 06:36:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 229 transitions. [2020-10-20 06:36:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 120. [2020-10-20 06:36:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-20 06:36:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2020-10-20 06:36:19,890 INFO L714 BuchiCegarLoop]: Abstraction has 120 states and 132 transitions. [2020-10-20 06:36:19,890 INFO L594 BuchiCegarLoop]: Abstraction has 120 states and 132 transitions. [2020-10-20 06:36:19,890 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 06:36:19,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 132 transitions. [2020-10-20 06:36:19,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2020-10-20 06:36:19,892 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:19,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:19,894 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:19,894 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [14, 13, 13, 10, 4, 1, 1] [2020-10-20 06:36:19,895 INFO L794 eck$LassoCheckResult]: Stem: 6727#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; 6728#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6741#L12 assume !(10 == main_~i~0); 6738#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 6734#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6735#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6809#L12 assume !(10 == main_~i~0); 6808#L12-2 assume !(0 == main_~i~0); 6736#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6731#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6732#L12 assume !(10 == main_~i~0); 6725#L12-2 assume !(0 == main_~i~0); 6726#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6806#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6805#L12 assume !(10 == main_~i~0); 6804#L12-2 assume !(0 == main_~i~0); 6803#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6802#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6801#L12 assume !(10 == main_~i~0); 6800#L12-2 assume !(0 == main_~i~0); 6799#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6798#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6797#L12 assume !(10 == main_~i~0); 6796#L12-2 assume !(0 == main_~i~0); 6795#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6793#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6792#L12 assume !(10 == main_~i~0); 6791#L12-2 assume !(0 == main_~i~0); 6789#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6787#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6785#L12 assume !(10 == main_~i~0); 6783#L12-2 assume !(0 == main_~i~0); 6781#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6779#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6777#L12 assume !(10 == main_~i~0); 6775#L12-2 assume !(0 == main_~i~0); 6765#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6772#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6771#L12 assume !(10 == main_~i~0); 6763#L12-2 assume !(0 == main_~i~0); 6764#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6807#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6794#L12 assume 10 == main_~i~0;main_~up~0 := 0; 6723#L12-2 [2020-10-20 06:36:19,895 INFO L796 eck$LassoCheckResult]: Loop: 6723#L12-2 assume !(0 == main_~i~0); 6724#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6790#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6788#L12 assume !(10 == main_~i~0); 6786#L12-2 assume !(0 == main_~i~0); 6784#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6782#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6780#L12 assume !(10 == main_~i~0); 6778#L12-2 assume !(0 == main_~i~0); 6776#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6774#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6773#L12 assume !(10 == main_~i~0); 6768#L12-2 assume !(0 == main_~i~0); 6770#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 6769#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6766#L12 assume !(10 == main_~i~0); 6760#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 6761#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6842#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6841#L12 assume !(10 == main_~i~0); 6762#L12-2 assume !(0 == main_~i~0); 6737#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6729#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6730#L12 assume !(10 == main_~i~0); 6733#L12-2 assume !(0 == main_~i~0); 6840#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6839#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6838#L12 assume !(10 == main_~i~0); 6837#L12-2 assume !(0 == main_~i~0); 6836#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6835#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6834#L12 assume !(10 == main_~i~0); 6833#L12-2 assume !(0 == main_~i~0); 6832#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6831#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6830#L12 assume !(10 == main_~i~0); 6829#L12-2 assume !(0 == main_~i~0); 6828#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6827#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6826#L12 assume !(10 == main_~i~0); 6825#L12-2 assume !(0 == main_~i~0); 6824#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6823#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6822#L12 assume !(10 == main_~i~0); 6821#L12-2 assume !(0 == main_~i~0); 6820#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6819#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6818#L12 assume !(10 == main_~i~0); 6817#L12-2 assume !(0 == main_~i~0); 6816#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6815#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6813#L12 assume !(10 == main_~i~0); 6810#L12-2 assume !(0 == main_~i~0); 6811#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 6814#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 6812#L12 assume 10 == main_~i~0;main_~up~0 := 0; 6723#L12-2 [2020-10-20 06:36:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 10 times [2020-10-20 06:36:19,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976373979] [2020-10-20 06:36:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:19,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:19,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:19,913 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:19,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash 805924487, now seen corresponding path program 11 times [2020-10-20 06:36:19,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959460771] [2020-10-20 06:36:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:19,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:19,927 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:19,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash 329635269, now seen corresponding path program 3 times [2020-10-20 06:36:19,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:19,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424384611] [2020-10-20 06:36:19,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:19,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:19,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424384611] [2020-10-20 06:36:19,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784499241] [2020-10-20 06:36:19,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:20,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2020-10-20 06:36:20,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:20,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 753 proven. 28 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:20,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:20,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-10-20 06:36:20,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961993730] [2020-10-20 06:36:20,357 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 55 [2020-10-20 06:36:20,371 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:20,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:20,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:20,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:20,372 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:20,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:20,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:20,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration20_Loop [2020-10-20 06:36:20,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:20,372 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:20,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:20,444 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,447 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:20,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:20,450 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:20,450 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:20,474 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:20,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:20,507 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:20,527 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:20,528 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:20,528 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:20,528 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:20,528 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:20,528 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,528 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:20,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:20,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration20_Loop [2020-10-20 06:36:20,528 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:20,529 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:20,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:20,594 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:20,595 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,597 INFO L120 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 [2020-10-20 06:36:20,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:20,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:20,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:20,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:20,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:20,600 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:20,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:20,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:20,603 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:20,603 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:20,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:20,606 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:20,606 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:20,607 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2020-10-20 06:36:20,627 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:20,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:20,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:20,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:20,742 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 [2020-10-20 06:36:20,744 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 132 transitions. cyclomatic complexity: 16 Second operand 8 states. [2020-10-20 06:36:20,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 132 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 549 states and 601 transitions. Complement of second has 23 states. [2020-10-20 06:36:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-20 06:36:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2020-10-20 06:36:20,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 56 letters. [2020-10-20 06:36:20,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:20,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 99 letters. Loop has 56 letters. [2020-10-20 06:36:20,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:20,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 53 transitions. Stem has 43 letters. Loop has 112 letters. [2020-10-20 06:36:20,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:20,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 601 transitions. [2020-10-20 06:36:20,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2020-10-20 06:36:21,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 434 states and 475 transitions. [2020-10-20 06:36:21,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2020-10-20 06:36:21,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2020-10-20 06:36:21,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 434 states and 475 transitions. [2020-10-20 06:36:21,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:21,001 INFO L691 BuchiCegarLoop]: Abstraction has 434 states and 475 transitions. [2020-10-20 06:36:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states and 475 transitions. [2020-10-20 06:36:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 334. [2020-10-20 06:36:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2020-10-20 06:36:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 359 transitions. [2020-10-20 06:36:21,008 INFO L714 BuchiCegarLoop]: Abstraction has 334 states and 359 transitions. [2020-10-20 06:36:21,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 06:36:21,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:36:21,009 INFO L87 Difference]: Start difference. First operand 334 states and 359 transitions. Second operand 7 states. [2020-10-20 06:36:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:21,067 INFO L93 Difference]: Finished difference Result 261 states and 286 transitions. [2020-10-20 06:36:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:36:21,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 286 transitions. [2020-10-20 06:36:21,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2020-10-20 06:36:21,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 227 states and 252 transitions. [2020-10-20 06:36:21,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:21,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:21,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 252 transitions. [2020-10-20 06:36:21,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:21,072 INFO L691 BuchiCegarLoop]: Abstraction has 227 states and 252 transitions. [2020-10-20 06:36:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 252 transitions. [2020-10-20 06:36:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 128. [2020-10-20 06:36:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-20 06:36:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2020-10-20 06:36:21,077 INFO L714 BuchiCegarLoop]: Abstraction has 128 states and 141 transitions. [2020-10-20 06:36:21,077 INFO L594 BuchiCegarLoop]: Abstraction has 128 states and 141 transitions. [2020-10-20 06:36:21,077 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 06:36:21,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 141 transitions. [2020-10-20 06:36:21,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-10-20 06:36:21,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:21,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:21,079 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:21,079 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 10, 5, 1, 1] [2020-10-20 06:36:21,080 INFO L794 eck$LassoCheckResult]: Stem: 8644#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; 8645#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8658#L12 assume !(10 == main_~i~0); 8655#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 8651#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8652#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8734#L12 assume !(10 == main_~i~0); 8733#L12-2 assume !(0 == main_~i~0); 8653#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8648#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8649#L12 assume !(10 == main_~i~0); 8642#L12-2 assume !(0 == main_~i~0); 8643#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8731#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8730#L12 assume !(10 == main_~i~0); 8729#L12-2 assume !(0 == main_~i~0); 8728#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8727#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8726#L12 assume !(10 == main_~i~0); 8725#L12-2 assume !(0 == main_~i~0); 8724#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8722#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8721#L12 assume !(10 == main_~i~0); 8720#L12-2 assume !(0 == main_~i~0); 8718#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8716#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8714#L12 assume !(10 == main_~i~0); 8712#L12-2 assume !(0 == main_~i~0); 8710#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8708#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8706#L12 assume !(10 == main_~i~0); 8704#L12-2 assume !(0 == main_~i~0); 8702#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8700#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8698#L12 assume !(10 == main_~i~0); 8696#L12-2 assume !(0 == main_~i~0); 8686#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8693#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8692#L12 assume !(10 == main_~i~0); 8684#L12-2 assume !(0 == main_~i~0); 8685#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8732#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8723#L12 assume 10 == main_~i~0;main_~up~0 := 0; 8640#L12-2 [2020-10-20 06:36:21,080 INFO L796 eck$LassoCheckResult]: Loop: 8640#L12-2 assume !(0 == main_~i~0); 8641#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8719#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8717#L12 assume !(10 == main_~i~0); 8715#L12-2 assume !(0 == main_~i~0); 8713#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8711#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8709#L12 assume !(10 == main_~i~0); 8707#L12-2 assume !(0 == main_~i~0); 8705#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8703#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8701#L12 assume !(10 == main_~i~0); 8699#L12-2 assume !(0 == main_~i~0); 8697#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8695#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8694#L12 assume !(10 == main_~i~0); 8689#L12-2 assume !(0 == main_~i~0); 8691#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 8690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8687#L12 assume !(10 == main_~i~0); 8681#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 8682#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8767#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8766#L12 assume !(10 == main_~i~0); 8683#L12-2 assume !(0 == main_~i~0); 8654#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8646#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8647#L12 assume !(10 == main_~i~0); 8650#L12-2 assume !(0 == main_~i~0); 8765#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8764#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8763#L12 assume !(10 == main_~i~0); 8762#L12-2 assume !(0 == main_~i~0); 8761#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8760#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8759#L12 assume !(10 == main_~i~0); 8758#L12-2 assume !(0 == main_~i~0); 8757#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8756#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8755#L12 assume !(10 == main_~i~0); 8754#L12-2 assume !(0 == main_~i~0); 8753#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8752#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8751#L12 assume !(10 == main_~i~0); 8750#L12-2 assume !(0 == main_~i~0); 8749#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8748#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8747#L12 assume !(10 == main_~i~0); 8746#L12-2 assume !(0 == main_~i~0); 8745#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8744#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8743#L12 assume !(10 == main_~i~0); 8742#L12-2 assume !(0 == main_~i~0); 8741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8739#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8737#L12 assume !(10 == main_~i~0); 8735#L12-2 assume !(0 == main_~i~0); 8736#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 8740#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 8738#L12 assume 10 == main_~i~0;main_~up~0 := 0; 8640#L12-2 [2020-10-20 06:36:21,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:21,080 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 11 times [2020-10-20 06:36:21,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:21,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025918830] [2020-10-20 06:36:21,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:21,091 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:21,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:21,098 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1151943822, now seen corresponding path program 12 times [2020-10-20 06:36:21,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:21,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234251107] [2020-10-20 06:36:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:21,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:21,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:21,125 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:21,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 533812144, now seen corresponding path program 4 times [2020-10-20 06:36:21,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:21,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265395930] [2020-10-20 06:36:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:21,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265395930] [2020-10-20 06:36:21,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557724031] [2020-10-20 06:36:21,188 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:21,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 06:36:21,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:21,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 06:36:21,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 834 proven. 45 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:21,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:21,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-10-20 06:36:21,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563413643] [2020-10-20 06:36:21,589 WARN L193 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 58 [2020-10-20 06:36:21,600 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:21,600 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:21,600 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:21,600 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:21,601 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:21,601 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,601 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:21,601 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:21,601 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration21_Loop [2020-10-20 06:36:21,601 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:21,601 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:21,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,671 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:21,671 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:21,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,680 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,684 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:21,684 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:21,710 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:21,710 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_19=0} Honda state: {v_rep~unnamed0~0~false_19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,734 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:21,736 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:21,737 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_19=1} Honda state: {v_rep~unnamed0~0~true_19=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:21,759 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:21,786 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:21,789 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:21,810 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:21,810 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:21,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:21,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:21,810 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:21,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:21,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:21,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration21_Loop [2020-10-20 06:36:21,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:21,811 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:21,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:21,876 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:21,876 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,879 INFO L120 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 [2020-10-20 06:36:21,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:21,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:21,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:21,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,914 INFO L120 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 [2020-10-20 06:36:21,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:21,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:21,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:21,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,941 INFO L120 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 [2020-10-20 06:36:21,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:21,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,943 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:21,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,944 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:21,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:21,946 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:21,969 INFO L120 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 [2020-10-20 06:36:21,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:21,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:21,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:21,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:21,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:21,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:21,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,975 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:21,977 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:21,977 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:21,979 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:21,980 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:21,980 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:21,980 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 15 Supporting invariants [] [2020-10-20 06:36:22,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:22,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:22,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:22,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:22,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:22,159 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 [2020-10-20 06:36:22,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 128 states and 141 transitions. cyclomatic complexity: 17 Second operand 9 states. [2020-10-20 06:36:22,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 128 states and 141 transitions. cyclomatic complexity: 17. Second operand 9 states. Result 653 states and 718 transitions. Complement of second has 27 states. [2020-10-20 06:36:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-20 06:36:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 62 transitions. [2020-10-20 06:36:22,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 60 letters. [2020-10-20 06:36:22,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:22,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 103 letters. Loop has 60 letters. [2020-10-20 06:36:22,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:22,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 62 transitions. Stem has 43 letters. Loop has 120 letters. [2020-10-20 06:36:22,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:22,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 653 states and 718 transitions. [2020-10-20 06:36:22,570 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2020-10-20 06:36:22,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 653 states to 490 states and 539 transitions. [2020-10-20 06:36:22,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2020-10-20 06:36:22,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2020-10-20 06:36:22,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 490 states and 539 transitions. [2020-10-20 06:36:22,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:22,574 INFO L691 BuchiCegarLoop]: Abstraction has 490 states and 539 transitions. [2020-10-20 06:36:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states and 539 transitions. [2020-10-20 06:36:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 342. [2020-10-20 06:36:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-20 06:36:22,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 368 transitions. [2020-10-20 06:36:22,582 INFO L714 BuchiCegarLoop]: Abstraction has 342 states and 368 transitions. [2020-10-20 06:36:22,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:36:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:36:22,583 INFO L87 Difference]: Start difference. First operand 342 states and 368 transitions. Second operand 8 states. [2020-10-20 06:36:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:22,651 INFO L93 Difference]: Finished difference Result 289 states and 317 transitions. [2020-10-20 06:36:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:36:22,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 289 states and 317 transitions. [2020-10-20 06:36:22,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2020-10-20 06:36:22,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 289 states to 247 states and 275 transitions. [2020-10-20 06:36:22,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:22,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:22,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 275 transitions. [2020-10-20 06:36:22,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:22,657 INFO L691 BuchiCegarLoop]: Abstraction has 247 states and 275 transitions. [2020-10-20 06:36:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 275 transitions. [2020-10-20 06:36:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 136. [2020-10-20 06:36:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-20 06:36:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2020-10-20 06:36:22,662 INFO L714 BuchiCegarLoop]: Abstraction has 136 states and 150 transitions. [2020-10-20 06:36:22,662 INFO L594 BuchiCegarLoop]: Abstraction has 136 states and 150 transitions. [2020-10-20 06:36:22,662 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 06:36:22,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 150 transitions. [2020-10-20 06:36:22,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2020-10-20 06:36:22,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:22,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:22,664 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:22,664 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [16, 15, 15, 10, 6, 1, 1] [2020-10-20 06:36:22,665 INFO L794 eck$LassoCheckResult]: Stem: 10742#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; 10743#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10753#L12 assume !(10 == main_~i~0); 10752#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 10749#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10746#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10747#L12 assume !(10 == main_~i~0); 10740#L12-2 assume !(0 == main_~i~0); 10741#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10750#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10840#L12 assume !(10 == main_~i~0); 10839#L12-2 assume !(0 == main_~i~0); 10837#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10836#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10835#L12 assume !(10 == main_~i~0); 10834#L12-2 assume !(0 == main_~i~0); 10833#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10831#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10830#L12 assume !(10 == main_~i~0); 10829#L12-2 assume !(0 == main_~i~0); 10827#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10825#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10823#L12 assume !(10 == main_~i~0); 10821#L12-2 assume !(0 == main_~i~0); 10819#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10817#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10815#L12 assume !(10 == main_~i~0); 10813#L12-2 assume !(0 == main_~i~0); 10811#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10809#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10807#L12 assume !(10 == main_~i~0); 10805#L12-2 assume !(0 == main_~i~0); 10803#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10801#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10799#L12 assume !(10 == main_~i~0); 10797#L12-2 assume !(0 == main_~i~0); 10787#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10794#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10793#L12 assume !(10 == main_~i~0); 10785#L12-2 assume !(0 == main_~i~0); 10786#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10838#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10832#L12 assume 10 == main_~i~0;main_~up~0 := 0; 10738#L12-2 [2020-10-20 06:36:22,665 INFO L796 eck$LassoCheckResult]: Loop: 10738#L12-2 assume !(0 == main_~i~0); 10739#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10828#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10826#L12 assume !(10 == main_~i~0); 10824#L12-2 assume !(0 == main_~i~0); 10822#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10820#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10818#L12 assume !(10 == main_~i~0); 10816#L12-2 assume !(0 == main_~i~0); 10814#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10812#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10810#L12 assume !(10 == main_~i~0); 10808#L12-2 assume !(0 == main_~i~0); 10806#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10804#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10802#L12 assume !(10 == main_~i~0); 10800#L12-2 assume !(0 == main_~i~0); 10798#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10796#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10795#L12 assume !(10 == main_~i~0); 10790#L12-2 assume !(0 == main_~i~0); 10792#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 10791#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10788#L12 assume !(10 == main_~i~0); 10782#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 10783#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10873#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10872#L12 assume !(10 == main_~i~0); 10784#L12-2 assume !(0 == main_~i~0); 10751#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10744#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10745#L12 assume !(10 == main_~i~0); 10748#L12-2 assume !(0 == main_~i~0); 10871#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10870#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10869#L12 assume !(10 == main_~i~0); 10868#L12-2 assume !(0 == main_~i~0); 10867#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10866#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10865#L12 assume !(10 == main_~i~0); 10864#L12-2 assume !(0 == main_~i~0); 10863#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10862#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10861#L12 assume !(10 == main_~i~0); 10860#L12-2 assume !(0 == main_~i~0); 10859#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10858#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10857#L12 assume !(10 == main_~i~0); 10856#L12-2 assume !(0 == main_~i~0); 10855#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10854#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10853#L12 assume !(10 == main_~i~0); 10852#L12-2 assume !(0 == main_~i~0); 10851#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10850#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10849#L12 assume !(10 == main_~i~0); 10848#L12-2 assume !(0 == main_~i~0); 10847#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10846#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10844#L12 assume !(10 == main_~i~0); 10841#L12-2 assume !(0 == main_~i~0); 10842#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 10845#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 10843#L12 assume 10 == main_~i~0;main_~up~0 := 0; 10738#L12-2 [2020-10-20 06:36:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 12 times [2020-10-20 06:36:22,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:22,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856124914] [2020-10-20 06:36:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,827 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,828 INFO L82 PathProgramCache]: Analyzing trace with hash 336435933, now seen corresponding path program 13 times [2020-10-20 06:36:22,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:22,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51389391] [2020-10-20 06:36:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:22,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:22,844 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 216392731, now seen corresponding path program 5 times [2020-10-20 06:36:22,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:22,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092973426] [2020-10-20 06:36:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:22,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:22,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092973426] [2020-10-20 06:36:22,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825639746] [2020-10-20 06:36:22,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:22,951 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2020-10-20 06:36:22,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:22,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 06:36:22,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:22,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 915 proven. 66 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:22,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:22,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-10-20 06:36:22,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367081348] [2020-10-20 06:36:23,410 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 65 [2020-10-20 06:36:23,432 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:23,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:23,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:23,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:23,432 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:23,433 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,433 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:23,433 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:23,433 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration22_Loop [2020-10-20 06:36:23,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:23,433 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:23,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,516 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:23,517 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:23,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:23,527 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,532 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:23,532 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:23,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:23,571 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,575 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:23,576 INFO L440 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:23,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:23,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:23,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:23,657 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,784 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:23,786 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:23,786 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:23,786 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:23,786 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:23,786 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:23,786 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,786 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:23,786 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:23,786 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration22_Loop [2020-10-20 06:36:23,787 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:23,787 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:23,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:23,878 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:23,878 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,882 INFO L120 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 [2020-10-20 06:36:23,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:23,883 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:23,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:23,883 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 06:36:23,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:23,884 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 06:36:23,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:23,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,909 INFO L120 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 [2020-10-20 06:36:23,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:23,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:23,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:23,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:23,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:23,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:23,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:23,937 INFO L120 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 [2020-10-20 06:36:23,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:23,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:23,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:23,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:23,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:23,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,979 INFO L120 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 [2020-10-20 06:36:23,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:23,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:23,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:23,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:23,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:23,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:23,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:23,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:23,985 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:23,985 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:23,988 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:23,988 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:23,988 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:23,988 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 8 Supporting invariants [] [2020-10-20 06:36:24,008 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:24,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:24,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:24,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:24,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:24,117 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 [2020-10-20 06:36:24,117 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 150 transitions. cyclomatic complexity: 18 Second operand 10 states. [2020-10-20 06:36:24,491 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 150 transitions. cyclomatic complexity: 18. Second operand 10 states. Result 773 states and 853 transitions. Complement of second has 31 states. [2020-10-20 06:36:24,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-20 06:36:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2020-10-20 06:36:24,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 64 letters. [2020-10-20 06:36:24,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:24,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 107 letters. Loop has 64 letters. [2020-10-20 06:36:24,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:24,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 71 transitions. Stem has 43 letters. Loop has 128 letters. [2020-10-20 06:36:24,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:24,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 773 states and 853 transitions. [2020-10-20 06:36:24,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2020-10-20 06:36:24,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 773 states to 554 states and 612 transitions. [2020-10-20 06:36:24,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2020-10-20 06:36:24,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2020-10-20 06:36:24,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 554 states and 612 transitions. [2020-10-20 06:36:24,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:24,503 INFO L691 BuchiCegarLoop]: Abstraction has 554 states and 612 transitions. [2020-10-20 06:36:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states and 612 transitions. [2020-10-20 06:36:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 350. [2020-10-20 06:36:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-10-20 06:36:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 377 transitions. [2020-10-20 06:36:24,512 INFO L714 BuchiCegarLoop]: Abstraction has 350 states and 377 transitions. [2020-10-20 06:36:24,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:24,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:36:24,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:36:24,513 INFO L87 Difference]: Start difference. First operand 350 states and 377 transitions. Second operand 9 states. [2020-10-20 06:36:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:24,596 INFO L93 Difference]: Finished difference Result 317 states and 348 transitions. [2020-10-20 06:36:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:36:24,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 348 transitions. [2020-10-20 06:36:24,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2020-10-20 06:36:24,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 267 states and 298 transitions. [2020-10-20 06:36:24,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:24,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:24,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 298 transitions. [2020-10-20 06:36:24,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:24,604 INFO L691 BuchiCegarLoop]: Abstraction has 267 states and 298 transitions. [2020-10-20 06:36:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states and 298 transitions. [2020-10-20 06:36:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 144. [2020-10-20 06:36:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-20 06:36:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2020-10-20 06:36:24,609 INFO L714 BuchiCegarLoop]: Abstraction has 144 states and 159 transitions. [2020-10-20 06:36:24,609 INFO L594 BuchiCegarLoop]: Abstraction has 144 states and 159 transitions. [2020-10-20 06:36:24,609 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-20 06:36:24,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 159 transitions. [2020-10-20 06:36:24,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2020-10-20 06:36:24,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:24,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:24,617 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:24,617 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [17, 16, 16, 10, 7, 1, 1] [2020-10-20 06:36:24,617 INFO L794 eck$LassoCheckResult]: Stem: 13037#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; 13038#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13050#L12 assume !(10 == main_~i~0); 13047#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13044#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13041#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13042#L12 assume !(10 == main_~i~0); 13035#L12-2 assume !(0 == main_~i~0); 13036#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13045#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13143#L12 assume !(10 == main_~i~0); 13142#L12-2 assume !(0 == main_~i~0); 13140#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13138#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13137#L12 assume !(10 == main_~i~0); 13136#L12-2 assume !(0 == main_~i~0); 13134#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13132#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13130#L12 assume !(10 == main_~i~0); 13128#L12-2 assume !(0 == main_~i~0); 13126#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13124#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13122#L12 assume !(10 == main_~i~0); 13120#L12-2 assume !(0 == main_~i~0); 13118#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13116#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13114#L12 assume !(10 == main_~i~0); 13112#L12-2 assume !(0 == main_~i~0); 13110#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13108#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13106#L12 assume !(10 == main_~i~0); 13104#L12-2 assume !(0 == main_~i~0); 13102#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13100#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13098#L12 assume !(10 == main_~i~0); 13096#L12-2 assume !(0 == main_~i~0); 13085#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13093#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13092#L12 assume !(10 == main_~i~0); 13083#L12-2 assume !(0 == main_~i~0); 13084#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13141#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13139#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13033#L12-2 [2020-10-20 06:36:24,617 INFO L796 eck$LassoCheckResult]: Loop: 13033#L12-2 assume !(0 == main_~i~0); 13034#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13135#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13133#L12 assume !(10 == main_~i~0); 13131#L12-2 assume !(0 == main_~i~0); 13129#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13127#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13125#L12 assume !(10 == main_~i~0); 13123#L12-2 assume !(0 == main_~i~0); 13121#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13119#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13117#L12 assume !(10 == main_~i~0); 13115#L12-2 assume !(0 == main_~i~0); 13113#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13111#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13109#L12 assume !(10 == main_~i~0); 13107#L12-2 assume !(0 == main_~i~0); 13105#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13103#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13101#L12 assume !(10 == main_~i~0); 13099#L12-2 assume !(0 == main_~i~0); 13097#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13095#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13094#L12 assume !(10 == main_~i~0); 13089#L12-2 assume !(0 == main_~i~0); 13091#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 13090#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13087#L12 assume !(10 == main_~i~0); 13081#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 13082#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13176#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13175#L12 assume !(10 == main_~i~0); 13086#L12-2 assume !(0 == main_~i~0); 13046#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13039#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13040#L12 assume !(10 == main_~i~0); 13043#L12-2 assume !(0 == main_~i~0); 13174#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13173#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13172#L12 assume !(10 == main_~i~0); 13171#L12-2 assume !(0 == main_~i~0); 13170#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13169#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13168#L12 assume !(10 == main_~i~0); 13167#L12-2 assume !(0 == main_~i~0); 13166#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13165#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13164#L12 assume !(10 == main_~i~0); 13163#L12-2 assume !(0 == main_~i~0); 13162#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13161#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13160#L12 assume !(10 == main_~i~0); 13159#L12-2 assume !(0 == main_~i~0); 13158#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13157#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13156#L12 assume !(10 == main_~i~0); 13155#L12-2 assume !(0 == main_~i~0); 13154#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13153#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13152#L12 assume !(10 == main_~i~0); 13151#L12-2 assume !(0 == main_~i~0); 13150#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13148#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13146#L12 assume !(10 == main_~i~0); 13144#L12-2 assume !(0 == main_~i~0); 13145#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 13149#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 13147#L12 assume 10 == main_~i~0;main_~up~0 := 0; 13033#L12-2 [2020-10-20 06:36:24,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,618 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 13 times [2020-10-20 06:36:24,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:24,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881418353] [2020-10-20 06:36:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,634 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1847643336, now seen corresponding path program 14 times [2020-10-20 06:36:24,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:24,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725435386] [2020-10-20 06:36:24,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,646 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:24,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:24,657 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1125533446, now seen corresponding path program 6 times [2020-10-20 06:36:24,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:24,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132753573] [2020-10-20 06:36:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:24,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132753573] [2020-10-20 06:36:24,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399519424] [2020-10-20 06:36:24,762 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:24,822 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2020-10-20 06:36:24,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:24,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 06:36:24,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 996 proven. 91 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:24,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:24,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-10-20 06:36:24,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422836909] [2020-10-20 06:36:25,226 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 64 [2020-10-20 06:36:25,235 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:25,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:25,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:25,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:25,236 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:25,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,237 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:25,237 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:25,237 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration23_Loop [2020-10-20 06:36:25,237 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:25,237 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:25,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:25,311 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:25,314 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:25,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:25,341 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:25,360 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:25,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:25,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:25,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:25,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:25,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:25,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:25,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration23_Loop [2020-10-20 06:36:25,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:25,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:25,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:25,442 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:25,442 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,445 INFO L120 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 [2020-10-20 06:36:25,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:25,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:25,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:25,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:25,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:25,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:25,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:25,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:25,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:25,451 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:25,453 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:25,453 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:25,454 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:25,454 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 17 Supporting invariants [] [2020-10-20 06:36:25,473 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:25,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:25,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:25,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:25,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:25,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 373 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:25,630 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 [2020-10-20 06:36:25,631 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 144 states and 159 transitions. cyclomatic complexity: 19 Second operand 11 states. [2020-10-20 06:36:26,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 144 states and 159 transitions. cyclomatic complexity: 19. Second operand 11 states. Result 909 states and 1006 transitions. Complement of second has 35 states. [2020-10-20 06:36:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 1 stem states 16 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 06:36:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 80 transitions. [2020-10-20 06:36:26,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 68 letters. [2020-10-20 06:36:26,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:26,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 111 letters. Loop has 68 letters. [2020-10-20 06:36:26,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:26,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 80 transitions. Stem has 43 letters. Loop has 136 letters. [2020-10-20 06:36:26,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:26,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 909 states and 1006 transitions. [2020-10-20 06:36:26,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2020-10-20 06:36:26,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 909 states to 626 states and 694 transitions. [2020-10-20 06:36:26,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2020-10-20 06:36:26,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2020-10-20 06:36:26,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 694 transitions. [2020-10-20 06:36:26,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:26,289 INFO L691 BuchiCegarLoop]: Abstraction has 626 states and 694 transitions. [2020-10-20 06:36:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 694 transitions. [2020-10-20 06:36:26,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 358. [2020-10-20 06:36:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-10-20 06:36:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 386 transitions. [2020-10-20 06:36:26,298 INFO L714 BuchiCegarLoop]: Abstraction has 358 states and 386 transitions. [2020-10-20 06:36:26,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:36:26,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:36:26,299 INFO L87 Difference]: Start difference. First operand 358 states and 386 transitions. Second operand 10 states. [2020-10-20 06:36:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:26,373 INFO L93 Difference]: Finished difference Result 345 states and 379 transitions. [2020-10-20 06:36:26,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:36:26,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 379 transitions. [2020-10-20 06:36:26,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-10-20 06:36:26,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 287 states and 321 transitions. [2020-10-20 06:36:26,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:26,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:26,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 287 states and 321 transitions. [2020-10-20 06:36:26,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:26,378 INFO L691 BuchiCegarLoop]: Abstraction has 287 states and 321 transitions. [2020-10-20 06:36:26,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states and 321 transitions. [2020-10-20 06:36:26,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 152. [2020-10-20 06:36:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-20 06:36:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2020-10-20 06:36:26,382 INFO L714 BuchiCegarLoop]: Abstraction has 152 states and 168 transitions. [2020-10-20 06:36:26,382 INFO L594 BuchiCegarLoop]: Abstraction has 152 states and 168 transitions. [2020-10-20 06:36:26,382 INFO L427 BuchiCegarLoop]: ======== Iteration 24============ [2020-10-20 06:36:26,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 168 transitions. [2020-10-20 06:36:26,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2020-10-20 06:36:26,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:26,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:26,384 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:26,384 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 10, 8, 1, 1] [2020-10-20 06:36:26,385 INFO L794 eck$LassoCheckResult]: Stem: 15545#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; 15546#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15559#L12 assume !(10 == main_~i~0); 15556#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15552#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15549#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15550#L12 assume !(10 == main_~i~0); 15543#L12-2 assume !(0 == main_~i~0); 15544#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15553#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15658#L12 assume !(10 == main_~i~0); 15657#L12-2 assume !(0 == main_~i~0); 15655#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15653#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15651#L12 assume !(10 == main_~i~0); 15649#L12-2 assume !(0 == main_~i~0); 15647#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15645#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15643#L12 assume !(10 == main_~i~0); 15641#L12-2 assume !(0 == main_~i~0); 15639#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15637#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15635#L12 assume !(10 == main_~i~0); 15633#L12-2 assume !(0 == main_~i~0); 15631#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15629#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15627#L12 assume !(10 == main_~i~0); 15625#L12-2 assume !(0 == main_~i~0); 15623#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15621#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15619#L12 assume !(10 == main_~i~0); 15617#L12-2 assume !(0 == main_~i~0); 15615#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15613#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15611#L12 assume !(10 == main_~i~0); 15609#L12-2 assume !(0 == main_~i~0); 15599#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15606#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15605#L12 assume !(10 == main_~i~0); 15597#L12-2 assume !(0 == main_~i~0); 15598#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15660#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15659#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15541#L12-2 [2020-10-20 06:36:26,385 INFO L796 eck$LassoCheckResult]: Loop: 15541#L12-2 assume !(0 == main_~i~0); 15542#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15656#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15654#L12 assume !(10 == main_~i~0); 15652#L12-2 assume !(0 == main_~i~0); 15650#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15648#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15646#L12 assume !(10 == main_~i~0); 15644#L12-2 assume !(0 == main_~i~0); 15642#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15640#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15638#L12 assume !(10 == main_~i~0); 15636#L12-2 assume !(0 == main_~i~0); 15634#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15632#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15630#L12 assume !(10 == main_~i~0); 15628#L12-2 assume !(0 == main_~i~0); 15626#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15624#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15622#L12 assume !(10 == main_~i~0); 15620#L12-2 assume !(0 == main_~i~0); 15618#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15616#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15614#L12 assume !(10 == main_~i~0); 15612#L12-2 assume !(0 == main_~i~0); 15610#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15608#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15607#L12 assume !(10 == main_~i~0); 15602#L12-2 assume !(0 == main_~i~0); 15604#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 15603#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15600#L12 assume !(10 == main_~i~0); 15594#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 15554#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15555#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15692#L12 assume !(10 == main_~i~0); 15595#L12-2 assume !(0 == main_~i~0); 15596#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15547#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15548#L12 assume !(10 == main_~i~0); 15551#L12-2 assume !(0 == main_~i~0); 15691#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15690#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15689#L12 assume !(10 == main_~i~0); 15688#L12-2 assume !(0 == main_~i~0); 15687#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15686#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15685#L12 assume !(10 == main_~i~0); 15684#L12-2 assume !(0 == main_~i~0); 15683#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15682#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15681#L12 assume !(10 == main_~i~0); 15680#L12-2 assume !(0 == main_~i~0); 15679#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15678#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15677#L12 assume !(10 == main_~i~0); 15676#L12-2 assume !(0 == main_~i~0); 15675#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15674#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15673#L12 assume !(10 == main_~i~0); 15672#L12-2 assume !(0 == main_~i~0); 15671#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15670#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15669#L12 assume !(10 == main_~i~0); 15668#L12-2 assume !(0 == main_~i~0); 15667#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15665#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15663#L12 assume !(10 == main_~i~0); 15661#L12-2 assume !(0 == main_~i~0); 15662#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 15666#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 15664#L12 assume 10 == main_~i~0;main_~up~0 := 0; 15541#L12-2 [2020-10-20 06:36:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:26,385 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 14 times [2020-10-20 06:36:26,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:26,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599636460] [2020-10-20 06:36:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:26,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:26,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:26,397 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:26,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:26,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1176703283, now seen corresponding path program 15 times [2020-10-20 06:36:26,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:26,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102153873] [2020-10-20 06:36:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:26,406 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:26,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:26,415 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1395997809, now seen corresponding path program 7 times [2020-10-20 06:36:26,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:26,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678084881] [2020-10-20 06:36:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:26,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:26,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678084881] [2020-10-20 06:36:26,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488921299] [2020-10-20 06:36:26,502 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:26,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-20 06:36:26,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 1077 proven. 120 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:26,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:26,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-10-20 06:36:26,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741737501] [2020-10-20 06:36:26,970 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 67 [2020-10-20 06:36:26,978 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:26,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:26,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:26,979 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:26,979 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:26,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:26,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:26,979 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:26,979 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration24_Loop [2020-10-20 06:36:26,979 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:26,979 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:26,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:26,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,042 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:27,042 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:27,052 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:27,052 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:27,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:27,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 06:36:27,088 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:27,109 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:27,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:27,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:27,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:27,109 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:27,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:27,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:27,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:27,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration24_Loop [2020-10-20 06:36:27,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:27,110 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:27,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:27,182 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:27,182 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:27,185 INFO L120 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 [2020-10-20 06:36:27,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:27,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:27,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:27,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:27,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:27,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:27,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:27,214 INFO L120 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 [2020-10-20 06:36:27,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:27,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:27,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:27,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:27,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:27,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:27,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:27,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:27,220 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:27,220 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:27,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:27,223 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:27,224 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:27,224 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 9 Supporting invariants [] [2020-10-20 06:36:27,246 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:27,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:27,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:27,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:27,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-20 06:36:27,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:27,400 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 [2020-10-20 06:36:27,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 152 states and 168 transitions. cyclomatic complexity: 20 Second operand 12 states. [2020-10-20 06:36:27,941 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 152 states and 168 transitions. cyclomatic complexity: 20. Second operand 12 states. Result 1066 states and 1182 transitions. Complement of second has 39 states. [2020-10-20 06:36:27,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 1 stem states 18 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-20 06:36:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2020-10-20 06:36:27,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 72 letters. [2020-10-20 06:36:27,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:27,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 115 letters. Loop has 72 letters. [2020-10-20 06:36:27,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:27,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 89 transitions. Stem has 43 letters. Loop has 144 letters. [2020-10-20 06:36:27,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:27,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1066 states and 1182 transitions. [2020-10-20 06:36:27,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 77 [2020-10-20 06:36:27,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1066 states to 711 states and 790 transitions. [2020-10-20 06:36:27,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2020-10-20 06:36:27,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2020-10-20 06:36:27,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 711 states and 790 transitions. [2020-10-20 06:36:27,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:27,959 INFO L691 BuchiCegarLoop]: Abstraction has 711 states and 790 transitions. [2020-10-20 06:36:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states and 790 transitions. [2020-10-20 06:36:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 370. [2020-10-20 06:36:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-10-20 06:36:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 399 transitions. [2020-10-20 06:36:27,967 INFO L714 BuchiCegarLoop]: Abstraction has 370 states and 399 transitions. [2020-10-20 06:36:27,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:36:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:36:27,968 INFO L87 Difference]: Start difference. First operand 370 states and 399 transitions. Second operand 11 states. [2020-10-20 06:36:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:28,055 INFO L93 Difference]: Finished difference Result 373 states and 410 transitions. [2020-10-20 06:36:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:36:28,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 410 transitions. [2020-10-20 06:36:28,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2020-10-20 06:36:28,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 307 states and 344 transitions. [2020-10-20 06:36:28,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:28,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:28,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 344 transitions. [2020-10-20 06:36:28,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:28,060 INFO L691 BuchiCegarLoop]: Abstraction has 307 states and 344 transitions. [2020-10-20 06:36:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 344 transitions. [2020-10-20 06:36:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 160. [2020-10-20 06:36:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-10-20 06:36:28,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 177 transitions. [2020-10-20 06:36:28,064 INFO L714 BuchiCegarLoop]: Abstraction has 160 states and 177 transitions. [2020-10-20 06:36:28,064 INFO L594 BuchiCegarLoop]: Abstraction has 160 states and 177 transitions. [2020-10-20 06:36:28,064 INFO L427 BuchiCegarLoop]: ======== Iteration 25============ [2020-10-20 06:36:28,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 177 transitions. [2020-10-20 06:36:28,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2020-10-20 06:36:28,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:28,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:28,066 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:28,067 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [19, 18, 18, 10, 9, 1, 1] [2020-10-20 06:36:28,067 INFO L794 eck$LassoCheckResult]: Stem: 18290#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; 18291#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18305#L12 assume !(10 == main_~i~0); 18302#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18298#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18294#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18295#L12 assume !(10 == main_~i~0); 18297#L12-2 assume !(0 == main_~i~0); 18412#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18410#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18408#L12 assume !(10 == main_~i~0); 18406#L12-2 assume !(0 == main_~i~0); 18404#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18402#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18400#L12 assume !(10 == main_~i~0); 18398#L12-2 assume !(0 == main_~i~0); 18396#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18394#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18392#L12 assume !(10 == main_~i~0); 18390#L12-2 assume !(0 == main_~i~0); 18388#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18386#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18384#L12 assume !(10 == main_~i~0); 18382#L12-2 assume !(0 == main_~i~0); 18380#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18378#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18376#L12 assume !(10 == main_~i~0); 18374#L12-2 assume !(0 == main_~i~0); 18372#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18370#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18368#L12 assume !(10 == main_~i~0); 18366#L12-2 assume !(0 == main_~i~0); 18364#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18362#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18360#L12 assume !(10 == main_~i~0); 18358#L12-2 assume !(0 == main_~i~0); 18347#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18355#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18354#L12 assume !(10 == main_~i~0); 18345#L12-2 assume !(0 == main_~i~0); 18346#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18414#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18413#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18287#L12-2 [2020-10-20 06:36:28,067 INFO L796 eck$LassoCheckResult]: Loop: 18287#L12-2 assume !(0 == main_~i~0); 18288#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18299#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18411#L12 assume !(10 == main_~i~0); 18409#L12-2 assume !(0 == main_~i~0); 18407#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18405#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18403#L12 assume !(10 == main_~i~0); 18401#L12-2 assume !(0 == main_~i~0); 18399#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18397#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18395#L12 assume !(10 == main_~i~0); 18393#L12-2 assume !(0 == main_~i~0); 18391#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18389#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18387#L12 assume !(10 == main_~i~0); 18385#L12-2 assume !(0 == main_~i~0); 18383#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18381#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18379#L12 assume !(10 == main_~i~0); 18377#L12-2 assume !(0 == main_~i~0); 18375#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18373#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18371#L12 assume !(10 == main_~i~0); 18369#L12-2 assume !(0 == main_~i~0); 18367#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18365#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18363#L12 assume !(10 == main_~i~0); 18361#L12-2 assume !(0 == main_~i~0); 18359#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18357#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18356#L12 assume !(10 == main_~i~0); 18351#L12-2 assume !(0 == main_~i~0); 18353#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 18352#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18350#L12 assume !(10 == main_~i~0); 18344#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 18300#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18301#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18446#L12 assume !(10 == main_~i~0); 18348#L12-2 assume !(0 == main_~i~0); 18349#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18292#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18293#L12 assume !(10 == main_~i~0); 18296#L12-2 assume !(0 == main_~i~0); 18445#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18444#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18443#L12 assume !(10 == main_~i~0); 18442#L12-2 assume !(0 == main_~i~0); 18441#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18439#L12 assume !(10 == main_~i~0); 18438#L12-2 assume !(0 == main_~i~0); 18437#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18436#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18435#L12 assume !(10 == main_~i~0); 18434#L12-2 assume !(0 == main_~i~0); 18433#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); 18431#L12 assume !(10 == main_~i~0); 18430#L12-2 assume !(0 == main_~i~0); 18429#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18428#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18427#L12 assume !(10 == main_~i~0); 18426#L12-2 assume !(0 == main_~i~0); 18425#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18424#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18423#L12 assume !(10 == main_~i~0); 18422#L12-2 assume !(0 == main_~i~0); 18421#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18419#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18417#L12 assume !(10 == main_~i~0); 18415#L12-2 assume !(0 == main_~i~0); 18416#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 18420#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 18418#L12 assume 10 == main_~i~0;main_~up~0 := 0; 18287#L12-2 [2020-10-20 06:36:28,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 15 times [2020-10-20 06:36:28,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:28,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016065236] [2020-10-20 06:36:28,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:28,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:28,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:28,079 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash 289875998, now seen corresponding path program 16 times [2020-10-20 06:36:28,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:28,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758257671] [2020-10-20 06:36:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:28,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:28,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:28,106 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1498053540, now seen corresponding path program 8 times [2020-10-20 06:36:28,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:28,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64939187] [2020-10-20 06:36:28,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:28,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64939187] [2020-10-20 06:36:28,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345863676] [2020-10-20 06:36:28,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 06:36:28,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 06:36:28,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 06:36:28,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 06:36:28,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 1158 proven. 153 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-10-20 06:36:28,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 06:36:28,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2020-10-20 06:36:28,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682853548] [2020-10-20 06:36:28,973 WARN L193 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 76 [2020-10-20 06:36:28,997 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:28,997 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:28,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:28,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:28,998 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 06:36:28,998 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:28,998 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:28,998 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:28,998 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration25_Loop [2020-10-20 06:36:28,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:28,999 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:29,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,140 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:29,140 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:29,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:29,149 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:29,154 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 06:36:29,154 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_27=1} Honda state: {v_rep~unnamed0~0~true_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:29,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 06:36:29,196 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 06:36:29,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 06:36:29,236 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:29,344 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 06:36:29,346 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 06:36:29,346 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 06:36:29,346 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 06:36:29,346 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 06:36:29,346 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 06:36:29,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:29,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 06:36:29,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 06:36:29,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDown.c_Iteration25_Loop [2020-10-20 06:36:29,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 06:36:29,347 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 06:36:29,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 06:36:29,442 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 06:36:29,442 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:29,448 INFO L120 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 [2020-10-20 06:36:29,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:29,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:29,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:29,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:29,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 06:36:29,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 06:36:29,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:29,478 INFO L120 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 [2020-10-20 06:36:29,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 06:36:29,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 06:36:29,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 06:36:29,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 06:36:29,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 06:36:29,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 06:36:29,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 06:36:29,482 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 06:36:29,485 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 06:36:29,485 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 06:36:29,493 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 06:36:29,493 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 06:36:29,493 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 06:36:29,493 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-10-20 06:36:29,514 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 06:36:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:29,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 06:36:29,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:36:29,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 06:36:29,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 06:36:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-10-20 06:36:29,726 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 [2020-10-20 06:36:29,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 160 states and 177 transitions. cyclomatic complexity: 21 Second operand 13 states. [2020-10-20 06:36:30,525 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 160 states and 177 transitions. cyclomatic complexity: 21. Second operand 13 states. Result 1253 states and 1393 transitions. Complement of second has 43 states. [2020-10-20 06:36:30,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 22 states 1 stem states 20 non-accepting loop states 1 accepting loop states [2020-10-20 06:36:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 06:36:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 98 transitions. [2020-10-20 06:36:30,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 76 letters. [2020-10-20 06:36:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:30,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 119 letters. Loop has 76 letters. [2020-10-20 06:36:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:30,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 98 transitions. Stem has 43 letters. Loop has 152 letters. [2020-10-20 06:36:30,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 06:36:30,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1253 states and 1393 transitions. [2020-10-20 06:36:30,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2020-10-20 06:36:30,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1253 states to 817 states and 911 transitions. [2020-10-20 06:36:30,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2020-10-20 06:36:30,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2020-10-20 06:36:30,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 817 states and 911 transitions. [2020-10-20 06:36:30,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:30,545 INFO L691 BuchiCegarLoop]: Abstraction has 817 states and 911 transitions. [2020-10-20 06:36:30,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states and 911 transitions. [2020-10-20 06:36:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 394. [2020-10-20 06:36:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-10-20 06:36:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 426 transitions. [2020-10-20 06:36:30,554 INFO L714 BuchiCegarLoop]: Abstraction has 394 states and 426 transitions. [2020-10-20 06:36:30,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:36:30,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:36:30,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:36:30,555 INFO L87 Difference]: Start difference. First operand 394 states and 426 transitions. Second operand 12 states. [2020-10-20 06:36:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:36:30,656 INFO L93 Difference]: Finished difference Result 401 states and 441 transitions. [2020-10-20 06:36:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:36:30,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 441 transitions. [2020-10-20 06:36:30,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2020-10-20 06:36:30,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 327 states and 367 transitions. [2020-10-20 06:36:30,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-10-20 06:36:30,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-10-20 06:36:30,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 327 states and 367 transitions. [2020-10-20 06:36:30,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 06:36:30,671 INFO L691 BuchiCegarLoop]: Abstraction has 327 states and 367 transitions. [2020-10-20 06:36:30,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states and 367 transitions. [2020-10-20 06:36:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 168. [2020-10-20 06:36:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-20 06:36:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2020-10-20 06:36:30,675 INFO L714 BuchiCegarLoop]: Abstraction has 168 states and 186 transitions. [2020-10-20 06:36:30,675 INFO L594 BuchiCegarLoop]: Abstraction has 168 states and 186 transitions. [2020-10-20 06:36:30,675 INFO L427 BuchiCegarLoop]: ======== Iteration 26============ [2020-10-20 06:36:30,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 186 transitions. [2020-10-20 06:36:30,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2020-10-20 06:36:30,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 06:36:30,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 06:36:30,678 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 9, 1, 1, 1] [2020-10-20 06:36:30,678 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2020-10-20 06:36:30,678 INFO L794 eck$LassoCheckResult]: Stem: 21316#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; 21317#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21329#L12 assume !(10 == main_~i~0); 21328#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21324#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21325#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21446#L12 assume !(10 == main_~i~0); 21444#L12-2 assume !(0 == main_~i~0); 21442#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21440#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21438#L12 assume !(10 == main_~i~0); 21436#L12-2 assume !(0 == main_~i~0); 21434#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); 21430#L12 assume !(10 == main_~i~0); 21428#L12-2 assume !(0 == main_~i~0); 21426#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); 21422#L12 assume !(10 == main_~i~0); 21420#L12-2 assume !(0 == main_~i~0); 21418#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); 21414#L12 assume !(10 == main_~i~0); 21412#L12-2 assume !(0 == main_~i~0); 21410#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); 21406#L12 assume !(10 == main_~i~0); 21404#L12-2 assume !(0 == main_~i~0); 21402#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21400#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21398#L12 assume !(10 == main_~i~0); 21396#L12-2 assume !(0 == main_~i~0); 21394#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21392#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21390#L12 assume !(10 == main_~i~0); 21388#L12-2 assume !(0 == main_~i~0); 21379#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21385#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21384#L12 assume !(10 == main_~i~0); 21377#L12-2 assume !(0 == main_~i~0); 21378#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21448#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21447#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21313#L12-2 [2020-10-20 06:36:30,678 INFO L796 eck$LassoCheckResult]: Loop: 21313#L12-2 assume !(0 == main_~i~0); 21314#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21320#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21321#L12 assume !(10 == main_~i~0); 21323#L12-2 assume !(0 == main_~i~0); 21445#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21443#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21441#L12 assume !(10 == main_~i~0); 21439#L12-2 assume !(0 == main_~i~0); 21437#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21435#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21433#L12 assume !(10 == main_~i~0); 21431#L12-2 assume !(0 == main_~i~0); 21429#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21427#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21425#L12 assume !(10 == main_~i~0); 21423#L12-2 assume !(0 == main_~i~0); 21421#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21419#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21417#L12 assume !(10 == main_~i~0); 21415#L12-2 assume !(0 == main_~i~0); 21413#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21411#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21409#L12 assume !(10 == main_~i~0); 21407#L12-2 assume !(0 == main_~i~0); 21405#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21403#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21401#L12 assume !(10 == main_~i~0); 21399#L12-2 assume !(0 == main_~i~0); 21397#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21395#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21393#L12 assume !(10 == main_~i~0); 21391#L12-2 assume !(0 == main_~i~0); 21389#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21387#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21386#L12 assume !(10 == main_~i~0); 21381#L12-2 assume !(0 == main_~i~0); 21383#L15-1 assume !(1 == main_~up~0);main_~i~0 := main_~i~0 - 1; 21382#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21380#L12 assume !(10 == main_~i~0); 21374#L12-2 assume 0 == main_~i~0;main_~up~0 := 1; 21326#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21327#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21480#L12 assume !(10 == main_~i~0); 21375#L12-2 assume !(0 == main_~i~0); 21376#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21318#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21319#L12 assume !(10 == main_~i~0); 21322#L12-2 assume !(0 == main_~i~0); 21479#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21478#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21477#L12 assume !(10 == main_~i~0); 21476#L12-2 assume !(0 == main_~i~0); 21475#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21474#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21473#L12 assume !(10 == main_~i~0); 21472#L12-2 assume !(0 == main_~i~0); 21471#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21470#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21469#L12 assume !(10 == main_~i~0); 21468#L12-2 assume !(0 == main_~i~0); 21467#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21466#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21465#L12 assume !(10 == main_~i~0); 21464#L12-2 assume !(0 == main_~i~0); 21463#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21462#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21461#L12 assume !(10 == main_~i~0); 21460#L12-2 assume !(0 == main_~i~0); 21459#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21458#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21457#L12 assume !(10 == main_~i~0); 21456#L12-2 assume !(0 == main_~i~0); 21455#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21454#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21452#L12 assume !(10 == main_~i~0); 21449#L12-2 assume !(0 == main_~i~0); 21450#L15-1 assume 1 == main_~up~0;main_~i~0 := 1 + main_~i~0; 21453#L18-1 assume !!(0 <= main_~i~0 && main_~i~0 <= 10); 21451#L12 assume 10 == main_~i~0;main_~up~0 := 0; 21313#L12-2 [2020-10-20 06:36:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash 180435263, now seen corresponding path program 16 times [2020-10-20 06:36:30,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:30,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124773837] [2020-10-20 06:36:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:30,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:30,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:30,691 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:30,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:30,692 INFO L82 PathProgramCache]: Analyzing trace with hash -312487543, now seen corresponding path program 17 times [2020-10-20 06:36:30,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:30,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603330441] [2020-10-20 06:36:30,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:30,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:30,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:30,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:36:30,716 INFO L82 PathProgramCache]: Analyzing trace with hash 799661767, now seen corresponding path program 9 times [2020-10-20 06:36:30,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:36:30,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081056740] [2020-10-20 06:36:30,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:36:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:30,729 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 06:36:30,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 06:36:30,752 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 06:36:31,287 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 82 [2020-10-20 06:36:31,518 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 43 [2020-10-20 06:36:31,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 06:36:31 BoogieIcfgContainer [2020-10-20 06:36:31,553 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 06:36:31,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:36:31,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:36:31,554 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:36:31,555 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:36:09" (3/4) ... [2020-10-20 06:36:31,558 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 06:36:31,626 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:36:31,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:36:31,628 INFO L168 Benchmark]: Toolchain (without parser) took 22365.20 ms. Allocated memory was 40.9 MB in the beginning and 152.0 MB in the end (delta: 111.1 MB). Free memory was 20.0 MB in the beginning and 65.6 MB in the end (delta: -45.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,629 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 31.5 MB. Free memory was 9.2 MB in the beginning and 9.1 MB in the end (delta: 87.6 kB). Peak memory consumption was 87.6 kB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.44 ms. Allocated memory was 40.9 MB in the beginning and 41.4 MB in the end (delta: 524.3 kB). Free memory was 19.2 MB in the beginning and 21.7 MB in the end (delta: -2.5 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 41.4 MB. Free memory was 21.7 MB in the beginning and 20.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,630 INFO L168 Benchmark]: Boogie Preprocessor took 20.58 ms. Allocated memory is still 41.4 MB. Free memory was 20.3 MB in the beginning and 19.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,630 INFO L168 Benchmark]: RCFGBuilder took 216.57 ms. Allocated memory is still 41.4 MB. Free memory was 18.9 MB in the beginning and 10.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,631 INFO L168 Benchmark]: BuchiAutomizer took 21743.48 ms. Allocated memory was 41.4 MB in the beginning and 152.0 MB in the end (delta: 110.6 MB). Free memory was 9.8 MB in the beginning and 72.7 MB in the end (delta: -62.9 MB). Peak memory consumption was 114.0 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,631 INFO L168 Benchmark]: Witness Printer took 73.42 ms. Allocated memory is still 152.0 MB. Free memory was 72.7 MB in the beginning and 65.6 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. [2020-10-20 06:36:31,634 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 31.5 MB. Free memory was 9.2 MB in the beginning and 9.1 MB in the end (delta: 87.6 kB). Peak memory consumption was 87.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 264.44 ms. Allocated memory was 40.9 MB in the beginning and 41.4 MB in the end (delta: 524.3 kB). Free memory was 19.2 MB in the beginning and 21.7 MB in the end (delta: -2.5 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 36.98 ms. Allocated memory is still 41.4 MB. Free memory was 21.7 MB in the beginning and 20.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 20.58 ms. Allocated memory is still 41.4 MB. Free memory was 20.3 MB in the beginning and 19.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 216.57 ms. Allocated memory is still 41.4 MB. Free memory was 18.9 MB in the beginning and 10.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 21743.48 ms. Allocated memory was 41.4 MB in the beginning and 152.0 MB in the end (delta: 110.6 MB). Free memory was 9.8 MB in the beginning and 72.7 MB in the end (delta: -62.9 MB). Peak memory consumption was 114.0 MB. Max. memory is 14.3 GB. * Witness Printer took 73.42 ms. Allocated memory is still 152.0 MB. Free memory was 72.7 MB in the beginning and 65.6 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 36 terminating modules (22 trivial, 13 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 5 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 13 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + 7 and consists of 12 locations. One deterministic module has affine ranking function -2 * i + 15 and consists of 14 locations. One deterministic module has affine ranking function -1 * i + 8 and consists of 16 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 18 locations. One deterministic module has affine ranking function -1 * i + 9 and consists of 20 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 22 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 22 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 168 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.6s and 26 iterations. TraceHistogramMax:20. Analysis of lassos took 14.5s. Construction of modules took 2.0s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 35. Automata minimization 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 2596 StatesRemovedByMinimization, 35 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 168 states and ocurred in iteration 25. Nontrivial modules had stage [13, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1197/3416 HoareTripleCheckerStatistics: 270 SDtfs, 849 SDslu, 9 SDs, 0 SdLazy, 2288 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT3 conc0 concLT9 SILN0 SILU0 SILI8 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax164 hnf95 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq183 hnf93 smp90 dnf136 smp96 tf108 neg93 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 23 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 14 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s - 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@3670c6c8=0, \result=0, i=10} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 Loop: [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND TRUE i == 0 [L16] up = 1 [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i == 10) [L15] COND FALSE !(i == 0) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i == 10 [L13] up = 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...