./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/mcmillan2006.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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 0bc7a4d659d3194b48f3b04881f4cf374cbb0aa4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 02:08:13,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:08:13,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:08:13,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:08:13,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:08:13,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:08:13,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:08:13,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:08:13,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:08:13,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:08:13,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:08:13,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:08:13,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:08:13,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:08:13,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:08:13,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:08:13,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:08:13,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:08:13,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:08:13,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:08:13,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:08:13,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:08:13,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:08:13,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:08:13,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:08:13,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:08:13,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:08:13,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:08:13,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:08:13,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:08:13,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:08:13,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:08:13,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:08:13,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:08:13,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:08:13,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:08:13,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:08:13,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:08:13,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:08:13,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:08:13,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:08:13,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:08:13,820 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:08:13,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:08:13,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:08:13,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:08:13,824 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:08:13,824 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:08:13,824 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:08:13,825 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:08:13,825 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:08:13,825 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:08:13,825 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:08:13,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:08:13,826 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:08:13,826 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:08:13,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:08:13,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:08:13,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:08:13,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:08:13,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:08:13,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:08:13,829 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:08:13,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:08:13,829 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:08:13,830 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:08:13,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:08:13,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:08:13,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:08:13,830 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:08:13,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:08:13,831 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:08:13,831 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:08:13,832 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:08:13,833 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:08:13,833 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0bc7a4d659d3194b48f3b04881f4cf374cbb0aa4 [2020-07-29 02:08:14,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:08:14,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:08:14,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:08:14,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:08:14,147 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:08:14,148 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/mcmillan2006.i [2020-07-29 02:08:14,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200edfd46/41e2e60dba3c45c6946ef478c69ac0fe/FLAG941147675 [2020-07-29 02:08:14,674 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:08:14,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/mcmillan2006.i [2020-07-29 02:08:14,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200edfd46/41e2e60dba3c45c6946ef478c69ac0fe/FLAG941147675 [2020-07-29 02:08:15,049 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200edfd46/41e2e60dba3c45c6946ef478c69ac0fe [2020-07-29 02:08:15,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:08:15,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:08:15,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:08:15,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:08:15,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:08:15,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11075028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15, skipping insertion in model container [2020-07-29 02:08:15,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:08:15,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:08:15,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:08:15,364 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:08:15,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:08:15,398 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:08:15,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15 WrapperNode [2020-07-29 02:08:15,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:08:15,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:08:15,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:08:15,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:08:15,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:08:15,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:08:15,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:08:15,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:08:15,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... [2020-07-29 02:08:15,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:08:15,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:08:15,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:08:15,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:08:15,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 02:08:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 02:08:15,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:08:15,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:08:15,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 02:08:15,847 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:08:15,848 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 02:08:15,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:15 BoogieIcfgContainer [2020-07-29 02:08:15,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:08:15,852 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:08:15,853 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:08:15,857 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:08:15,858 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:15,858 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:08:15" (1/3) ... [2020-07-29 02:08:15,859 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42378788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:08:15, skipping insertion in model container [2020-07-29 02:08:15,859 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:15,859 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:15" (2/3) ... [2020-07-29 02:08:15,860 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42378788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:08:15, skipping insertion in model container [2020-07-29 02:08:15,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:15,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:15" (3/3) ... [2020-07-29 02:08:15,862 INFO L371 chiAutomizerObserver]: Analyzing ICFG mcmillan2006.i [2020-07-29 02:08:15,917 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:08:15,917 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:08:15,918 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:08:15,918 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:08:15,918 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:08:15,918 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:08:15,918 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:08:15,918 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:08:15,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 02:08:15,961 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:08:15,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:15,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:15,968 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:08:15,969 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:08:15,969 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:08:15,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 02:08:15,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:08:15,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:15,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:15,974 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 02:08:15,974 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:08:15,983 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~0, main_#t~mem4, main_#t~post3, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 7#L17true assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; 4#L19-3true [2020-07-29 02:08:15,985 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-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#L19-2true main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 4#L19-3true [2020-07-29 02:08:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:15,992 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 02:08:16,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:16,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355197284] [2020-07-29 02:08:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:16,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:16,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:16,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:16,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1443, now seen corresponding path program 1 times [2020-07-29 02:08:16,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:16,125 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824956182] [2020-07-29 02:08:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:16,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:16,146 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:16,150 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:16,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 28695942, now seen corresponding path program 1 times [2020-07-29 02:08:16,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:16,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735133499] [2020-07-29 02:08:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:16,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:16,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:16,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:16,494 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:16,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:16,496 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:16,496 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:16,496 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:16,496 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:16,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:16,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:16,497 INFO L133 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration1_Lasso [2020-07-29 02:08:16,497 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:16,498 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:16,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:16,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:17,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:17,333 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-07-29 02:08:17,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:17,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:17,360 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-07-29 02:08:17,364 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) [2020-07-29 02:08:17,422 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:17,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:17,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:17,436 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. 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-07-29 02:08:17,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:17,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:17,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:17,512 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-07-29 02:08:17,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:17,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:17,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:08:17,576 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-07-29 02:08:17,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:17,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:08:17,637 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:17,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:17,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:17,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:17,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,746 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 02:08:17,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,752 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 02:08:17,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:08:17,761 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) [2020-07-29 02:08:17,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:17,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:17,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:17,804 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-07-29 02:08:17,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:17,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:17,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:17,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:17,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:17,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:17,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:08:17,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:17,924 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 02:08:17,924 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:17,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:17,952 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 02:08:17,953 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:17,954 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc1.base)_1) = -2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc1.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~n~0 + 1*v_rep(select #length ULTIMATE.start_main_~x~0.base)_1 >= 0] [2020-07-29 02:08:18,114 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 02:08:18,126 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4);" "main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2;" [2020-07-29 02:08:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:18,141 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 02:08:18,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:18,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 02:08:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:18,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:18,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 02:08:18,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~0, main_#t~mem4, main_#t~post3, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {25#unseeded} is VALID [2020-07-29 02:08:18,216 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {60#(and (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc1.base|) unseeded (>= (+ (* (- 2) ULTIMATE.start_main_~n~0) (select |#length| ULTIMATE.start_main_~x~0.base)) 0))} is VALID [2020-07-29 02:08:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:18,224 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 02:08:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:18,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:18,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {61#(and (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc1.base|) (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc1.base|))) (>= (+ (* (- 2) ULTIMATE.start_main_~n~0) (select |#length| ULTIMATE.start_main_~x~0.base)) 0))} assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); {75#(and (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc1.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= (* 2 ULTIMATE.start_main_~n~0) (select |#length| ULTIMATE.start_main_~x~0.base)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:18,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {75#(and (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc1.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc1.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= (* 2 ULTIMATE.start_main_~n~0) (select |#length| ULTIMATE.start_main_~x~0.base)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {63#(and (= ULTIMATE.start_main_~x~0.base |ULTIMATE.start_main_#t~malloc1.base|) (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc1.base|))) (>= oldRank0 0)) unseeded) (>= (+ (* (- 2) ULTIMATE.start_main_~n~0) (select |#length| ULTIMATE.start_main_~x~0.base)) 0))} is VALID [2020-07-29 02:08:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:18,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:18,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:18,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,304 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 02:08:18,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 02:08:18,487 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 40 states and 51 transitions. Complement of second has 7 states. [2020-07-29 02:08:18,488 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-07-29 02:08:18,488 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:18,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 02:08:18,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:08:18,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:18,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:18,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:18,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:08:18,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:18,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:18,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2020-07-29 02:08:18,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:18,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:18,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:18,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 02:08:18,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:08:18,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 02:08:18,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:18,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:08:18,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:08:18,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 51 transitions. cyclomatic complexity: 15 [2020-07-29 02:08:18,519 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:08:18,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:18,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:18,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:18,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 02:08:18,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 02:08:18,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 40 letters. Loop has 40 letters. [2020-07-29 02:08:18,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:08:18,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:08:18,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:08:18,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:18,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:18,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:18,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:18,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:18,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:18,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:18,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:18,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:18,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:08:18,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:08:18,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:08:18,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 02:08:18,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 02:08:18,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 5 letters. [2020-07-29 02:08:18,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:08:18,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:08:18,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:08:18,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:18,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:18,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:18,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:18,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:18,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:18,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:18,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:18,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:18,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:08:18,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:18,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:18,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:18,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:08:18,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:08:18,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 51 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:08:18,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,549 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-29 02:08:18,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 02:08:18,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:08:18,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:08:18,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:18,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. cyclomatic complexity: 15 [2020-07-29 02:08:18,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:18,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 11 states and 13 transitions. [2020-07-29 02:08:18,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 02:08:18,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 02:08:18,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 02:08:18,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:18,568 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 02:08:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 02:08:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 02:08:18,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:18,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 11 states. [2020-07-29 02:08:18,600 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 11 states. [2020-07-29 02:08:18,603 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2020-07-29 02:08:18,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:18,610 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 02:08:18,611 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 02:08:18,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:18,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:18,612 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 13 transitions. [2020-07-29 02:08:18,613 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 13 transitions. [2020-07-29 02:08:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:18,616 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 02:08:18,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 02:08:18,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:18,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:18,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:18,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 02:08:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 02:08:18,622 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 02:08:18,622 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 02:08:18,622 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:08:18,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 02:08:18,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:18,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:18,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:18,625 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:08:18,625 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:08:18,626 INFO L794 eck$LassoCheckResult]: Stem: 137#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 130#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~0, main_#t~mem4, main_#t~post3, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 131#L17 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; 134#L19-3 assume !(main_~i~0 < main_~n~0); 132#L19-4 main_~i~1 := 0; 133#L20-3 [2020-07-29 02:08:18,635 INFO L796 eck$LassoCheckResult]: Loop: 133#L20-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem4 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 140#L8 assume !(0 == __VERIFIER_assert_~cond); 138#L8-2 havoc main_#t~mem4; 139#L20-2 main_#t~post3 := main_~i~1;main_~i~1 := 1 + main_#t~post3;havoc main_#t~post3; 133#L20-3 [2020-07-29 02:08:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:18,636 INFO L82 PathProgramCache]: Analyzing trace with hash 28695884, now seen corresponding path program 1 times [2020-07-29 02:08:18,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:18,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738099486] [2020-07-29 02:08:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:18,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:18,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:18,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 1 times [2020-07-29 02:08:18,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:18,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186114027] [2020-07-29 02:08:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:18,710 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:18,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:18,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:18,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1304171029, now seen corresponding path program 1 times [2020-07-29 02:08:18,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:18,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216171174] [2020-07-29 02:08:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:18,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {170#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {170#true} is VALID [2020-07-29 02:08:18,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {170#true} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~0, main_#t~mem4, main_#t~post3, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {170#true} is VALID [2020-07-29 02:08:18,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {170#true} assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {172#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:08:18,878 INFO L280 TraceCheckUtils]: 3: Hoare triple {172#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < main_~n~0); {173#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 02:08:18,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {173#(<= ULTIMATE.start_main_~n~0 0)} main_~i~1 := 0; {174#(and (<= ULTIMATE.start_main_~n~0 0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 02:08:18,879 INFO L280 TraceCheckUtils]: 5: Hoare triple {174#(and (<= ULTIMATE.start_main_~n~0 0) (= 0 ULTIMATE.start_main_~i~1))} assume !!(main_~i~1 < main_~n~0);call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem4 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {171#false} is VALID [2020-07-29 02:08:18,880 INFO L280 TraceCheckUtils]: 6: Hoare triple {171#false} assume !(0 == __VERIFIER_assert_~cond); {171#false} is VALID [2020-07-29 02:08:18,880 INFO L280 TraceCheckUtils]: 7: Hoare triple {171#false} havoc main_#t~mem4; {171#false} is VALID [2020-07-29 02:08:18,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {171#false} main_#t~post3 := main_~i~1;main_~i~1 := 1 + main_#t~post3;havoc main_#t~post3; {171#false} is VALID [2020-07-29 02:08:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:18,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216171174] [2020-07-29 02:08:18,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:08:18,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 02:08:18,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120729072] [2020-07-29 02:08:18,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 02:08:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 02:08:18,971 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 02:08:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:19,046 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-29 02:08:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 02:08:19,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:08:19,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:19,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2020-07-29 02:08:19,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:19,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 13 transitions. [2020-07-29 02:08:19,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 02:08:19,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 02:08:19,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-07-29 02:08:19,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:19,068 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 02:08:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-07-29 02:08:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 02:08:19,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:19,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand 11 states. [2020-07-29 02:08:19,069 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand 11 states. [2020-07-29 02:08:19,069 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 11 states. [2020-07-29 02:08:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:19,070 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 02:08:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 02:08:19,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:19,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:19,071 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 13 transitions. [2020-07-29 02:08:19,071 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 13 transitions. [2020-07-29 02:08:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:19,072 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 02:08:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 02:08:19,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:19,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:19,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:19,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 02:08:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 02:08:19,074 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 02:08:19,074 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 02:08:19,074 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:08:19,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-07-29 02:08:19,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:08:19,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:19,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:19,076 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:08:19,076 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:08:19,076 INFO L794 eck$LassoCheckResult]: Stem: 200#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 193#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~0, main_#t~mem4, main_#t~post3, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 194#L17 assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; 197#L19-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); 198#L19-2 main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; 199#L19-3 assume !(main_~i~0 < main_~n~0); 195#L19-4 main_~i~1 := 0; 196#L20-3 [2020-07-29 02:08:19,076 INFO L796 eck$LassoCheckResult]: Loop: 196#L20-3 assume !!(main_~i~1 < main_~n~0);call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem4 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 203#L8 assume !(0 == __VERIFIER_assert_~cond); 201#L8-2 havoc main_#t~mem4; 202#L20-2 main_#t~post3 := main_~i~1;main_~i~1 := 1 + main_#t~post3;havoc main_#t~post3; 196#L20-3 [2020-07-29 02:08:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1806996910, now seen corresponding path program 1 times [2020-07-29 02:08:19,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:19,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164106902] [2020-07-29 02:08:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:19,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:19,098 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:19,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1823306, now seen corresponding path program 2 times [2020-07-29 02:08:19,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:19,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476664704] [2020-07-29 02:08:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:19,109 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:19,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:19,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:19,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1358706313, now seen corresponding path program 1 times [2020-07-29 02:08:19,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:19,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566411788] [2020-07-29 02:08:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:19,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:19,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:19,153 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:19,400 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2020-07-29 02:08:19,478 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:19,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:19,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:19,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:19,478 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:19,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:19,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:19,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:19,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: mcmillan2006.i_Iteration3_Lasso [2020-07-29 02:08:19,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:19,479 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:19,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,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-07-29 02:08:19,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:19,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:20,210 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:20,210 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:20,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:20,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:20,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:20,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:20,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:20,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:20,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:20,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:20,231 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 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-07-29 02:08:20,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:08:20,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:20,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:20,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:20,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:20,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:08:20,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:08:20,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:20,335 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 02:08:20,335 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:20,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:20,343 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 02:08:20,343 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:20,343 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-07-29 02:08:20,395 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 02:08:20,400 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~n~0);call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem4 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;" "assume !(0 == __VERIFIER_assert_~cond);" "havoc main_#t~mem4;" "main_#t~post3 := main_~i~1;main_~i~1 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:08:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:20,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:20,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:20,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {237#unseeded} is VALID [2020-07-29 02:08:20,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~0, main_#t~mem4, main_#t~post3, main_~i~1, main_~n~0, main_~x~0.base, main_~x~0.offset;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {237#unseeded} is VALID [2020-07-29 02:08:20,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !!(0 <= main_~n~0 && main_~n~0 <= 1000);call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnHeap(4 * main_~n~0);main_~x~0.base, main_~x~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~0 := 0; {237#unseeded} is VALID [2020-07-29 02:08:20,452 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !!(main_~i~0 < main_~n~0);call write~int(0, main_~x~0.base, main_~x~0.offset + 4 * main_~i~0, 4); {237#unseeded} is VALID [2020-07-29 02:08:20,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#unseeded} main_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; {237#unseeded} is VALID [2020-07-29 02:08:20,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#unseeded} assume !(main_~i~0 < main_~n~0); {237#unseeded} is VALID [2020-07-29 02:08:20,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {237#unseeded} main_~i~1 := 0; {237#unseeded} is VALID [2020-07-29 02:08:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:20,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:20,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:20,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~1)))} assume !!(main_~i~1 < main_~n~0);call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset + 4 * main_~i~1, 4);__VERIFIER_assert_#in~cond := (if 0 == main_#t~mem4 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {288#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:20,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {288#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~n~0))} assume !(0 == __VERIFIER_assert_~cond); {288#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:20,491 INFO L280 TraceCheckUtils]: 2: Hoare triple {288#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~n~0))} havoc main_#t~mem4; {288#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 02:08:20,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {288#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~1)) (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~n~0))} main_#t~post3 := main_~i~1;main_~i~1 := 1 + main_#t~post3;havoc main_#t~post3; {265#(or (and (>= oldRank0 0) (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~1)))) unseeded)} is VALID [2020-07-29 02:08:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:20,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:20,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:08:20,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 02:08:20,509 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 02:08:20,537 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-07-29 02:08:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:20,537 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:20,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. cyclomatic complexity: 3 [2020-07-29 02:08:20,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:20,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:20,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:08:20,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:20,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:20,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:20,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-07-29 02:08:20,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:20,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:20,540 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 12 transitions. cyclomatic complexity: 3 [2020-07-29 02:08:20,542 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:08:20,542 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:08:20,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:08:20,543 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:20,543 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:20,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:20,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:20,543 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:08:20,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:20,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:20,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:20,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:08:20,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:08:20,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:08:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:08:20,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:08:20,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:08:20,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:08:20,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:08:20,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:08:20,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:20,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:20,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:08:20,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 12 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:20,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:20,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:20,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,552 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:20,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:08:20,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-29 02:08:20,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:08:20,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:08:20,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-29 02:08:20,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:20,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:20,556 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:20,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-07-29 02:08:20,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:20,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:20,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:20,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:20,557 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:20,557 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:20,557 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:20,557 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:08:20,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:08:20,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:20,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:20,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:08:20 BoogieIcfgContainer [2020-07-29 02:08:20,566 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:08:20,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:08:20,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:08:20,566 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:08:20,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:15" (3/4) ... [2020-07-29 02:08:20,571 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:08:20,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:08:20,574 INFO L168 Benchmark]: Toolchain (without parser) took 5519.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 960.2 MB in the beginning and 918.1 MB in the end (delta: 42.1 MB). Peak memory consumption was 252.3 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:20,574 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:20,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.01 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:20,577 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:20,578 INFO L168 Benchmark]: Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:20,579 INFO L168 Benchmark]: RCFGBuilder took 334.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:20,580 INFO L168 Benchmark]: BuchiAutomizer took 4713.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 918.1 MB in the end (delta: 189.3 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:20,580 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory was 918.1 MB in the beginning and 918.1 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-29 02:08:20,585 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.01 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4713.21 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 918.1 MB in the end (delta: 189.3 MB). Peak memory consumption was 262.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.2 GB. Free memory was 918.1 MB in the beginning and 918.1 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -2 * i + unknown-#length-unknown[malloc(n * sizeof(int))] 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 4.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. 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 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: 31 SDtfs, 29 SDslu, 29 SDs, 0 SdLazy, 29 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital116 mio100 ax100 hnf99 lsp92 ukn83 mio100 lsp60 div100 bol100 ite100 ukn100 eq159 hnf91 smp93 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 3 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...