./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mcmillan2006.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-lit/mcmillan2006.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 0e5db84b9f9b462c8c6fbeb8b453779946c1329e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:14,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 04:50:14,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 04:50:15,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 04:50:15,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 04:50:15,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 04:50:15,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 04:50:15,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 04:50:15,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 04:50:15,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 04:50:15,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 04:50:15,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 04:50:15,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 04:50:15,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 04:50:15,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 04:50:15,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 04:50:15,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 04:50:15,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 04:50:15,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 04:50:15,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 04:50:15,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 04:50:15,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 04:50:15,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 04:50:15,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 04:50:15,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 04:50:15,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 04:50:15,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 04:50:15,092 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 04:50:15,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 04:50:15,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 04:50:15,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 04:50:15,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 04:50:15,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 04:50:15,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 04:50:15,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 04:50:15,099 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 04:50:15,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 04:50:15,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 04:50:15,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 04:50:15,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 04:50:15,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 04:50:15,115 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:15,148 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 04:50:15,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 04:50:15,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 04:50:15,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 04:50:15,153 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 04:50:15,153 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-26 04:50:15,154 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-26 04:50:15,154 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-26 04:50:15,154 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-26 04:50:15,154 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-26 04:50:15,155 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-26 04:50:15,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 04:50:15,156 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 04:50:15,156 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-26 04:50:15,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 04:50:15,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 04:50:15,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 04:50:15,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-26 04:50:15,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-26 04:50:15,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-26 04:50:15,158 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 04:50:15,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 04:50:15,159 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-26 04:50:15,159 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 04:50:15,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-26 04:50:15,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 04:50:15,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 04:50:15,160 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-26 04:50:15,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 04:50:15,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 04:50:15,161 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 04:50:15,161 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-26 04:50:15,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-26 04:50:15,164 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 -> 0e5db84b9f9b462c8c6fbeb8b453779946c1329e [2020-10-26 04:50:15,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 04:50:15,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 04:50:15,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 04:50:15,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 04:50:15,675 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 04:50:15,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mcmillan2006.i [2020-10-26 04:50:15,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21573570/9f6826c6dcda4d3c8699e98cacc90092/FLAGc9782f24c [2020-10-26 04:50:16,406 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 04:50:16,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mcmillan2006.i [2020-10-26 04:50:16,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21573570/9f6826c6dcda4d3c8699e98cacc90092/FLAGc9782f24c [2020-10-26 04:50:16,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21573570/9f6826c6dcda4d3c8699e98cacc90092 [2020-10-26 04:50:16,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 04:50:16,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 04:50:16,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 04:50:16,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 04:50:16,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 04:50:16,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:50:16" (1/1) ... [2020-10-26 04:50:16,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363fe7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:16, skipping insertion in model container [2020-10-26 04:50:16,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 04:50:16" (1/1) ... [2020-10-26 04:50:16,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 04:50:16,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 04:50:17,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:50:17,040 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 04:50:17,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 04:50:17,078 INFO L208 MainTranslator]: Completed translation [2020-10-26 04:50:17,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:17 WrapperNode [2020-10-26 04:50:17,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 04:50:17,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 04:50:17,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 04:50:17,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 04:50:17,090 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:17" (1/1) ... [2020-10-26 04:50:17,098 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:17" (1/1) ... [2020-10-26 04:50:17,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 04:50:17,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 04:50:17,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 04:50:17,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 04:50:17,133 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:17" (1/1) ... [2020-10-26 04:50:17,134 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:17" (1/1) ... [2020-10-26 04:50:17,136 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:17" (1/1) ... [2020-10-26 04:50:17,136 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:17" (1/1) ... [2020-10-26 04:50:17,142 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:17" (1/1) ... [2020-10-26 04:50:17,147 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:17" (1/1) ... [2020-10-26 04:50:17,149 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:17" (1/1) ... [2020-10-26 04:50:17,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 04:50:17,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 04:50:17,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 04:50:17,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 04:50:17,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:17" (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:17,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 04:50:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 04:50:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 04:50:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-26 04:50:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 04:50:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 04:50:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-26 04:50:17,561 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 04:50:17,562 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-26 04:50:17,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:50:17 BoogieIcfgContainer [2020-10-26 04:50:17,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 04:50:17,566 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-26 04:50:17,566 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-26 04:50:17,572 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-26 04:50:17,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:50:17,574 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.10 04:50:16" (1/3) ... [2020-10-26 04:50:17,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d2919b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:50:17, skipping insertion in model container [2020-10-26 04:50:17,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:50:17,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 04:50:17" (2/3) ... [2020-10-26 04:50:17,578 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d2919b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.10 04:50:17, skipping insertion in model container [2020-10-26 04:50:17,579 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-26 04:50:17,579 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 04:50:17" (3/3) ... [2020-10-26 04:50:17,581 INFO L373 chiAutomizerObserver]: Analyzing ICFG mcmillan2006.i [2020-10-26 04:50:17,663 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-26 04:50:17,663 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-26 04:50:17,663 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-26 04:50:17,664 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 04:50:17,664 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 04:50:17,664 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-26 04:50:17,664 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 04:50:17,664 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-26 04:50:17,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-26 04:50:17,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-26 04:50:17,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:17,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:17,737 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:50:17,737 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:50:17,737 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-26 04:50:17,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-10-26 04:50:17,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-10-26 04:50:17,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:17,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:17,741 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-10-26 04:50:17,741 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-26 04:50:17,749 INFO L794 eck$LassoCheckResult]: Stem: 14#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); 13#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~post5, main_~i~0, main_#t~mem7, main_#t~post6, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 7#L28true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;main_~i~0 := 0; 4#L30-3true [2020-10-26 04:50:17,750 INFO L796 eck$LassoCheckResult]: Loop: 4#L30-3true assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 8#L30-2true main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 4#L30-3true [2020-10-26 04:50:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:17,758 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-10-26 04:50:17,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:17,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931736092] [2020-10-26 04:50:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:17,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:17,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:17,944 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2020-10-26 04:50:17,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:17,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616279802] [2020-10-26 04:50:17,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:17,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:17,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:17,970 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2020-10-26 04:50:17,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:17,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137213694] [2020-10-26 04:50:17,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:17,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:18,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:18,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:18,644 WARN L193 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2020-10-26 04:50:18,766 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:18,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:18,768 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:18,768 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:18,768 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:50:18,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:18,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:18,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:18,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration1_Lasso [2020-10-26 04:50:18,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:18,770 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:18,802 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:18,818 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:19,078 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-10-26 04:50:19,129 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:19,132 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:19,135 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:19,138 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:19,142 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:19,145 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:19,147 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:19,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:19,542 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:19,547 INFO L489 LassoAnalysis]: Using template 'affine'. 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:19,556 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:19,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:19,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:19,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:19,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:19,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:19,566 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:19,611 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:19,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:19,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:19,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:19,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:19,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:50:19,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:50:19,627 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:19,662 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:19,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:19,664 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-26 04:50:19,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:19,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:19,674 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-26 04:50:19,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:50:19,685 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-26 04:50:19,728 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:19,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:19,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:19,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:19,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:19,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:50:19,734 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:19,739 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:19,777 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:19,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:19,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:19,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:19,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:19,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:50:19,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:50:19,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:50:19,844 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-10-26 04:50:19,844 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 9 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:19,852 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:50:19,862 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:50:19,862 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:50:19,863 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 [] [2020-10-26 04:50:19,933 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-26 04:50:19,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:20,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:20,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:20,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:20,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:20,043 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:20,068 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:20,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2020-10-26 04:50:20,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 44 states and 57 transitions. Complement of second has 7 states. [2020-10-26 04:50:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-26 04:50:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2020-10-26 04:50:20,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 2 letters. [2020-10-26 04:50:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 5 letters. Loop has 2 letters. [2020-10-26 04:50:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 4 letters. [2020-10-26 04:50:20,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:20,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 57 transitions. [2020-10-26 04:50:20,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:20,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 11 states and 13 transitions. [2020-10-26 04:50:20,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-10-26 04:50:20,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-26 04:50:20,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-10-26 04:50:20,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:50:20,187 INFO L691 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-10-26 04:50:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-10-26 04:50:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-10-26 04:50:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-26 04:50:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-10-26 04:50:20,218 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-10-26 04:50:20,218 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-10-26 04:50:20,219 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-26 04:50:20,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-10-26 04:50:20,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:20,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:20,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:20,221 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-26 04:50:20,222 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:50:20,222 INFO L794 eck$LassoCheckResult]: Stem: 151#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); 147#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~post5, main_~i~0, main_#t~mem7, main_#t~post6, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 148#L28 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;main_~i~0 := 0; 152#L30-3 assume !(main_~i~0 < main_~n~0); 149#L30-4 main_~i~1 := 0; 150#L31-3 [2020-10-26 04:50:20,222 INFO L796 eck$LassoCheckResult]: Loop: 150#L31-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 157#L19 assume !(0 == __VERIFIER_assert_~cond); 155#L19-2 havoc main_#t~mem7; 156#L31-2 main_#t~post6 := main_~i~1;main_~i~1 := 1 + main_#t~post6;havoc main_#t~post6; 150#L31-3 [2020-10-26 04:50:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2020-10-26 04:50:20,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:20,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881991581] [2020-10-26 04:50:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,293 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1830257, now seen corresponding path program 1 times [2020-10-26 04:50:20,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:20,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241910354] [2020-10-26 04:50:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,318 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:20,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1304177980, now seen corresponding path program 1 times [2020-10-26 04:50:20,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:20,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061369187] [2020-10-26 04:50:20,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:20,393 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:20,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061369187] [2020-10-26 04:50:20,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 04:50:20,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 04:50:20,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639241686] [2020-10-26 04:50:20,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 04:50:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 04:50:20,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 04:50:20,505 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-10-26 04:50:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 04:50:20,567 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-10-26 04:50:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 04:50:20,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2020-10-26 04:50:20,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:20,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2020-10-26 04:50:20,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-26 04:50:20,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-10-26 04:50:20,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-10-26 04:50:20,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:50:20,571 INFO L691 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-10-26 04:50:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-10-26 04:50:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-10-26 04:50:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-26 04:50:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-10-26 04:50:20,573 INFO L714 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-26 04:50:20,574 INFO L594 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-10-26 04:50:20,574 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-26 04:50:20,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-10-26 04:50:20,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-26 04:50:20,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-26 04:50:20,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-26 04:50:20,576 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 04:50:20,576 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-26 04:50:20,576 INFO L794 eck$LassoCheckResult]: Stem: 190#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); 186#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~post5, main_~i~0, main_#t~mem7, main_#t~post6, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 187#L28 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;main_~i~0 := 0; 191#L30-3 assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); 192#L30-2 main_#t~post5 := main_~i~0;main_~i~0 := 1 + main_#t~post5;havoc main_#t~post5; 193#L30-3 assume !(main_~i~0 < main_~n~0); 188#L30-4 main_~i~1 := 0; 189#L31-3 [2020-10-26 04:50:20,576 INFO L796 eck$LassoCheckResult]: Loop: 189#L31-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem7 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 196#L19 assume !(0 == __VERIFIER_assert_~cond); 194#L19-2 havoc main_#t~mem7; 195#L31-2 main_#t~post6 := main_~i~1;main_~i~1 := 1 + main_#t~post6;havoc main_#t~post6; 189#L31-3 [2020-10-26 04:50:20,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2020-10-26 04:50:20,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:20,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629154079] [2020-10-26 04:50:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,615 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1830257, now seen corresponding path program 2 times [2020-10-26 04:50:20,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:20,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560555879] [2020-10-26 04:50:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,640 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1358699362, now seen corresponding path program 1 times [2020-10-26 04:50:20,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 04:50:20,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884480485] [2020-10-26 04:50:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 04:50:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 04:50:20,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 04:50:20,688 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 04:50:21,104 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2020-10-26 04:50:21,211 INFO L210 LassoAnalysis]: Preferences: [2020-10-26 04:50:21,211 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-26 04:50:21,211 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-26 04:50:21,211 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-26 04:50:21,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-26 04:50:21,212 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:21,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-26 04:50:21,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-26 04:50:21,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration3_Lasso [2020-10-26 04:50:21,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-26 04:50:21,212 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-26 04:50:21,216 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:21,241 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:21,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:21,265 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:21,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-26 04:50:21,608 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-10-26 04:50:21,666 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:21,674 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:21,686 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:21,689 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:21,694 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:22,265 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-26 04:50:22,265 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:22,276 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:22,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:22,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:22,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:22,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:22,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:22,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:22,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:22,280 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:22,305 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:22,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:22,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:22,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:22,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:22,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:22,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:22,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:22,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:22,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-26 04:50:22,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:22,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:22,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:22,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:22,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:22,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:22,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:22,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:22,367 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:22,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:22,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-26 04:50:22,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:22,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:22,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:22,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-26 04:50:22,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-26 04:50:22,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:22,400 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:22,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-26 04:50:22,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-26 04:50:22,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-26 04:50:22,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-26 04:50:22,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-26 04:50:22,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-26 04:50:22,435 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-26 04:50:22,628 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2020-10-26 04:50:22,628 INFO L444 ModelExtractionUtils]: 2 out of 28 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-26 04:50:22,632 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-26 04:50:22,639 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-26 04:50:22,639 INFO L510 LassoAnalysis]: Proved termination. [2020-10-26 04:50:22,639 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~1) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [] [2020-10-26 04:50:22,712 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2020-10-26 04:50:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 04:50:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:22,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-26 04:50:22,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 04:50:22,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-26 04:50:22,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-26 04:50:22,798 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:22,799 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:22,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-10-26 04:50:22,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 17 transitions. Complement of second has 4 states. [2020-10-26 04:50:22,814 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:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-26 04:50:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-10-26 04:50:22,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2020-10-26 04:50:22,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:22,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2020-10-26 04:50:22,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:22,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2020-10-26 04:50:22,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-26 04:50:22,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-26 04:50:22,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:50:22,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-10-26 04:50:22,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-26 04:50:22,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-26 04:50:22,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-26 04:50:22,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-26 04:50:22,819 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:22,819 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:22,819 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-26 04:50:22,820 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-26 04:50:22,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-26 04:50:22,821 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-26 04:50:22,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-26 04:50:22,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.10 04:50:22 BoogieIcfgContainer [2020-10-26 04:50:22,828 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-26 04:50:22,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 04:50:22,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 04:50:22,829 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 04:50:22,829 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:17" (3/4) ... [2020-10-26 04:50:22,832 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-26 04:50:22,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 04:50:22,834 INFO L168 Benchmark]: Toolchain (without parser) took 6059.25 ms. Allocated memory was 46.1 MB in the beginning and 104.9 MB in the end (delta: 58.7 MB). Free memory was 24.2 MB in the beginning and 30.6 MB in the end (delta: -6.4 MB). Peak memory consumption was 53.7 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:22,835 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 46.1 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:50:22,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.74 ms. Allocated memory is still 46.1 MB. Free memory was 23.6 MB in the beginning and 25.3 MB in the end (delta: -1.7 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:22,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.87 ms. Allocated memory is still 46.1 MB. Free memory was 25.3 MB in the beginning and 23.8 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:22,837 INFO L168 Benchmark]: Boogie Preprocessor took 28.35 ms. Allocated memory is still 46.1 MB. Free memory was 23.8 MB in the beginning and 22.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:50:22,838 INFO L168 Benchmark]: RCFGBuilder took 412.72 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.6 MB in the beginning and 34.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:22,839 INFO L168 Benchmark]: BuchiAutomizer took 5261.69 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 34.1 MB in the beginning and 30.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 49.0 MB. Max. memory is 16.1 GB. [2020-10-26 04:50:22,839 INFO L168 Benchmark]: Witness Printer took 3.82 ms. Allocated memory is still 104.9 MB. Free memory is still 30.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 04:50:22,844 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.20 ms. Allocated memory is still 46.1 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 298.74 ms. Allocated memory is still 46.1 MB. Free memory was 23.6 MB in the beginning and 25.3 MB in the end (delta: -1.7 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.87 ms. Allocated memory is still 46.1 MB. Free memory was 25.3 MB in the beginning and 23.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.35 ms. Allocated memory is still 46.1 MB. Free memory was 23.8 MB in the beginning and 22.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 412.72 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 22.6 MB in the beginning and 34.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5261.69 ms. Allocated memory was 58.7 MB in the beginning and 104.9 MB in the end (delta: 46.1 MB). Free memory was 34.1 MB in the beginning and 30.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 49.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.82 ms. Allocated memory is still 104.9 MB. Free memory is still 30.6 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 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function n + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 29 SDslu, 31 SDs, 0 SdLazy, 29 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital179 mio100 ax100 hnf99 lsp93 ukn71 mio100 lsp48 div100 bol100 ite100 ukn100 eq169 hnf91 smp98 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...