./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Addition02.c --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/recursive/Addition02.c -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 4f9a38be18608b9918f157c72437435dc654871f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:04:57,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:04:57,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:04:57,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:04:57,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:04:57,820 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:04:57,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:04:57,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:04:57,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:04:57,827 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:04:57,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:04:57,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:04:57,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:04:57,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:04:57,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:04:57,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:04:57,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:04:57,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:04:57,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:04:57,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:04:57,842 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:04:57,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:04:57,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:04:57,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:04:57,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:04:57,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:04:57,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:04:57,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:04:57,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:04:57,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:04:57,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:04:57,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:04:57,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:04:57,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:04:57,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:04:57,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:04:57,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:04:57,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:04:57,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:04:57,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:04:57,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:04:57,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:04:57,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:04:57,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:04:57,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:04:57,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:04:57,888 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:04:57,888 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:04:57,889 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:04:57,889 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:04:57,889 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:04:57,890 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:04:57,890 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:04:57,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:04:57,891 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:04:57,891 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:04:57,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:04:57,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:04:57,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:04:57,892 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:04:57,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:04:57,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:04:57,893 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:04:57,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:04:57,893 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:04:57,894 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:04:57,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:04:57,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:04:57,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:04:57,895 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:04:57,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:04:57,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:04:57,896 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:04:57,896 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:04:57,898 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:04:57,898 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 -> 4f9a38be18608b9918f157c72437435dc654871f [2020-07-29 03:04:58,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:04:58,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:04:58,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:04:58,263 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:04:58,263 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:04:58,264 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition02.c [2020-07-29 03:04:58,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7d8036c/dba02f62c38a4959b9e90e61d8f1922d/FLAG9fa9664f9 [2020-07-29 03:04:58,904 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:04:58,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition02.c [2020-07-29 03:04:58,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7d8036c/dba02f62c38a4959b9e90e61d8f1922d/FLAG9fa9664f9 [2020-07-29 03:04:59,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7d8036c/dba02f62c38a4959b9e90e61d8f1922d [2020-07-29 03:04:59,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:04:59,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:04:59,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:04:59,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:04:59,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:04:59,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac63c65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59, skipping insertion in model container [2020-07-29 03:04:59,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:04:59,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:04:59,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:04:59,564 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:04:59,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:04:59,601 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:04:59,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59 WrapperNode [2020-07-29 03:04:59,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:04:59,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:04:59,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:04:59,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:04:59,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:04:59,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:04:59,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:04:59,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:04:59,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (1/1) ... [2020-07-29 03:04:59,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:04:59,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:04:59,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:04:59,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:04:59,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (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 03:04:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:04:59,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:04:59,807 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-29 03:04:59,807 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-29 03:05:00,194 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:05:00,195 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 03:05:00,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:00 BoogieIcfgContainer [2020-07-29 03:05:00,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:05:00,201 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:05:00,201 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:05:00,206 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:05:00,207 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:00,207 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:04:59" (1/3) ... [2020-07-29 03:05:00,209 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c6e7dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:00, skipping insertion in model container [2020-07-29 03:05:00,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:00,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:04:59" (2/3) ... [2020-07-29 03:05:00,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c6e7dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:00, skipping insertion in model container [2020-07-29 03:05:00,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:00,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:00" (3/3) ... [2020-07-29 03:05:00,213 INFO L371 chiAutomizerObserver]: Analyzing ICFG Addition02.c [2020-07-29 03:05:00,270 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:05:00,271 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:05:00,271 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:05:00,271 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:05:00,273 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:05:00,273 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:05:00,273 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:05:00,273 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:05:00,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:05:00,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:00,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:00,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:00,338 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:05:00,339 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:00,339 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:05:00,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:05:00,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:00,346 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:00,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:00,347 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:05:00,348 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:00,357 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 8#L28true assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 19#L34true assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); 9#L39true call main_#t~ret4 := addition(main_~m~0, main_~n~0);< 14#additionENTRYtrue [2020-07-29 03:05:00,358 INFO L796 eck$LassoCheckResult]: Loop: 14#additionENTRYtrue ~m := #in~m;~n := #in~n; 17#L14true assume !(0 == ~n); 12#L17true assume ~n > 0; 11#L18true call #t~ret0 := addition(1 + ~m, ~n - 1);< 14#additionENTRYtrue [2020-07-29 03:05:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash 959461, now seen corresponding path program 1 times [2020-07-29 03:05:00,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:00,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436608458] [2020-07-29 03:05:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:00,465 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:00,473 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:00,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:00,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1666418, now seen corresponding path program 1 times [2020-07-29 03:05:00,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:00,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129348526] [2020-07-29 03:05:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:00,508 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:00,515 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:00,517 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:00,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1319862102, now seen corresponding path program 1 times [2020-07-29 03:05:00,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:00,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694120585] [2020-07-29 03:05:00,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:00,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:00,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:00,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:00,802 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:00,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:00,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:00,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:00,805 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:00,805 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:00,805 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:00,805 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:00,805 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition02.c_Iteration1_Loop [2020-07-29 03:05:00,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:00,806 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:00,836 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 03:05:00,849 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 03:05:00,855 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 03:05:00,861 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 03:05:00,873 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 03:05:00,879 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 03:05:00,893 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 03:05:01,091 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:01,093 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:01,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:01,121 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:01,122 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_~m=0} Honda state: {addition_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:01,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:01,182 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,188 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:01,188 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:01,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:01,247 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,252 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:01,253 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret0=0} Honda state: {addition_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:01,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:01,300 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 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 03:05:01,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:01,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:01,372 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:01,373 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=0} Honda state: {addition_#in~m=0} Generalized eigenvectors: [{addition_#in~m=2}, {addition_#in~m=-1}, {addition_#in~m=0}] Lambdas: [1, 1, 0] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:01,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:01,413 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:01,413 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#res=0} Honda state: {addition_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:01,449 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:01,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:01,525 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:01,529 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:01,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:01,530 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:01,530 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:01,530 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:01,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,531 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:01,531 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:01,531 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition02.c_Iteration1_Loop [2020-07-29 03:05:01,532 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:01,532 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:01,540 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 03:05:01,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:01,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 03:05:01,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 03:05:01,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 03:05:01,585 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 03:05:01,591 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 03:05:01,776 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:01,785 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,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 03:05:01,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:01,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:01,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:01,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:01,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:01,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:01,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:01,812 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,862 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 03:05:01,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:01,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:01,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:01,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:01,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:01,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:01,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:01,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:01,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:01,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:01,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:01,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:01,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:01,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:01,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:01,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:01,936 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) [2020-07-29 03:05:01,999 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 03:05:02,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:02,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:02,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:02,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:02,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:02,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:02,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:02,065 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 03:05:02,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:02,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:02,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:02,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:02,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:02,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:02,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,073 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:02,128 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 03:05:02,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:02,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:02,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:02,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:02,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:02,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:02,134 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,137 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,193 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 03:05:02,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:02,196 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:02,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:02,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:02,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:02,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:02,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:02,202 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:02,208 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:05:02,208 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:02,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:02,224 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:02,224 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:02,225 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_#in~n) = 1*addition_#in~n Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,282 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:02,289 INFO L393 LassoCheck]: Loop: "~m := #in~m;~n := #in~n;" "assume !(0 == ~n);" "assume ~n > 0;" "call #t~ret0 := addition(1 + ~m, ~n - 1);"< [2020-07-29 03:05:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:02,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:02,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:02,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:02,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {30#unseeded} is VALID [2020-07-29 03:05:02,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {30#unseeded} is VALID [2020-07-29 03:05:02,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {30#unseeded} is VALID [2020-07-29 03:05:02,395 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#unseeded} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {30#unseeded} is VALID [2020-07-29 03:05:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:02,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:02,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:02,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#(>= oldRank0 |addition_#in~n|)} ~m := #in~m;~n := #in~n; {57#(<= addition_~n oldRank0)} is VALID [2020-07-29 03:05:02,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {57#(<= addition_~n oldRank0)} assume !(0 == ~n); {57#(<= addition_~n oldRank0)} is VALID [2020-07-29 03:05:02,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {57#(<= addition_~n oldRank0)} assume ~n > 0; {64#(and (<= addition_~n oldRank0) (< 0 addition_~n))} is VALID [2020-07-29 03:05:02,573 INFO L263 TraceCheckUtils]: 3: Hoare triple {64#(and (<= addition_~n oldRank0) (< 0 addition_~n))} call #t~ret0 := addition(1 + ~m, ~n - 1); {43#(or (and (>= oldRank0 0) (> oldRank0 |addition_#in~n|)) unseeded)} is VALID [2020-07-29 03:05:02,574 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 03:05:02,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:05:02,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:02,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:02,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:02,628 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 03:05:02,629 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 4 states. [2020-07-29 03:05:02,978 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 4 states. Result 53 states and 72 transitions. Complement of second has 12 states. [2020-07-29 03:05:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:02,979 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:02,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:05:02,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:02,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:02,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:02,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:05:02,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:02,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:02,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:02,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 72 transitions. [2020-07-29 03:05:02,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:02,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:02,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:02,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states. [2020-07-29 03:05:03,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:03,013 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:03,014 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:05:03,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:03,018 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:03,019 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 72 transitions. cyclomatic complexity: 21 [2020-07-29 03:05:03,024 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:03,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:03,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:03,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:03,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:03,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:03,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:03,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 03:05:03,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 03:05:03,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 53 letters. Loop has 53 letters. [2020-07-29 03:05:03,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:05:03,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:05:03,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:05:03,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:03,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:03,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:03,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:03,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:03,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:03,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:05:03,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:05:03,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:05:03,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:03,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:03,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:03,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:03,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:03,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:03,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:03,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:03,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:03,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:03,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:03,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:03,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:03,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:03,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:03,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:05:03,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:05:03,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:05:03,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:03,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:03,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:03,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:05:03,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:05:03,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 5 letters. [2020-07-29 03:05:03,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:03,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:03,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 72 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:03,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,095 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:05:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 03:05:03,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:03,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:03,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-29 03:05:03,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 72 transitions. cyclomatic complexity: 21 [2020-07-29 03:05:03,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:03,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 26 states and 29 transitions. [2020-07-29 03:05:03,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 03:05:03,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 03:05:03,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2020-07-29 03:05:03,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:03,151 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-07-29 03:05:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2020-07-29 03:05:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2020-07-29 03:05:03,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:03,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 29 transitions. Second operand 17 states. [2020-07-29 03:05:03,194 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 29 transitions. Second operand 17 states. [2020-07-29 03:05:03,198 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 17 states. [2020-07-29 03:05:03,206 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:03,221 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-29 03:05:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-29 03:05:03,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:03,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:03,228 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 26 states and 29 transitions. [2020-07-29 03:05:03,229 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 26 states and 29 transitions. [2020-07-29 03:05:03,230 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:03,249 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-29 03:05:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-29 03:05:03,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:03,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:03,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:03,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:05:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 03:05:03,258 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:05:03,258 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:05:03,259 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:05:03,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 03:05:03,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:03,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:03,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:03,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:03,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:05:03,263 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; 149#L28 assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 150#L34 assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); 139#L39 call main_#t~ret4 := addition(main_~m~0, main_~n~0);< 143#additionENTRY ~m := #in~m;~n := #in~n; 145#L14 assume !(0 == ~n); 151#L17 assume !(~n > 0); 138#L20 [2020-07-29 03:05:03,263 INFO L796 eck$LassoCheckResult]: Loop: 138#L20 assume ~n < 0; 140#L21 call #t~ret1 := addition(~m - 1, 1 + ~n);< 147#additionENTRY ~m := #in~m;~n := #in~n; 154#L14 assume !(0 == ~n); 153#L17 assume !(~n > 0); 138#L20 [2020-07-29 03:05:03,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1481444455, now seen corresponding path program 1 times [2020-07-29 03:05:03,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:03,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378077052] [2020-07-29 03:05:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:03,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {330#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {330#true} is VALID [2020-07-29 03:05:03,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {330#true} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {330#true} is VALID [2020-07-29 03:05:03,450 INFO L280 TraceCheckUtils]: 2: Hoare triple {330#true} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {332#(or (= 0 ULTIMATE.start_main_~n~0) (< 0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 03:05:03,452 INFO L263 TraceCheckUtils]: 3: Hoare triple {332#(or (= 0 ULTIMATE.start_main_~n~0) (< 0 ULTIMATE.start_main_~n~0))} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {333#(or (= 0 |addition_#in~n|) (<= 1 |addition_#in~n|))} is VALID [2020-07-29 03:05:03,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {333#(or (= 0 |addition_#in~n|) (<= 1 |addition_#in~n|))} ~m := #in~m;~n := #in~n; {334#(or (= 0 addition_~n) (<= 1 addition_~n))} is VALID [2020-07-29 03:05:03,456 INFO L280 TraceCheckUtils]: 5: Hoare triple {334#(or (= 0 addition_~n) (<= 1 addition_~n))} assume !(0 == ~n); {335#(<= 1 addition_~n)} is VALID [2020-07-29 03:05:03,458 INFO L280 TraceCheckUtils]: 6: Hoare triple {335#(<= 1 addition_~n)} assume !(~n > 0); {331#false} is VALID [2020-07-29 03:05:03,459 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 03:05:03,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378077052] [2020-07-29 03:05:03,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:03,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:05:03,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699031690] [2020-07-29 03:05:03,467 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:05:03,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash 64193780, now seen corresponding path program 1 times [2020-07-29 03:05:03,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:03,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866123116] [2020-07-29 03:05:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:03,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:03,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:03,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:03,642 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:03,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:03,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:03,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:03,643 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:03,644 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,644 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:03,644 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:03,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition02.c_Iteration2_Loop [2020-07-29 03:05:03,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:03,645 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:03,661 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 03:05:03,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:03,680 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 03:05:03,756 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 03:05:03,761 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 03:05:03,918 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:03,918 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:03,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:03,923 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:03,928 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,975 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:03,975 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:04,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:04,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:13,624 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:13,627 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:13,627 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:13,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:13,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:13,628 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:13,628 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:13,628 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:13,628 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:13,628 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition02.c_Iteration2_Loop [2020-07-29 03:05:13,628 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:13,629 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:13,644 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 03:05:13,659 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 03:05:13,663 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 03:05:13,668 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 03:05:13,677 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 03:05:13,842 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:13,843 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:13,861 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 03:05:13,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:13,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:13,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:13,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:13,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:13,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:13,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:13,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:13,882 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:13,882 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:13,891 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:13,892 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:13,892 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:13,892 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_~n) = -1*addition_~n Supporting invariants [] [2020-07-29 03:05:13,939 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:13,942 INFO L393 LassoCheck]: Loop: "assume ~n < 0;" "call #t~ret1 := addition(~m - 1, 1 + ~n);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~n);" "assume !(~n > 0);" [2020-07-29 03:05:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:13,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:13,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:14,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {338#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_~m~0, main_~n~0, main_~result~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2; {338#unseeded} is VALID [2020-07-29 03:05:14,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {338#unseeded} assume !(main_~m~0 < 0 || main_~m~0 > 1073741823);main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {338#unseeded} is VALID [2020-07-29 03:05:14,016 INFO L280 TraceCheckUtils]: 2: Hoare triple {338#unseeded} assume !(main_~n~0 < 0 || main_~n~0 > 1073741823); {338#unseeded} is VALID [2020-07-29 03:05:14,018 INFO L263 TraceCheckUtils]: 3: Hoare triple {338#unseeded} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {338#unseeded} is VALID [2020-07-29 03:05:14,019 INFO L280 TraceCheckUtils]: 4: Hoare triple {338#unseeded} ~m := #in~m;~n := #in~n; {338#unseeded} is VALID [2020-07-29 03:05:14,021 INFO L280 TraceCheckUtils]: 5: Hoare triple {338#unseeded} assume !(0 == ~n); {338#unseeded} is VALID [2020-07-29 03:05:14,022 INFO L280 TraceCheckUtils]: 6: Hoare triple {338#unseeded} assume !(~n > 0); {338#unseeded} is VALID [2020-07-29 03:05:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:14,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {341#(>= oldRank0 (* (- 1) addition_~n))} assume ~n < 0; {374#(and (<= 0 (+ addition_~n oldRank0)) (< addition_~n 0))} is VALID [2020-07-29 03:05:14,350 INFO L263 TraceCheckUtils]: 1: Hoare triple {374#(and (<= 0 (+ addition_~n oldRank0)) (< addition_~n 0))} call #t~ret1 := addition(~m - 1, 1 + ~n); {378#(and (<= 1 oldRank0) (<= 1 (+ |addition_#in~n| oldRank0)))} is VALID [2020-07-29 03:05:14,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {378#(and (<= 1 oldRank0) (<= 1 (+ |addition_#in~n| oldRank0)))} ~m := #in~m;~n := #in~n; {382#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} is VALID [2020-07-29 03:05:14,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {382#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} assume !(0 == ~n); {382#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} is VALID [2020-07-29 03:05:14,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {382#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} assume !(~n > 0); {351#(or unseeded (and (> oldRank0 (* (- 1) addition_~n)) (>= oldRank0 0)))} is VALID [2020-07-29 03:05:14,358 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 03:05:14,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:14,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:14,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 03:05:14,383 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 03:05:14,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 31 states and 36 transitions. Complement of second has 13 states. [2020-07-29 03:05:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 03:05:14,501 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:14,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 03:05:14,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:14,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:14,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:14,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:14,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:14,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:14,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-07-29 03:05:14,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:14,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:14,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:14,507 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 03:05:14,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:14,509 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:14,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:14,512 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:14,512 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 36 transitions. cyclomatic complexity: 8 [2020-07-29 03:05:14,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:14,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:14,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:14,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:14,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:14,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:14,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:14,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:05:14,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:05:14,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 31 letters. Loop has 31 letters. [2020-07-29 03:05:14,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:05:14,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:05:14,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:05:14,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:14,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:14,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:14,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:14,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:14,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:14,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:14,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:14,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:14,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:14,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:14,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:05:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:05:14,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 5 letters. [2020-07-29 03:05:14,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:14,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:14,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:14,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:14,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:14,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:14,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:14,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:14,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:14,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:14,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:14,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:14,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:05:14,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:05:14,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 5 letters. [2020-07-29 03:05:14,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:14,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:14,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:14,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:05:14,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:05:14,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:05:14,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:14,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:14,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:14,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,548 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2020-07-29 03:05:14,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 5 letters. [2020-07-29 03:05:14,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 12 letters. Loop has 5 letters. [2020-07-29 03:05:14,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 10 letters. [2020-07-29 03:05:14,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:14,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. cyclomatic complexity: 8 [2020-07-29 03:05:14,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:14,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 30 transitions. [2020-07-29 03:05:14,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:05:14,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 03:05:14,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2020-07-29 03:05:14,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:14,570 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-07-29 03:05:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2020-07-29 03:05:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-29 03:05:14,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:14,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 30 transitions. Second operand 24 states. [2020-07-29 03:05:14,576 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 30 transitions. Second operand 24 states. [2020-07-29 03:05:14,576 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 24 states. [2020-07-29 03:05:14,577 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:14,582 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-29 03:05:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-29 03:05:14,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:14,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:14,586 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states and 30 transitions. [2020-07-29 03:05:14,587 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states and 30 transitions. [2020-07-29 03:05:14,587 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:14,593 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-29 03:05:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2020-07-29 03:05:14,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:14,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:14,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:14,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 03:05:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-29 03:05:14,597 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 03:05:14,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:14,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 03:05:14,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 03:05:14,604 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 6 states. [2020-07-29 03:05:14,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:14,713 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 03:05:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:05:14,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:05:14,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:14,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-07-29 03:05:14,732 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:14,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 03:05:14,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:05:14,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:05:14,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:05:14,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:14,733 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:14,733 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:14,733 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:14,734 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:05:14,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:05:14,734 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:14,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:14,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:05:14 BoogieIcfgContainer [2020-07-29 03:05:14,742 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:05:14,742 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:05:14,742 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:05:14,742 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:05:14,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:00" (3/4) ... [2020-07-29 03:05:14,747 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:05:14,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:05:14,751 INFO L168 Benchmark]: Toolchain (without parser) took 15422.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -51.9 MB). Peak memory consumption was 147.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:14,751 INFO L168 Benchmark]: CDTParser took 0.52 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 03:05:14,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.61 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:14,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:14,754 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:14,754 INFO L168 Benchmark]: RCFGBuilder took 463.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:14,755 INFO L168 Benchmark]: BuchiAutomizer took 14540.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.9 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:14,756 INFO L168 Benchmark]: Witness Printer took 5.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:05:14,760 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.52 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 270.61 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 463.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 14540.64 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 79.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.9 MB). Peak memory consumption was 155.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function -1 * n and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 12.6s. Construction of modules took 0.1s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 41 SDslu, 10 SDs, 0 SdLazy, 66 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp67 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf93 smp87 dnf100 smp100 tf111 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...