./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex06.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/Ex06.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 3ac2445d235ff9d71a6974ac9afce215f9983492 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-8bd4bc6 [2020-07-29 01:29:48,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:48,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:48,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:48,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:48,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:48,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:48,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:48,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:49,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:49,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:49,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:49,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:49,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:49,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:49,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:49,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:49,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:49,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:49,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:49,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:49,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:49,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:49,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:49,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:49,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:49,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:49,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:49,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:49,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:49,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:49,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:49,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:49,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:49,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:49,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:49,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:49,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:49,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:49,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:49,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:49,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:29:49,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:49,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:49,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:49,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:49,061 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:49,061 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:49,062 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:49,062 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:49,062 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:49,062 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:49,063 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:49,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:49,063 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:49,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:49,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:49,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:49,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:49,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:49,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:49,065 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:49,065 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:49,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:49,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:49,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:49,066 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:49,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:49,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:49,066 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:49,067 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:49,068 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:49,068 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 -> 3ac2445d235ff9d71a6974ac9afce215f9983492 [2020-07-29 01:29:49,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:29:49,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:29:49,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:29:49,421 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:29:49,422 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:29:49,422 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex06.c [2020-07-29 01:29:49,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed9b3810/a2bf0625465846468aff735a236b45d1/FLAGf4323b504 [2020-07-29 01:29:49,908 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:29:49,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex06.c [2020-07-29 01:29:49,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed9b3810/a2bf0625465846468aff735a236b45d1/FLAGf4323b504 [2020-07-29 01:29:50,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ed9b3810/a2bf0625465846468aff735a236b45d1 [2020-07-29 01:29:50,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:29:50,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:29:50,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:50,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:29:50,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:29:50,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f71a05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50, skipping insertion in model container [2020-07-29 01:29:50,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:29:50,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:29:50,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:50,486 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:29:50,498 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:29:50,511 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:29:50,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50 WrapperNode [2020-07-29 01:29:50,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:29:50,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:50,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:29:50,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:29:50,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:29:50,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:29:50,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:29:50,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:29:50,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (1/1) ... [2020-07-29 01:29:50,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:29:50,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:29:50,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:29:50,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:29:50,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (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-07-29 01:29:50,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:29:50,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:29:50,845 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:29:50,845 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:29:50,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:50 BoogieIcfgContainer [2020-07-29 01:29:50,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:29:50,849 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:29:50,849 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:29:50,852 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:29:50,853 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:50,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:29:50" (1/3) ... [2020-07-29 01:29:50,856 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bf4d5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:50, skipping insertion in model container [2020-07-29 01:29:50,856 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:50,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:29:50" (2/3) ... [2020-07-29 01:29:50,857 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bf4d5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:29:50, skipping insertion in model container [2020-07-29 01:29:50,857 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:29:50,857 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:50" (3/3) ... [2020-07-29 01:29:50,860 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ex06.c [2020-07-29 01:29:50,924 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:29:50,925 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:29:50,925 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:29:50,925 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:29:50,925 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:29:50,925 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:29:50,926 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:29:50,926 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:29:50,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:29:50,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:50,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,967 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:50,967 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:50,967 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:29:50,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:29:50,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:50,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:50,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:50,970 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:50,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:50,976 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 5#L13-1true [2020-07-29 01:29:50,977 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); 3#L10true assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; 9#L10-2true assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0; 5#L13-1true [2020-07-29 01:29:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:29:50,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:50,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517497440] [2020-07-29 01:29:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,054 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2020-07-29 01:29:51,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:51,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689679305] [2020-07-29 01:29:51,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:51,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); {14#true} is VALID [2020-07-29 01:29:51,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {14#true} assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; {16#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:29:51,161 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#(<= 0 ULTIMATE.start_main_~i~0)} assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0; {15#false} is VALID [2020-07-29 01:29:51,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:51,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689679305] [2020-07-29 01:29:51,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:29:51,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:29:51,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080586497] [2020-07-29 01:29:51,172 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:29:51,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:29:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:29:51,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:29:51,193 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-07-29 01:29:51,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:51,275 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-07-29 01:29:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:29:51,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:51,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:51,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-07-29 01:29:51,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:51,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 7 states and 10 transitions. [2020-07-29 01:29:51,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:29:51,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:29:51,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:29:51,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:51,301 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:29:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:29:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:29:51,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:51,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:29:51,337 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:29:51,342 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:29:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:51,343 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:29:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:29:51,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:51,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:51,347 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:29:51,348 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:29:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:51,353 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:29:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:29:51,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:51,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:51,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:51,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:29:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:29:51,362 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:29:51,362 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:29:51,363 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:51,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:29:51,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:51,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:51,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:51,364 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:29:51,364 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:51,364 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 36#L13-1 [2020-07-29 01:29:51,365 INFO L796 eck$LassoCheckResult]: Loop: 36#L13-1 assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); 32#L10 assume !(main_~i~0 > 0); 34#L10-2 assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0; 36#L13-1 [2020-07-29 01:29:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:29:51,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:51,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529613259] [2020-07-29 01:29:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,381 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,383 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:51,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:51,383 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2020-07-29 01:29:51,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:51,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120569405] [2020-07-29 01:29:51,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:51,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 1 times [2020-07-29 01:29:51,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:51,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329056977] [2020-07-29 01:29:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,410 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:51,414 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:51,416 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:51,477 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:51,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:51,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:51,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:51,479 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:51,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:51,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:51,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex06.c_Iteration2_Loop [2020-07-29 01:29:51,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:51,480 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:51,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,681 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:51,682 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-07-29 01:29:51,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:51,692 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 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-07-29 01:29:51,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:51,741 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-07-29 01:29:51,749 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:51,778 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:51,779 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:51,779 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:51,779 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:51,779 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:51,779 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,779 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:51,780 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:51,780 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex06.c_Iteration2_Loop [2020-07-29 01:29:51,780 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:51,780 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:51,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:51,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-07-29 01:29:51,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:51,941 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:29:51,946 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-07-29 01:29:51,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:51,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:51,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:51,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:51,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:51,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:51,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:51,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:51,980 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:51,981 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 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-07-29 01:29:51,988 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:51,989 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:51,989 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:51,990 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:29:52,015 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:52,019 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 >= -5 && main_~i~0 <= 5);" "assume !(main_~i~0 > 0);" "assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:29:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,058 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:52,073 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {62#unseeded} is VALID [2020-07-29 01:29:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,081 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:52,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:52,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); {65#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:29:52,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} assume !(main_~i~0 > 0); {65#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:29:52,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} assume main_~i~0 < 0;main_~i~0 := 1 + main_~i~0; {75#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:29:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:52,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:52,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:52,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,108 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:29:52,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:52,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2020-07-29 01:29:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:52,167 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:52,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:52,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:52,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:52,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:29:52,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:52,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,174 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:52,176 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:52,176 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:52,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:52,177 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:52,178 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 10 [2020-07-29 01:29:52,179 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:52,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:52,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:52,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:52,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:29:52,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:29:52,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:29:52,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:52,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:52,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:29:52,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:52,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:52,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:52,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:52,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:52,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:29:52,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:52,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:52,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:52,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:52,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:52,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,203 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:29:52,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:52,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:52,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:29:52,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. cyclomatic complexity: 10 [2020-07-29 01:29:52,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:52,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 13 states and 18 transitions. [2020-07-29 01:29:52,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:29:52,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:29:52,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-07-29 01:29:52,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:52,211 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:29:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-07-29 01:29:52,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2020-07-29 01:29:52,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:52,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand 8 states. [2020-07-29 01:29:52,214 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand 8 states. [2020-07-29 01:29:52,214 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 8 states. [2020-07-29 01:29:52,214 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:52,218 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 01:29:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:29:52,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:52,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:52,219 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 13 states and 18 transitions. [2020-07-29 01:29:52,219 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 13 states and 18 transitions. [2020-07-29 01:29:52,219 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:52,221 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 01:29:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:29:52,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:52,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:52,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:52,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:29:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:29:52,224 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:29:52,224 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:29:52,224 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:52,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:29:52,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:52,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:52,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:52,227 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:29:52,227 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:52,227 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 114#L13-1 assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); 109#L10 [2020-07-29 01:29:52,228 INFO L796 eck$LassoCheckResult]: Loop: 109#L10 assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; 110#L10-2 assume !(main_~i~0 < 0); 115#L13-1 assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); 109#L10 [2020-07-29 01:29:52,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:29:52,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:52,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704586051] [2020-07-29 01:29:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,238 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,244 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash 42945, now seen corresponding path program 1 times [2020-07-29 01:29:52,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:52,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670106158] [2020-07-29 01:29:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,259 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,265 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash 29863736, now seen corresponding path program 1 times [2020-07-29 01:29:52,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:52,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472399687] [2020-07-29 01:29:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:52,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:52,290 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:52,325 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:52,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:52,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:52,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:52,325 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:52,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:52,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:52,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex06.c_Iteration3_Loop [2020-07-29 01:29:52,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:52,326 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:52,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,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-07-29 01:29:52,448 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:52,448 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:29:52,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,460 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,465 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:52,465 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,513 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,518 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:52,518 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:52,568 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:52,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,721 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:52,725 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:52,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:52,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:52,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:52,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:52,725 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,726 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:52,726 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:52,726 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex06.c_Iteration3_Loop [2020-07-29 01:29:52,727 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:52,727 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:52,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:52,876 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:52,877 INFO L489 LassoAnalysis]: Using template 'affine'. 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-07-29 01:29:52,889 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-07-29 01:29:52,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:52,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:52,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:52,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:52,901 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:52,901 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,907 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:52,952 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-07-29 01:29:52,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:52,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:52,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:52,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:52,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:52,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:52,969 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:53,014 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-07-29 01:29:53,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:53,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:53,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:53,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:53,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:53,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:53,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:53,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:53,027 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:29:53,028 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:53,040 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:53,040 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:53,041 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:53,041 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:53,079 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:53,083 INFO L393 LassoCheck]: Loop: "assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1;" "assume !(main_~i~0 < 0);" "assume !!(main_~i~0 >= -5 && main_~i~0 <= 5);" [2020-07-29 01:29:53,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {179#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; {179#unseeded} is VALID [2020-07-29 01:29:53,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {179#unseeded} assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); {179#unseeded} is VALID [2020-07-29 01:29:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,129 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,227 INFO L280 TraceCheckUtils]: 0: Hoare triple {182#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume main_~i~0 > 0;main_~i~0 := main_~i~0 - 1; {200#(and (<= 1 oldRank0) (<= (+ ULTIMATE.start_main_~i~0 1) oldRank0))} is VALID [2020-07-29 01:29:53,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#(and (<= 1 oldRank0) (<= (+ ULTIMATE.start_main_~i~0 1) oldRank0))} assume !(main_~i~0 < 0); {200#(and (<= 1 oldRank0) (<= (+ ULTIMATE.start_main_~i~0 1) oldRank0))} is VALID [2020-07-29 01:29:53,229 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#(and (<= 1 oldRank0) (<= (+ ULTIMATE.start_main_~i~0 1) oldRank0))} assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); {192#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:53,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:53,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:53,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:29:53,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:29:53,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 5 states. [2020-07-29 01:29:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:53,268 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:53,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:53,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:29:53,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:53,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,273 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:53,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:29:53,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:53,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:53,275 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:53,275 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:53,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:53,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:53,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:53,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:29:53,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:53,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:53,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:29:53,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:29:53,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:53,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:53,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:53,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:53,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:29:53,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:29:53,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:29:53,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:29:53,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:53,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:53,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:53,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,300 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:29:53,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:29:53,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:29:53,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:29:53,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:53,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:53,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 27 transitions. [2020-07-29 01:29:53,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:29:53,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:29:53,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2020-07-29 01:29:53,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:53,308 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2020-07-29 01:29:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2020-07-29 01:29:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2020-07-29 01:29:53,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:53,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand 16 states. [2020-07-29 01:29:53,311 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand 16 states. [2020-07-29 01:29:53,311 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 16 states. [2020-07-29 01:29:53,312 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:53,314 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:29:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:29:53,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:53,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:53,315 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 20 states and 27 transitions. [2020-07-29 01:29:53,316 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 20 states and 27 transitions. [2020-07-29 01:29:53,316 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:53,319 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-29 01:29:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-29 01:29:53,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:53,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:53,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:53,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:29:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-07-29 01:29:53,322 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 01:29:53,322 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-29 01:29:53,322 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:53,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2020-07-29 01:29:53,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:53,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:29:53,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:53,325 INFO L794 eck$LassoCheckResult]: Stem: 240#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 241#L13-1 assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); 249#L10 assume !(main_~i~0 > 0); 236#L10-2 [2020-07-29 01:29:53,325 INFO L796 eck$LassoCheckResult]: Loop: 236#L10-2 assume !(main_~i~0 < 0); 245#L13-1 assume !!(main_~i~0 >= -5 && main_~i~0 <= 5); 235#L10 assume !(main_~i~0 > 0); 236#L10-2 [2020-07-29 01:29:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:29:53,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:53,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150457635] [2020-07-29 01:29:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:53,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:53,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:53,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:53,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,335 INFO L82 PathProgramCache]: Analyzing trace with hash 50297, now seen corresponding path program 1 times [2020-07-29 01:29:53,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:53,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829502148] [2020-07-29 01:29:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:53,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:53,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:53,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash 925835413, now seen corresponding path program 1 times [2020-07-29 01:29:53,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:53,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770195525] [2020-07-29 01:29:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:53,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:53,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:53,354 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:53,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:53 BoogieIcfgContainer [2020-07-29 01:29:53,430 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:53,430 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:53,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:53,431 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:53,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:29:50" (3/4) ... [2020-07-29 01:29:53,436 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:29:53,483 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:29:53,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:53,487 INFO L168 Benchmark]: Toolchain (without parser) took 3179.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 961.6 MB in the beginning and 828.2 MB in the end (delta: 133.4 MB). Peak memory consumption was 263.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,487 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:53,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,490 INFO L168 Benchmark]: Boogie Preprocessor took 19.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:53,491 INFO L168 Benchmark]: RCFGBuilder took 237.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,492 INFO L168 Benchmark]: BuchiAutomizer took 2581.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 828.2 MB in the end (delta: 279.8 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:53,492 INFO L168 Benchmark]: Witness Printer took 52.82 ms. Allocated memory is still 1.2 GB. Free memory is still 828.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:53,496 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 237.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2581.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 828.2 MB in the end (delta: 279.8 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. * Witness Printer took 52.82 ms. Allocated memory is still 1.2 GB. Free memory is still 828.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i and consists of 3 locations. One deterministic module has affine ranking function i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 18 SDslu, 3 SDs, 0 SdLazy, 30 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax182 hnf98 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf94 smp100 dnf100 smp100 tf110 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 13]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1999805a=0, \result=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i >= -5 && i <= 5 [L10] COND FALSE !(i > 0) Loop: [L13] COND FALSE !(i < 0) [L9] COND TRUE i >= -5 && i <= 5 [L10] COND FALSE !(i > 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...