./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-new/nested-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/loop-new/nested-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 7f63971ff7e1e47adf4fc8a9c16196a6401c3822 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 04:50:21,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:50:21,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:50:21,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:50:21,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:50:22,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:50:22,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:50:22,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:50:22,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:50:22,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:50:22,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:50:22,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:50:22,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:50:22,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:50:22,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:50:22,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:50:22,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:50:22,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:50:22,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:50:22,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:50:22,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:50:22,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:50:22,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:50:22,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:50:22,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:50:22,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:50:22,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:50:22,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:50:22,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:50:22,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:50:22,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:50:22,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:50:22,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:50:22,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:50:22,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:50:22,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:50:22,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:50:22,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:50:22,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:50:22,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:50:22,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:50:22,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-26 04:50:22,124 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:50:22,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:50:22,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:50:22,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:50:22,127 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:50:22,127 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:50:22,127 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:50:22,128 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:50:22,128 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:50:22,128 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:50:22,128 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:50:22,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:50:22,129 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:50:22,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:50:22,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:50:22,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:50:22,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:50:22,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:50:22,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:50:22,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:50:22,131 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:50:22,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:50:22,131 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:50:22,132 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:50:22,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:50:22,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:50:22,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:50:22,133 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:50:22,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:50:22,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:50:22,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:50:22,134 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:50:22,135 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:50:22,135 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f63971ff7e1e47adf4fc8a9c16196a6401c3822 [2020-10-26 04:50:22,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:50:22,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:50:22,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:50:22,562 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:50:22,563 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:50:22,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-new/nested-1.i [2020-10-26 04:50:22,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6dbf7c5b/1aebf019c25045628bdd1b16619edc23/FLAG0b8066083 [2020-10-26 04:50:23,267 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:50:23,267 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-new/nested-1.i [2020-10-26 04:50:23,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6dbf7c5b/1aebf019c25045628bdd1b16619edc23/FLAG0b8066083 [2020-10-26 04:50:23,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6dbf7c5b/1aebf019c25045628bdd1b16619edc23 [2020-10-26 04:50:23,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:50:23,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:50:23,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:50:23,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:50:23,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:50:23,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:23,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734518fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23, skipping insertion in model container [2020-10-26 04:50:23,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:23,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:50:23,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:50:23,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:50:23,910 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:50:23,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:50:23,949 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:50:23,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23 WrapperNode [2020-10-26 04:50:23,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:50:23,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:50:23,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:50:23,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:50:23,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:23,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:23,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:50:23,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:50:23,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:50:23,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:50:24,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... [2020-10-26 04:50:24,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:50:24,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:50:24,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:50:24,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:50:24,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:50:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:50:24,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:50:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:50:24,361 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:50:24,361 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-26 04:50:24,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:50:24 BoogieIcfgContainer [2020-10-26 04:50:24,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:50:24,365 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:50:24,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:50:24,369 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:50:24,371 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:50:24,371 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:50:23" (1/3) ... [2020-10-26 04:50:24,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a88429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:50:24, skipping insertion in model container [2020-10-26 04:50:24,373 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:50:24,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:23" (2/3) ... [2020-10-26 04:50:24,374 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a88429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:50:24, skipping insertion in model container [2020-10-26 04:50:24,374 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:50:24,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:50:24" (3/3) ... [2020-10-26 04:50:24,376 INFO L373 chiAutomizerObserver]: Analyzing ICFG nested-1.i [2020-10-26 04:50:24,483 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:50:24,484 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:50:24,484 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:50:24,484 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:50:24,484 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:50:24,485 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:50:24,487 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:50:24,487 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:50:24,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-26 04:50:24,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:24,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:24,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:24,591 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:50:24,592 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:50:24,592 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:50:24,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-26 04:50:24,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:24,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:24,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:24,596 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:50:24,596 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:50:24,612 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 14#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~post7, main_#t~post6, main_#t~post5, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 8#L29true assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 12#L30true assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 6#L31-3true [2020-10-26 04:50:24,612 INFO L796 eck$LassoCheckResult]: Loop: 6#L31-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 9#L32-3true assume !true; 10#L31-2true main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 6#L31-3true [2020-10-26 04:50:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:24,620 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-26 04:50:24,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:24,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450303843] [2020-10-26 04:50:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:24,755 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:24,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:24,796 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 50037, now seen corresponding path program 1 times [2020-10-26 04:50:24,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:24,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84144944] [2020-10-26 04:50:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:24,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84144944] [2020-10-26 04:50:24,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:50:24,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 04:50:24,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215045284] [2020-10-26 04:50:24,846 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-26 04:50:24,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:50:24,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-26 04:50:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-26 04:50:24,869 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-10-26 04:50:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:50:24,878 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-10-26 04:50:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 04:50:24,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-10-26 04:50:24,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:24,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 8 states and 9 transitions. [2020-10-26 04:50:24,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-26 04:50:24,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-26 04:50:24,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-10-26 04:50:24,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:50:24,891 INFO L691 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-10-26 04:50:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-10-26 04:50:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-10-26 04:50:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-26 04:50:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-10-26 04:50:24,923 INFO L714 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-10-26 04:50:24,924 INFO L594 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-10-26 04:50:24,924 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:50:24,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-10-26 04:50:24,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:24,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:24,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:24,926 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-26 04:50:24,926 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-26 04:50:24,926 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 41#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~post7, main_#t~post6, main_#t~post5, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 42#L29 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 48#L30 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 44#L31-3 [2020-10-26 04:50:24,927 INFO L796 eck$LassoCheckResult]: Loop: 44#L31-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 45#L32-3 assume !(main_~j~0 < main_~m~0); 46#L31-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 44#L31-3 [2020-10-26 04:50:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-26 04:50:24,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:24,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190015499] [2020-10-26 04:50:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:24,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:24,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:24,962 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash 49851, now seen corresponding path program 1 times [2020-10-26 04:50:24,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:24,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513712914] [2020-10-26 04:50:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:24,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:24,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:24,978 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1806910836, now seen corresponding path program 1 times [2020-10-26 04:50:24,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:24,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140824407] [2020-10-26 04:50:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:25,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140824407] [2020-10-26 04:50:25,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:50:25,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 04:50:25,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838929629] [2020-10-26 04:50:25,123 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:25,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:25,125 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:25,125 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:25,125 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:50:25,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,126 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:25,126 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:25,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested-1.i_Iteration2_Loop [2020-10-26 04:50:25,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:25,127 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:25,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:25,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:25,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:25,273 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:25,274 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:25,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:50:25,285 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-26 04:50:25,299 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:25,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:50:25,348 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 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-10-26 04:50:25,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:50:25,402 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,544 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:50:25,546 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:25,547 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:25,547 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:25,547 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:25,547 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:50:25,547 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,547 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:25,547 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:25,548 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested-1.i_Iteration2_Loop [2020-10-26 04:50:25,548 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:25,548 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:25,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:25,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:25,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:25,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:25,635 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:50:25,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:25,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:25,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:25,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:25,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:25,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:25,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:25,665 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:50:25,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:25,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:25,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:25,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:25,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:25,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:25,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:25,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:50:25,722 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-26 04:50:25,722 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:25,730 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:50:25,731 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:50:25,731 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:50:25,732 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:25,767 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:50:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:25,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:25,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:25,831 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:25,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:25,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:50:25,853 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-10-26 04:50:25,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2020-10-26 04:50:25,891 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-10-26 04:50:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-10-26 04:50:25,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2020-10-26 04:50:25,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:25,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2020-10-26 04:50:25,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:25,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2020-10-26 04:50:25,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:25,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2020-10-26 04:50:25,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:50:25,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 15 transitions. [2020-10-26 04:50:25,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-26 04:50:25,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-10-26 04:50:25,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2020-10-26 04:50:25,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:50:25,923 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-10-26 04:50:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2020-10-26 04:50:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-10-26 04:50:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-26 04:50:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-10-26 04:50:25,928 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-10-26 04:50:25,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:50:25,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 04:50:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-26 04:50:25,932 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2020-10-26 04:50:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:50:25,969 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-10-26 04:50:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 04:50:25,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2020-10-26 04:50:25,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:50:25,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2020-10-26 04:50:25,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:50:25,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-26 04:50:25,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2020-10-26 04:50:25,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:50:25,973 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-10-26 04:50:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2020-10-26 04:50:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2020-10-26 04:50:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-26 04:50:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-10-26 04:50:25,976 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-10-26 04:50:25,976 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-10-26 04:50:25,976 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:50:25,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-10-26 04:50:25,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:50:25,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:25,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:25,978 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:50:25,978 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:50:25,978 INFO L794 eck$LassoCheckResult]: Stem: 133#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 131#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~post7, main_#t~post6, main_#t~post5, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 132#L29 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 139#L30 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 134#L31-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 135#L32-3 [2020-10-26 04:50:25,979 INFO L796 eck$LassoCheckResult]: Loop: 135#L32-3 assume !!(main_~j~0 < main_~m~0);main_#t~post7 := main_~k~0;main_~k~0 := 1 + main_#t~post7;havoc main_#t~post7; 140#L32-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 135#L32-3 [2020-10-26 04:50:25,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 28695852, now seen corresponding path program 1 times [2020-10-26 04:50:25,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:25,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782518581] [2020-10-26 04:50:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:25,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:26,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:26,009 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1859, now seen corresponding path program 1 times [2020-10-26 04:50:26,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:26,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131602580] [2020-10-26 04:50:26,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:26,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:26,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:26,021 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1806910894, now seen corresponding path program 1 times [2020-10-26 04:50:26,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:26,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50702647] [2020-10-26 04:50:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:26,037 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:26,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:26,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:26,075 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:26,076 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:26,076 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:26,076 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:26,076 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:50:26,076 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:26,076 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:26,076 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:26,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested-1.i_Iteration3_Loop [2020-10-26 04:50:26,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:26,077 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:26,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,142 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:26,143 INFO L404 LassoAnalysis]: Checking for nontermination... 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-10-26 04:50:26,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:50:26,149 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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:26,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:50:26,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-26 04:50:26,358 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:50:26,360 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:26,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:26,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:26,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:26,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:50:26,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:26,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:26,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:26,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested-1.i_Iteration3_Loop [2020-10-26 04:50:26,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:26,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:26,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:26,458 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:26,458 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:26,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:50:26,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:26,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:26,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:26,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:26,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:26,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:26,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:26,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:50:26,490 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:50:26,491 INFO L444 ModelExtractionUtils]: 1 out of 4 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:26,504 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:26,504 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:50:26,504 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:50:26,504 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-26 04:50:26,540 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:50:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:26,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:26,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:26,706 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:26,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:26,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:50:26,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-26 04:50:26,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 24 states and 31 transitions. Complement of second has 7 states. [2020-10-26 04:50:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:50:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-10-26 04:50:26,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-26 04:50:26,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:26,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-10-26 04:50:26,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:26,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2020-10-26 04:50:26,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:26,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2020-10-26 04:50:26,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:50:26,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 17 states and 21 transitions. [2020-10-26 04:50:26,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-10-26 04:50:26,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-10-26 04:50:26,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-10-26 04:50:26,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-26 04:50:26,773 INFO L691 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-10-26 04:50:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-10-26 04:50:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2020-10-26 04:50:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-26 04:50:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2020-10-26 04:50:26,780 INFO L714 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-26 04:50:26,781 INFO L594 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-10-26 04:50:26,781 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:50:26,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2020-10-26 04:50:26,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-10-26 04:50:26,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:26,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:26,785 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:50:26,786 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:50:26,786 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 212#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~post7, main_#t~post6, main_#t~post5, main_~n~0, main_~m~0, main_~k~0, main_~i~0, main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~k~0 := 0;havoc main_~i~0;havoc main_~j~0; 213#L29 assume !!(10 <= main_~n~0 && main_~n~0 <= 10000); 222#L30 assume !!(10 <= main_~m~0 && main_~m~0 <= 10000);main_~i~0 := 0; 215#L31-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 216#L32-3 assume !!(main_~j~0 < main_~m~0);main_#t~post7 := main_~k~0;main_~k~0 := 1 + main_#t~post7;havoc main_#t~post7; 220#L32-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 223#L32-3 assume !(main_~j~0 < main_~m~0); 221#L31-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 217#L31-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 218#L32-3 [2020-10-26 04:50:26,787 INFO L796 eck$LassoCheckResult]: Loop: 218#L32-3 assume !!(main_~j~0 < main_~m~0);main_#t~post7 := main_~k~0;main_~k~0 := 1 + main_#t~post7;havoc main_#t~post7; 219#L32-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 218#L32-3 [2020-10-26 04:50:26,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash 857348446, now seen corresponding path program 1 times [2020-10-26 04:50:26,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:26,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238261976] [2020-10-26 04:50:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:26,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238261976] [2020-10-26 04:50:26,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4383689] [2020-10-26 04:50:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-26 04:50:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:26,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:26,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:27,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-26 04:50:27,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-10-26 04:50:27,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107598944] [2020-10-26 04:50:27,003 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-26 04:50:27,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1859, now seen corresponding path program 2 times [2020-10-26 04:50:27,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:27,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044198579] [2020-10-26 04:50:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:27,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:27,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:27,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:27,033 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:27,034 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:27,034 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:27,034 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:27,034 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-26 04:50:27,034 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:27,034 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:27,034 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:27,034 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested-1.i_Iteration4_Loop [2020-10-26 04:50:27,034 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:27,035 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:27,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,092 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:27,092 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:27,099 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-26 04:50:27,099 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:27,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-26 04:50:27,156 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:27,347 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-26 04:50:27,350 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:27,350 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:27,351 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:27,351 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:27,351 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:50:27,351 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:27,351 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:27,351 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:27,351 INFO L133 ssoRankerPreferences]: Filename of dumped script: nested-1.i_Iteration4_Loop [2020-10-26 04:50:27,351 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:27,351 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:27,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:27,406 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:27,407 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:27,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:50:27,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:27,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:27,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:27,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:27,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:27,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:27,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:27,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:50:27,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-26 04:50:27,434 INFO L444 ModelExtractionUtils]: 1 out of 4 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:27,441 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:50:27,441 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-26 04:50:27,441 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:50:27,442 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:27,479 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-26 04:50:27,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:27,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:27,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:27,520 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:27,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:27,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:50:27,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-26 04:50:27,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2020-10-26 04:50:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:50:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-10-26 04:50:27,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-26 04:50:27,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:27,553 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:50:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:27,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:27,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:27,635 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:27,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:27,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:50:27,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-26 04:50:27,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 20 states and 25 transitions. Complement of second has 7 states. [2020-10-26 04:50:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:50:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-10-26 04:50:27,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-26 04:50:27,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:27,668 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-26 04:50:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:27,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:27,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:27,704 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:27,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 04:50:27,719 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-26 04:50:27,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-10-26 04:50:27,735 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 21 transitions. Complement of second has 6 states. [2020-10-26 04:50:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:50:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-10-26 04:50:27,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-10-26 04:50:27,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:27,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-10-26 04:50:27,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:27,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-10-26 04:50:27,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:27,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2020-10-26 04:50:27,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:50:27,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 0 states and 0 transitions. [2020-10-26 04:50:27,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:50:27,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:50:27,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:50:27,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:50:27,740 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:27,741 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:27,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:50:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 04:50:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-26 04:50:27,742 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 7 states. [2020-10-26 04:50:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:50:27,742 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-26 04:50:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-26 04:50:27,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-26 04:50:27,743 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:50:27,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-26 04:50:27,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:50:27,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:50:27,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:50:27,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:50:27,744 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:27,744 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:27,744 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:27,745 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-26 04:50:27,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:50:27,745 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:50:27,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:50:27,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:50:27 BoogieIcfgContainer [2020-10-26 04:50:27,752 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:50:27,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:50:27,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:50:27,754 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:50:27,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:50:24" (3/4) ... [2020-10-26 04:50:27,758 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:50:27,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:50:27,760 INFO L168 Benchmark]: Toolchain (without parser) took 4118.96 ms. Allocated memory was 44.0 MB in the beginning and 67.1 MB in the end (delta: 23.1 MB). Free memory was 21.1 MB in the beginning and 32.4 MB in the end (delta: -11.2 MB). Peak memory consumption was 13.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:27,761 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 44.0 MB. Free memory is still 21.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:50:27,762 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.08 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.5 MB in the beginning and 30.7 MB in the end (delta: -10.2 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:27,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.74 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 29.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:27,763 INFO L168 Benchmark]: Boogie Preprocessor took 25.60 ms. Allocated memory is still 54.5 MB. Free memory was 29.3 MB in the beginning and 28.3 MB in the end (delta: 998.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:50:27,764 INFO L168 Benchmark]: RCFGBuilder took 342.99 ms. Allocated memory is still 54.5 MB. Free memory was 28.3 MB in the beginning and 30.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:27,765 INFO L168 Benchmark]: BuchiAutomizer took 3387.80 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.9 MB in the beginning and 32.4 MB in the end (delta: -2.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:27,766 INFO L168 Benchmark]: Witness Printer took 5.01 ms. Allocated memory is still 67.1 MB. Free memory is still 32.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:50:27,770 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 44.0 MB. Free memory is still 21.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 300.08 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.5 MB in the beginning and 30.7 MB in the end (delta: -10.2 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.74 ms. Allocated memory is still 54.5 MB. Free memory was 30.7 MB in the beginning and 29.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.60 ms. Allocated memory is still 54.5 MB. Free memory was 29.3 MB in the beginning and 28.3 MB in the end (delta: 998.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 342.99 ms. Allocated memory is still 54.5 MB. Free memory was 28.3 MB in the beginning and 30.1 MB in the end (delta: -1.8 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3387.80 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.9 MB in the beginning and 32.4 MB in the end (delta: -2.5 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.01 ms. Allocated memory is still 67.1 MB. Free memory is still 32.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 3 locations. One deterministic module has affine ranking function m + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 64 SDtfs, 50 SDslu, 13 SDs, 0 SdLazy, 40 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf98 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...