./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Addition03-1.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/Addition03-1.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 dc212c6f03bbd9a964d699fa8baa949beea27f48 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:58,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:04:58,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:04:59,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:04:59,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:04:59,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:04:59,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:04:59,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:04:59,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:04:59,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:04:59,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:04:59,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:04:59,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:04:59,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:04:59,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:04:59,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:04:59,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:04:59,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:04:59,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:04:59,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:04:59,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:04:59,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:04:59,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:04:59,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:04:59,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:04:59,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:04:59,052 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:04:59,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:04:59,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:04:59,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:04:59,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:04:59,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:04:59,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:04:59,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:04:59,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:04:59,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:04:59,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:04:59,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:04:59,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:04:59,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:04:59,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:04:59,066 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:59,086 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:04:59,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:04:59,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:04:59,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:04:59,089 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:04:59,089 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:04:59,090 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:04:59,090 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:04:59,090 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:04:59,090 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:04:59,091 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:04:59,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:04:59,091 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:04:59,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:04:59,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:04:59,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:04:59,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:04:59,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:04:59,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:04:59,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:04:59,094 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:04:59,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:04:59,094 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:04:59,095 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:04:59,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:04:59,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:04:59,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:04:59,096 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:04:59,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:04:59,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:04:59,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:04:59,097 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:04:59,098 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:04:59,099 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 -> dc212c6f03bbd9a964d699fa8baa949beea27f48 [2020-07-29 03:04:59,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:04:59,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:04:59,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:04:59,480 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:04:59,480 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:04:59,481 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Addition03-1.c [2020-07-29 03:04:59,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301dae6bc/9893fd4ea2f94c458047dcb7f47765a0/FLAG278e7ab58 [2020-07-29 03:05:00,126 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:05:00,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Addition03-1.c [2020-07-29 03:05:00,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301dae6bc/9893fd4ea2f94c458047dcb7f47765a0/FLAG278e7ab58 [2020-07-29 03:05:00,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/301dae6bc/9893fd4ea2f94c458047dcb7f47765a0 [2020-07-29 03:05:00,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:05:00,464 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:05:00,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:05:00,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:05:00,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:05:00,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585c6ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00, skipping insertion in model container [2020-07-29 03:05:00,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,487 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:05:00,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:05:00,798 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:05:00,807 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:05:00,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:05:00,853 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:05:00,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00 WrapperNode [2020-07-29 03:05:00,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:05:00,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:05:00,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:05:00,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:05:00,870 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:05:00" (1/1) ... [2020-07-29 03:05:00,875 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:05:00" (1/1) ... [2020-07-29 03:05:00,894 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:05:00,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:05:00,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:05:00,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:05:00,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (1/1) ... [2020-07-29 03:05:00,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:05:00,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:05:00,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:05:00,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:05:00,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (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:05:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:05:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:05:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2020-07-29 03:05:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2020-07-29 03:05:01,333 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:05:01,334 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 03:05:01,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:01 BoogieIcfgContainer [2020-07-29 03:05:01,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:05:01,338 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:05:01,338 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:05:01,342 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:05:01,346 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:01,346 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:05:00" (1/3) ... [2020-07-29 03:05:01,348 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f0fa96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:01, skipping insertion in model container [2020-07-29 03:05:01,348 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:01,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:05:00" (2/3) ... [2020-07-29 03:05:01,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f0fa96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:05:01, skipping insertion in model container [2020-07-29 03:05:01,349 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:05:01,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:05:01" (3/3) ... [2020-07-29 03:05:01,352 INFO L371 chiAutomizerObserver]: Analyzing ICFG Addition03-1.c [2020-07-29 03:05:01,464 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:05:01,465 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:05:01,465 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:05:01,465 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:05:01,467 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:05:01,467 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:05:01,468 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:05:01,468 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:05:01,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:05:01,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:01,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:01,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:01,577 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:05:01,577 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:01,578 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:05:01,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:05:01,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:01,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:01,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:01,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 03:05:01,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:01,592 INFO L794 eck$LassoCheckResult]: Stem: 14#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 8#L29true call main_#t~ret4 := addition(main_~m~0, main_~n~0);< 13#additionENTRYtrue [2020-07-29 03:05:01,593 INFO L796 eck$LassoCheckResult]: Loop: 13#additionENTRYtrue ~m := #in~m;~n := #in~n; 16#L14true assume !(0 == ~n); 11#L17true assume ~n > 0; 9#L18true call #t~ret0 := addition(1 + ~m, ~n - 1);< 13#additionENTRYtrue [2020-07-29 03:05:01,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:01,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1024, now seen corresponding path program 1 times [2020-07-29 03:05:01,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:01,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916011601] [2020-07-29 03:05:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:01,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:01,688 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:01,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:01,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1358578, now seen corresponding path program 1 times [2020-07-29 03:05:01,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:01,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55367557] [2020-07-29 03:05:01,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:01,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:01,768 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:01,771 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash 946120561, now seen corresponding path program 1 times [2020-07-29 03:05:01,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:01,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442600185] [2020-07-29 03:05:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:01,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:01,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:01,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:02,045 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:02,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:02,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:02,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:02,046 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:02,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:02,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:02,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition03-1.c_Iteration1_Loop [2020-07-29 03:05:02,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:02,048 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:02,082 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:02,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:02,101 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:02,108 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:02,118 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:02,124 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:02,140 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:02,345 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:02,346 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:02,355 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:02,355 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:02,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:02,368 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:02,408 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:02,414 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:02,414 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:02,445 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:02,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:02,451 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:02,491 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:02,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:02,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:02,551 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:02,552 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:02,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:02,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:02,594 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:02,595 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:02,632 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:02,632 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:02,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:02,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:02,700 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:02,703 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:02,703 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:02,704 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:02,704 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:02,704 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:02,704 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:02,705 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:02,705 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:02,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition03-1.c_Iteration1_Loop [2020-07-29 03:05:02,706 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:02,706 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:02,717 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:02,727 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:02,733 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:02,738 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:02,745 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:02,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:02,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:02,954 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:02,961 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:02,968 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,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:02,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:02,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:02,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:02,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:02,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:02,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:02,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:03,038 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:03,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:03,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:03,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:03,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:03,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:03,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:03,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,047 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:03,105 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:03,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:03,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:03,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:03,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:03,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:03,110 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:03,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:03,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,168 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:03,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:03,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:03,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:03,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:03,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:03,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:03,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:03,178 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:03,239 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:03,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:03,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:03,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:03,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:03,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:03,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:03,243 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:03,246 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,296 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:03,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:03,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:03,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:03,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:03,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:03,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:03,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:03,304 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:03,356 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:03,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:03,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:03,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:03,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:03,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:03,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:03,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:03,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:03,373 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:05:03,374 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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:03,383 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:03,384 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:03,384 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:03,385 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_#in~n) = 1*addition_#in~n Supporting invariants [] [2020-07-29 03:05:03,452 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:03,458 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:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:03,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:03,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:03,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {28#unseeded} is VALID [2020-07-29 03:05:03,548 INFO L263 TraceCheckUtils]: 1: Hoare triple {28#unseeded} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {28#unseeded} is VALID [2020-07-29 03:05:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:03,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:03,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:03,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 |addition_#in~n|)} ~m := #in~m;~n := #in~n; {49#(<= addition_~n oldRank0)} is VALID [2020-07-29 03:05:03,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {49#(<= addition_~n oldRank0)} assume !(0 == ~n); {49#(<= addition_~n oldRank0)} is VALID [2020-07-29 03:05:03,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= addition_~n oldRank0)} assume ~n > 0; {56#(and (<= addition_~n oldRank0) (< 0 addition_~n))} is VALID [2020-07-29 03:05:03,674 INFO L263 TraceCheckUtils]: 3: Hoare triple {56#(and (<= addition_~n oldRank0) (< 0 addition_~n))} call #t~ret0 := addition(1 + ~m, ~n - 1); {41#(or (and (>= oldRank0 0) (> oldRank0 |addition_#in~n|)) unseeded)} is VALID [2020-07-29 03:05:03,674 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,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:05:03,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:03,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:03,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:03,732 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:03,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2020-07-29 03:05:04,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 48 states and 66 transitions. Complement of second has 12 states. [2020-07-29 03:05:04,020 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:04,020 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:04,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:05:04,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:04,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:04,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:04,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:05:04,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:04,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:04,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:04,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 66 transitions. [2020-07-29 03:05:04,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:04,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:04,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:04,036 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 03:05:04,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:04,042 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:04,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:05:04,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:04,045 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:04,045 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 66 transitions. cyclomatic complexity: 20 [2020-07-29 03:05:04,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:04,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:04,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:04,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:05:04,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:05:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 48 letters. Loop has 48 letters. [2020-07-29 03:05:04,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:05:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:05:04,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:05:04,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:04,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:04,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:04,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 4 letters. [2020-07-29 03:05:04,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:04,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:05:04,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:05:04,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:05:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:04,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:04,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:05:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:04,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:04,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:04,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:04,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:04,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:04,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:04,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:04,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:04,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:05:04,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:05:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:05:04,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 03:05:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 5 letters. [2020-07-29 03:05:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 66 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 5 letters. [2020-07-29 03:05:04,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,078 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:05:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-07-29 03:05:04,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 03:05:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:05:04,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 03:05:04,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:04,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 66 transitions. cyclomatic complexity: 20 [2020-07-29 03:05:04,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:04,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 24 states and 27 transitions. [2020-07-29 03:05:04,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 03:05:04,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:05:04,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2020-07-29 03:05:04,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:04,105 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 03:05:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2020-07-29 03:05:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2020-07-29 03:05:04,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:04,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 03:05:04,142 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 03:05:04,144 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 03:05:04,149 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:04,154 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-29 03:05:04,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-29 03:05:04,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:04,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:04,158 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 24 states and 27 transitions. [2020-07-29 03:05:04,158 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 24 states and 27 transitions. [2020-07-29 03:05:04,158 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:04,165 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-29 03:05:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-29 03:05:04,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:04,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:04,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:04,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:05:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 03:05:04,171 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 03:05:04,171 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 03:05:04,171 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:05:04,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-07-29 03:05:04,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:04,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:04,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:04,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:05:04,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 03:05:04,174 INFO L794 eck$LassoCheckResult]: Stem: 135#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 126#L29 call main_#t~ret4 := addition(main_~m~0, main_~n~0);< 125#additionENTRY ~m := #in~m;~n := #in~n; 128#L14 assume !(0 == ~n); 136#L17 assume !(~n > 0); 131#L20 [2020-07-29 03:05:04,174 INFO L796 eck$LassoCheckResult]: Loop: 131#L20 assume ~n < 0; 132#L21 call #t~ret1 := addition(~m - 1, 1 + ~n);< 134#additionENTRY ~m := #in~m;~n := #in~n; 139#L14 assume !(0 == ~n); 138#L17 assume !(~n > 0); 131#L20 [2020-07-29 03:05:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:04,175 INFO L82 PathProgramCache]: Analyzing trace with hash 30520020, now seen corresponding path program 1 times [2020-07-29 03:05:04,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:04,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369953964] [2020-07-29 03:05:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:04,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:04,187 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:04,189 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash 54650730, now seen corresponding path program 1 times [2020-07-29 03:05:04,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:04,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66525198] [2020-07-29 03:05:04,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:04,199 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:04,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:04,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1564606345, now seen corresponding path program 1 times [2020-07-29 03:05:04,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:04,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348319954] [2020-07-29 03:05:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:04,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:04,227 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:04,230 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:04,448 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:04,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:04,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:04,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:04,449 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:04,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:04,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:04,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:04,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition03-1.c_Iteration2_Loop [2020-07-29 03:05:04,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:04,450 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:04,468 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:04,474 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:04,490 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:04,502 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:04,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:05:04,719 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:04,719 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:04,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:04,726 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:04,749 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:04,749 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#t~ret1=0} Honda state: {addition_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 18 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:04,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:04,808 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 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 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,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:04,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:14,540 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:14,544 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:14,544 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:14,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:14,544 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:14,544 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:14,544 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:14,544 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:14,544 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:14,545 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition03-1.c_Iteration2_Loop [2020-07-29 03:05:14,545 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:14,545 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:14,556 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:14,574 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:14,579 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:14,583 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:14,593 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:14,766 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:14,766 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:14,785 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:14,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:14,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:14,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:14,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:14,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:14,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:14,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:14,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:14,806 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:14,807 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:14,816 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:14,817 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:14,817 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:14,817 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_~n) = -1*addition_~n Supporting invariants [] [2020-07-29 03:05:14,859 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:14,864 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:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:05:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:14,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {309#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {309#unseeded} is VALID [2020-07-29 03:05:14,937 INFO L263 TraceCheckUtils]: 1: Hoare triple {309#unseeded} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {309#unseeded} is VALID [2020-07-29 03:05:14,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#unseeded} ~m := #in~m;~n := #in~n; {309#unseeded} is VALID [2020-07-29 03:05:14,939 INFO L280 TraceCheckUtils]: 3: Hoare triple {309#unseeded} assume !(0 == ~n); {309#unseeded} is VALID [2020-07-29 03:05:14,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#unseeded} assume !(~n > 0); {309#unseeded} is VALID [2020-07-29 03:05:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:14,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:15,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#(>= oldRank0 (* (- 1) addition_~n))} assume ~n < 0; {339#(and (<= 0 (+ addition_~n oldRank0)) (< addition_~n 0))} is VALID [2020-07-29 03:05:15,252 INFO L263 TraceCheckUtils]: 1: Hoare triple {339#(and (<= 0 (+ addition_~n oldRank0)) (< addition_~n 0))} call #t~ret1 := addition(~m - 1, 1 + ~n); {343#(and (<= 1 oldRank0) (<= 1 (+ |addition_#in~n| oldRank0)))} is VALID [2020-07-29 03:05:15,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {343#(and (<= 1 oldRank0) (<= 1 (+ |addition_#in~n| oldRank0)))} ~m := #in~m;~n := #in~n; {347#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} is VALID [2020-07-29 03:05:15,255 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} assume !(0 == ~n); {347#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} is VALID [2020-07-29 03:05:15,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {347#(and (<= 1 oldRank0) (<= 1 (+ addition_~n oldRank0)))} assume !(~n > 0); {322#(or unseeded (and (> oldRank0 (* (- 1) addition_~n)) (>= oldRank0 0)))} is VALID [2020-07-29 03:05:15,258 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:15,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:15,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:15,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,282 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:15,282 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 03:05:15,409 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 29 states and 34 transitions. Complement of second has 13 states. [2020-07-29 03:05:15,409 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:15,409 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:15,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 03:05:15,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:15,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:15,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:05:15,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:15,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:15,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:15,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2020-07-29 03:05:15,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:15,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:15,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:15,418 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 03:05:15,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:15,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:05:15,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:05:15,421 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:15,422 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 03:05:15,424 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:15,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:15,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:15,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:15,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:15,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:15,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:15,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:05:15,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:05:15,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 29 letters. Loop has 29 letters. [2020-07-29 03:05:15,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:05:15,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:05:15,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:05:15,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:05:15,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:05:15,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2020-07-29 03:05:15,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:15,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:15,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:15,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:15,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:15,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:05:15,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:15,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:15,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:05:15,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:15,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:15,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:05:15,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:15,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:15,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:15,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:15,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:15,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:15,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:15,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:15,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:15,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:15,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:15,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:15,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:15,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:15,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:15,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:05:15,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:05:15,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:05:15,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:05:15,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:05:15,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 34 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:05:15,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,453 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:05:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2020-07-29 03:05:15,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:05:15,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 5 letters. [2020-07-29 03:05:15,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 5 letters. Loop has 10 letters. [2020-07-29 03:05:15,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:15,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. cyclomatic complexity: 8 [2020-07-29 03:05:15,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:15,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 24 states and 28 transitions. [2020-07-29 03:05:15,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:05:15,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:05:15,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-07-29 03:05:15,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:15,463 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 03:05:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-07-29 03:05:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-29 03:05:15,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:15,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 28 transitions. Second operand 22 states. [2020-07-29 03:05:15,466 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 28 transitions. Second operand 22 states. [2020-07-29 03:05:15,466 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 22 states. [2020-07-29 03:05:15,467 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:15,471 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2020-07-29 03:05:15,472 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-29 03:05:15,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:15,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:15,479 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states and 28 transitions. [2020-07-29 03:05:15,479 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states and 28 transitions. [2020-07-29 03:05:15,479 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:15,486 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-29 03:05:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-29 03:05:15,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:15,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:15,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:15,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:05:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-29 03:05:15,491 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 03:05:15,491 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-29 03:05:15,491 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:05:15,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2020-07-29 03:05:15,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:15,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:15,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:15,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:05:15,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:05:15,495 INFO L794 eck$LassoCheckResult]: Stem: 411#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 401#L29 call main_#t~ret4 := addition(main_~m~0, main_~n~0);< 416#additionENTRY ~m := #in~m;~n := #in~n; 412#L14 assume !(0 == ~n); 413#L17 assume !(~n > 0); 400#L20 assume ~n < 0; 403#L21 call #t~ret1 := addition(~m - 1, 1 + ~n);< 409#additionENTRY ~m := #in~m;~n := #in~n; 410#L14 assume !(0 == ~n); 415#L17 assume ~n > 0; 406#L18 [2020-07-29 03:05:15,495 INFO L796 eck$LassoCheckResult]: Loop: 406#L18 call #t~ret0 := addition(1 + ~m, ~n - 1);< 405#additionENTRY ~m := #in~m;~n := #in~n; 408#L14 assume !(0 == ~n); 420#L17 assume ~n > 0; 406#L18 [2020-07-29 03:05:15,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:15,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1564606348, now seen corresponding path program 1 times [2020-07-29 03:05:15,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:15,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509274402] [2020-07-29 03:05:15,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:15,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {598#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {598#true} is VALID [2020-07-29 03:05:15,584 INFO L263 TraceCheckUtils]: 1: Hoare triple {598#true} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {598#true} is VALID [2020-07-29 03:05:15,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {598#true} ~m := #in~m;~n := #in~n; {598#true} is VALID [2020-07-29 03:05:15,585 INFO L280 TraceCheckUtils]: 3: Hoare triple {598#true} assume !(0 == ~n); {598#true} is VALID [2020-07-29 03:05:15,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {598#true} assume !(~n > 0); {598#true} is VALID [2020-07-29 03:05:15,586 INFO L280 TraceCheckUtils]: 5: Hoare triple {598#true} assume ~n < 0; {600#(<= (+ addition_~n 1) 0)} is VALID [2020-07-29 03:05:15,587 INFO L263 TraceCheckUtils]: 6: Hoare triple {600#(<= (+ addition_~n 1) 0)} call #t~ret1 := addition(~m - 1, 1 + ~n); {601#(<= |addition_#in~n| 0)} is VALID [2020-07-29 03:05:15,588 INFO L280 TraceCheckUtils]: 7: Hoare triple {601#(<= |addition_#in~n| 0)} ~m := #in~m;~n := #in~n; {602#(<= addition_~n 0)} is VALID [2020-07-29 03:05:15,589 INFO L280 TraceCheckUtils]: 8: Hoare triple {602#(<= addition_~n 0)} assume !(0 == ~n); {602#(<= addition_~n 0)} is VALID [2020-07-29 03:05:15,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {602#(<= addition_~n 0)} assume ~n > 0; {599#false} is VALID [2020-07-29 03:05:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:05:15,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509274402] [2020-07-29 03:05:15,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:05:15,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:05:15,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089396373] [2020-07-29 03:05:15,597 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:05:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1950448, now seen corresponding path program 2 times [2020-07-29 03:05:15,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:05:15,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740688446] [2020-07-29 03:05:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:05:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:15,604 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:05:15,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:05:15,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:05:15,713 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:15,713 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:15,713 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:15,713 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:15,713 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:05:15,713 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:15,714 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:15,714 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:15,714 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition03-1.c_Iteration3_Loop [2020-07-29 03:05:15,714 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:15,714 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:15,720 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:15,728 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:15,732 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:15,743 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:15,747 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:15,891 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:15,891 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:15,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:15,896 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:15,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:15,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:16,173 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:16,173 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {addition_#in~m=6, addition_~m=7} Honda state: {addition_#in~m=6, addition_~m=7} Generalized eigenvectors: [{addition_#in~m=7, addition_~m=1}, {addition_#in~m=-6, addition_~m=0}, {addition_#in~m=1, addition_~m=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:16,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:16,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:16,205 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 03:05:16,205 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:16,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:05:16,233 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:16,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:05:16,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:05:18,032 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:05:18,035 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:05:18,035 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:05:18,035 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:05:18,035 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:05:18,035 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:05:18,035 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:18,035 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:05:18,035 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:05:18,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: Addition03-1.c_Iteration3_Loop [2020-07-29 03:05:18,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:05:18,036 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:05:18,043 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:18,053 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:18,058 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:18,072 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:18,078 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:18,217 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:05:18,217 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:18,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:05:18,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:18,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:18,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:18,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:18,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:18,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:18,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:18,238 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 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:18,268 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:18,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:18,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:18,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:18,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:18,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:18,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:18,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:18,274 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:18,302 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:18,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:05:18,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:05:18,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:05:18,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:05:18,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:05:18,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:05:18,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:05:18,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:05:18,320 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:05:18,320 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:05:18,327 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:05:18,327 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:05:18,327 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:05:18,328 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(addition_~n) = 1*addition_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:05:18,366 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:05:18,369 INFO L393 LassoCheck]: Loop: "call #t~ret0 := addition(1 + ~m, ~n - 1);"< "~m := #in~m;~n := #in~n;" "assume !(0 == ~n);" "assume ~n > 0;" [2020-07-29 03:05:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:18,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:05:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:18,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:05:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:18,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:18,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {605#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;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; {605#unseeded} is VALID [2020-07-29 03:05:18,443 INFO L263 TraceCheckUtils]: 1: Hoare triple {605#unseeded} call main_#t~ret4 := addition(main_~m~0, main_~n~0); {605#unseeded} is VALID [2020-07-29 03:05:18,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {605#unseeded} ~m := #in~m;~n := #in~n; {605#unseeded} is VALID [2020-07-29 03:05:18,445 INFO L280 TraceCheckUtils]: 3: Hoare triple {605#unseeded} assume !(0 == ~n); {605#unseeded} is VALID [2020-07-29 03:05:18,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {605#unseeded} assume !(~n > 0); {605#unseeded} is VALID [2020-07-29 03:05:18,447 INFO L280 TraceCheckUtils]: 5: Hoare triple {605#unseeded} assume ~n < 0; {605#unseeded} is VALID [2020-07-29 03:05:18,448 INFO L263 TraceCheckUtils]: 6: Hoare triple {605#unseeded} call #t~ret1 := addition(~m - 1, 1 + ~n); {605#unseeded} is VALID [2020-07-29 03:05:18,450 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#unseeded} ~m := #in~m;~n := #in~n; {605#unseeded} is VALID [2020-07-29 03:05:18,450 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#unseeded} assume !(0 == ~n); {605#unseeded} is VALID [2020-07-29 03:05:18,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {605#unseeded} assume ~n > 0; {605#unseeded} is VALID [2020-07-29 03:05:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:18,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:05:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:05:18,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:05:18,631 INFO L263 TraceCheckUtils]: 0: Hoare triple {608#(>= oldRank0 addition_~n)} call #t~ret0 := addition(1 + ~m, ~n - 1); {650#(<= (+ |addition_#in~n| 1) oldRank0)} is VALID [2020-07-29 03:05:18,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {650#(<= (+ |addition_#in~n| 1) oldRank0)} ~m := #in~m;~n := #in~n; {654#(<= (+ addition_~n 1) oldRank0)} is VALID [2020-07-29 03:05:18,634 INFO L280 TraceCheckUtils]: 2: Hoare triple {654#(<= (+ addition_~n 1) oldRank0)} assume !(0 == ~n); {654#(<= (+ addition_~n 1) oldRank0)} is VALID [2020-07-29 03:05:18,635 INFO L280 TraceCheckUtils]: 3: Hoare triple {654#(<= (+ addition_~n 1) oldRank0)} assume ~n > 0; {618#(or unseeded (and (> oldRank0 addition_~n) (>= oldRank0 0)))} is VALID [2020-07-29 03:05:18,636 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:18,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:05:18,650 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:18,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,651 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:18,652 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 03:05:18,764 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 26 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 54 states and 62 transitions. Complement of second has 9 states. [2020-07-29 03:05:18,764 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:18,764 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:18,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. cyclomatic complexity: 7 [2020-07-29 03:05:18,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:18,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:18,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:05:18,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:18,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:18,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:18,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2020-07-29 03:05:18,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:18,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:05:18,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:05:18,775 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 26 transitions. cyclomatic complexity: 7 [2020-07-29 03:05:18,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:18,777 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:05:18,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:05:18,779 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:05:18,779 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 62 transitions. cyclomatic complexity: 13 [2020-07-29 03:05:18,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:05:18,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:18,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 54 letters. Loop has 54 letters. [2020-07-29 03:05:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 54 letters. Loop has 54 letters. [2020-07-29 03:05:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 54 letters. Loop has 54 letters. [2020-07-29 03:05:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:05:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:05:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:05:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:05:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:05:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:05:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 5 letters. [2020-07-29 03:05:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:05:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:05:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:05:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:05:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 5 letters. [2020-07-29 03:05:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:05:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:05:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:05:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:05:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:05:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:05:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:05:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:05:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:05:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:05:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 5 letters. [2020-07-29 03:05:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 03:05:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 5 letters. [2020-07-29 03:05:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 26 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 62 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,801 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:05:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:05:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 03:05:18,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:05:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:05:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 03:05:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:05:18,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. cyclomatic complexity: 13 [2020-07-29 03:05:18,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:05:18,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 46 states and 54 transitions. [2020-07-29 03:05:18,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 03:05:18,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 03:05:18,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2020-07-29 03:05:18,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:05:18,812 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2020-07-29 03:05:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2020-07-29 03:05:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2020-07-29 03:05:18,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:05:18,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 54 transitions. Second operand 40 states. [2020-07-29 03:05:18,817 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 54 transitions. Second operand 40 states. [2020-07-29 03:05:18,817 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 40 states. [2020-07-29 03:05:18,817 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:18,823 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2020-07-29 03:05:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-07-29 03:05:18,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:18,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:18,825 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 46 states and 54 transitions. [2020-07-29 03:05:18,825 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 46 states and 54 transitions. [2020-07-29 03:05:18,826 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:05:18,834 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2020-07-29 03:05:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2020-07-29 03:05:18,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:05:18,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:05:18,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:05:18,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:05:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 03:05:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2020-07-29 03:05:18,838 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2020-07-29 03:05:18,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:05:18,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:05:18,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:05:18,845 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2020-07-29 03:05:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:05:18,951 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-29 03:05:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:05:18,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:05:18,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:05:18,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 30 transitions. [2020-07-29 03:05:18,972 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:18,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-07-29 03:05:18,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:05:18,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:05:18,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:05:18,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:05:18,973 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:18,973 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:18,973 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:05:18,973 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:05:18,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:05:18,973 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:05:18,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:05:18,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:05:18 BoogieIcfgContainer [2020-07-29 03:05:18,981 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:05:18,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:05:18,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:05:18,982 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:05:18,983 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:01" (3/4) ... [2020-07-29 03:05:18,987 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:05:18,987 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:05:18,991 INFO L168 Benchmark]: Toolchain (without parser) took 18529.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 954.9 MB in the beginning and 857.3 MB in the end (delta: 97.5 MB). Peak memory consumption was 291.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:18,992 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:05:18,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 392.69 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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:18,993 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.18 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:05:18,994 INFO L168 Benchmark]: Boogie Preprocessor took 85.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:18,995 INFO L168 Benchmark]: RCFGBuilder took 356.98 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:18,995 INFO L168 Benchmark]: BuchiAutomizer took 17643.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 857.3 MB in the end (delta: 224.4 MB). Peak memory consumption was 305.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:05:18,996 INFO L168 Benchmark]: Witness Printer took 5.15 ms. Allocated memory is still 1.2 GB. Free memory is still 857.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:05:18,999 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 392.69 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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 35.18 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 356.98 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17643.42 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 857.3 MB in the end (delta: 224.4 MB). Peak memory consumption was 305.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.15 ms. Allocated memory is still 1.2 GB. Free memory is still 857.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 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. One deterministic module has affine ranking function n and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.5s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 15.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 50 SDslu, 14 SDs, 0 SdLazy, 87 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq173 hnf92 smp91 dnf100 smp100 tf110 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 12.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...