./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2f1e635c5c806286d01eb0b8ff07448b8253a7a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 19:07:11,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:07:11,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:07:11,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:07:11,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:07:11,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:07:11,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:07:11,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:07:11,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:07:11,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:07:11,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:07:11,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:07:11,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:07:11,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:07:11,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:07:11,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:07:11,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:07:11,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:07:11,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:07:11,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:07:11,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:07:11,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:07:11,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:07:11,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:07:11,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:07:11,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:07:11,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:07:11,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:07:11,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:07:11,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:07:11,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:07:11,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:07:11,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:07:11,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:07:11,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:07:11,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:07:11,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:07:11,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:07:11,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:07:11,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:07:11,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:07:11,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:07:11,944 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:07:11,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:07:11,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:07:11,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:07:11,946 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:07:11,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:07:11,947 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:07:11,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:07:11,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:07:11,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:07:11,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:07:11,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:07:11,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:07:11,948 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:07:11,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:07:11,949 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:07:11,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:07:11,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:07:11,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:07:11,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:07:11,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:07:11,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:07:11,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:07:11,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:07:11,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:07:11,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:07:11,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:07:11,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:07:11,952 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:07:11,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(__VERIFIER_error())) ) 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 -> c2f1e635c5c806286d01eb0b8ff07448b8253a7a [2020-07-28 19:07:12,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:07:12,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:07:12,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:07:12,313 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:07:12,313 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:07:12,314 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c [2020-07-28 19:07:12,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78137828/12b52814537c4b14958c9030b5926d9d/FLAG824aae816 [2020-07-28 19:07:12,912 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:07:12,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2020-07-28 19:07:12,921 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78137828/12b52814537c4b14958c9030b5926d9d/FLAG824aae816 [2020-07-28 19:07:13,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78137828/12b52814537c4b14958c9030b5926d9d [2020-07-28 19:07:13,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:07:13,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:07:13,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:07:13,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:07:13,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:07:13,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3519153f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13, skipping insertion in model container [2020-07-28 19:07:13,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:07:13,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:07:13,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:07:13,575 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:07:13,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:07:13,606 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:07:13,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13 WrapperNode [2020-07-28 19:07:13,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:07:13,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:07:13,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:07:13,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:07:13,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:07:13,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:07:13,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:07:13,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:07:13,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (1/1) ... [2020-07-28 19:07:13,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:07:13,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:07:13,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:07:13,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:07:13,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:07:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:07:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:07:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-28 19:07:13,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-28 19:07:14,070 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:07:14,071 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:07:14,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:07:14 BoogieIcfgContainer [2020-07-28 19:07:14,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:07:14,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:07:14,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:07:14,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:07:14,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:07:13" (1/3) ... [2020-07-28 19:07:14,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e808339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:07:14, skipping insertion in model container [2020-07-28 19:07:14,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:07:13" (2/3) ... [2020-07-28 19:07:14,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e808339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:07:14, skipping insertion in model container [2020-07-28 19:07:14,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:07:14" (3/3) ... [2020-07-28 19:07:14,089 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-07-28 19:07:14,105 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:07:14,115 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:07:14,132 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:07:14,162 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:07:14,162 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:07:14,162 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:07:14,162 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:07:14,163 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:07:14,163 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:07:14,163 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:07:14,163 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:07:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-07-28 19:07:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 19:07:14,190 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:14,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:14,192 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1260755674, now seen corresponding path program 1 times [2020-07-28 19:07:14,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:14,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606316064] [2020-07-28 19:07:14,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:14,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:14,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} ~m := #in~m;~n := #in~n; {34#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:14,580 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:14,581 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:14,584 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {27#(<= 0 ULTIMATE.start_main_~n~0)} #42#return; {32#(<= 1 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:14,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {25#true} is VALID [2020-07-28 19:07:14,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {25#true} is VALID [2020-07-28 19:07:14,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {27#(<= 0 ULTIMATE.start_main_~n~0)} is VALID [2020-07-28 19:07:14,595 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#(<= 0 ULTIMATE.start_main_~n~0)} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {25#true} is VALID [2020-07-28 19:07:14,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#true} ~m := #in~m;~n := #in~n; {34#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:14,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:14,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:14,601 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {35#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {27#(<= 0 ULTIMATE.start_main_~n~0)} #42#return; {32#(<= 1 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:14,603 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#(<= 1 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {33#(<= 1 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:14,604 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#(<= 1 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {26#false} is VALID [2020-07-28 19:07:14,605 INFO L280 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2020-07-28 19:07:14,606 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-28 19:07:14,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606316064] [2020-07-28 19:07:14,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:07:14,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 19:07:14,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198009983] [2020-07-28 19:07:14,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-28 19:07:14,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:14,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 19:07:14,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:14,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 19:07:14,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 19:07:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:07:14,660 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 7 states. [2020-07-28 19:07:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:15,111 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-28 19:07:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 19:07:15,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-28 19:07:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:07:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-28 19:07:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 19:07:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2020-07-28 19:07:15,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2020-07-28 19:07:15,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:15,211 INFO L225 Difference]: With dead ends: 37 [2020-07-28 19:07:15,211 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 19:07:15,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:07:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 19:07:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 19:07:15,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:15,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 19:07:15,254 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 19:07:15,255 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 19:07:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:15,261 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2020-07-28 19:07:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2020-07-28 19:07:15,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:15,263 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 19:07:15,263 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 19:07:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:15,268 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2020-07-28 19:07:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2020-07-28 19:07:15,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:15,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:15,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:15,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 19:07:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2020-07-28 19:07:15,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2020-07-28 19:07:15,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:15,276 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2020-07-28 19:07:15,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 19:07:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2020-07-28 19:07:15,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 19:07:15,278 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:15,278 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:15,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:07:15,279 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 963920485, now seen corresponding path program 1 times [2020-07-28 19:07:15,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:15,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816702354] [2020-07-28 19:07:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:15,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:15,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:15,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} ~m := #in~m;~n := #in~n; {179#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:15,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {179#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:15,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:15,487 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {158#true} #44#return; {177#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:15,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} ~m := #in~m;~n := #in~n; {158#true} is VALID [2020-07-28 19:07:15,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume !(0 == ~m); {158#true} is VALID [2020-07-28 19:07:15,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {158#true} assume 0 == ~n; {158#true} is VALID [2020-07-28 19:07:15,488 INFO L263 TraceCheckUtils]: 3: Hoare triple {158#true} call #t~ret0 := ackermann(~m - 1, 1); {158#true} is VALID [2020-07-28 19:07:15,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#true} ~m := #in~m;~n := #in~n; {179#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:15,491 INFO L280 TraceCheckUtils]: 5: Hoare triple {179#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:15,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:15,493 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {158#true} #44#return; {177#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:15,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {177#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {178#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:15,495 INFO L280 TraceCheckUtils]: 9: Hoare triple {178#(<= 2 |ackermann_#res|)} assume true; {178#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:15,497 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {178#(<= 2 |ackermann_#res|)} {158#true} #42#return; {171#(<= 2 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:15,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {158#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {158#true} is VALID [2020-07-28 19:07:15,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {158#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {158#true} is VALID [2020-07-28 19:07:15,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {158#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {158#true} is VALID [2020-07-28 19:07:15,499 INFO L263 TraceCheckUtils]: 3: Hoare triple {158#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {158#true} is VALID [2020-07-28 19:07:15,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {158#true} ~m := #in~m;~n := #in~n; {158#true} is VALID [2020-07-28 19:07:15,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {158#true} assume !(0 == ~m); {158#true} is VALID [2020-07-28 19:07:15,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {158#true} assume 0 == ~n; {158#true} is VALID [2020-07-28 19:07:15,500 INFO L263 TraceCheckUtils]: 7: Hoare triple {158#true} call #t~ret0 := ackermann(~m - 1, 1); {158#true} is VALID [2020-07-28 19:07:15,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {158#true} ~m := #in~m;~n := #in~n; {179#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:15,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {179#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:15,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:15,505 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {180#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {158#true} #44#return; {177#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:15,506 INFO L280 TraceCheckUtils]: 12: Hoare triple {177#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {178#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:15,507 INFO L280 TraceCheckUtils]: 13: Hoare triple {178#(<= 2 |ackermann_#res|)} assume true; {178#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:15,508 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {178#(<= 2 |ackermann_#res|)} {158#true} #42#return; {171#(<= 2 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:15,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {171#(<= 2 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {172#(<= 2 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:15,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {172#(<= 2 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {159#false} is VALID [2020-07-28 19:07:15,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {159#false} assume !false; {159#false} is VALID [2020-07-28 19:07:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 19:07:15,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816702354] [2020-07-28 19:07:15,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:07:15,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-28 19:07:15,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592143235] [2020-07-28 19:07:15,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-28 19:07:15,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:15,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 19:07:15,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:15,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 19:07:15,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:15,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 19:07:15,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-28 19:07:15,541 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 8 states. [2020-07-28 19:07:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:16,064 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-28 19:07:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:07:16,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-28 19:07:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:07:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-28 19:07:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 19:07:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2020-07-28 19:07:16,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2020-07-28 19:07:16,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:16,154 INFO L225 Difference]: With dead ends: 28 [2020-07-28 19:07:16,154 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 19:07:16,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-28 19:07:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 19:07:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-28 19:07:16,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:16,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2020-07-28 19:07:16,169 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2020-07-28 19:07:16,169 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2020-07-28 19:07:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:16,173 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-28 19:07:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-28 19:07:16,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:16,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:16,175 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2020-07-28 19:07:16,175 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2020-07-28 19:07:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:16,179 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2020-07-28 19:07:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-07-28 19:07:16,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:16,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:16,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:16,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 19:07:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-28 19:07:16,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2020-07-28 19:07:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:16,184 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-28 19:07:16,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 19:07:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-28 19:07:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-28 19:07:16,186 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:16,186 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:16,186 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:07:16,187 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash -193744714, now seen corresponding path program 1 times [2020-07-28 19:07:16,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:16,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152142506] [2020-07-28 19:07:16,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:16,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:16,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:16,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {326#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {326#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {327#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,286 INFO L280 TraceCheckUtils]: 2: Hoare triple {327#(= 0 |ackermann_#in~m|)} assume true; {327#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {327#(= 0 |ackermann_#in~m|)} {317#(not (= ackermann_~m 0))} #46#return; {299#false} is VALID [2020-07-28 19:07:16,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-07-28 19:07:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:16,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {298#true} is VALID [2020-07-28 19:07:16,306 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume 0 == ~m;#res := 1 + ~n; {298#true} is VALID [2020-07-28 19:07:16,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-28 19:07:16,307 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {298#true} {299#false} #48#return; {299#false} is VALID [2020-07-28 19:07:16,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {298#true} is VALID [2020-07-28 19:07:16,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume !(0 == ~m); {317#(not (= ackermann_~m 0))} is VALID [2020-07-28 19:07:16,310 INFO L280 TraceCheckUtils]: 2: Hoare triple {317#(not (= ackermann_~m 0))} assume !(0 == ~n); {317#(not (= ackermann_~m 0))} is VALID [2020-07-28 19:07:16,311 INFO L263 TraceCheckUtils]: 3: Hoare triple {317#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {298#true} is VALID [2020-07-28 19:07:16,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {326#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,313 INFO L280 TraceCheckUtils]: 5: Hoare triple {326#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {327#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {327#(= 0 |ackermann_#in~m|)} assume true; {327#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,317 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {327#(= 0 |ackermann_#in~m|)} {317#(not (= ackermann_~m 0))} #46#return; {299#false} is VALID [2020-07-28 19:07:16,318 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {299#false} is VALID [2020-07-28 19:07:16,318 INFO L263 TraceCheckUtils]: 9: Hoare triple {299#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {298#true} is VALID [2020-07-28 19:07:16,318 INFO L280 TraceCheckUtils]: 10: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {298#true} is VALID [2020-07-28 19:07:16,318 INFO L280 TraceCheckUtils]: 11: Hoare triple {298#true} assume 0 == ~m;#res := 1 + ~n; {298#true} is VALID [2020-07-28 19:07:16,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-28 19:07:16,319 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {298#true} {299#false} #48#return; {299#false} is VALID [2020-07-28 19:07:16,319 INFO L280 TraceCheckUtils]: 14: Hoare triple {299#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {299#false} is VALID [2020-07-28 19:07:16,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-28 19:07:16,320 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {299#false} {298#true} #42#return; {299#false} is VALID [2020-07-28 19:07:16,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {298#true} is VALID [2020-07-28 19:07:16,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {298#true} is VALID [2020-07-28 19:07:16,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {298#true} is VALID [2020-07-28 19:07:16,322 INFO L263 TraceCheckUtils]: 3: Hoare triple {298#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {298#true} is VALID [2020-07-28 19:07:16,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {298#true} is VALID [2020-07-28 19:07:16,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} assume !(0 == ~m); {317#(not (= ackermann_~m 0))} is VALID [2020-07-28 19:07:16,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {317#(not (= ackermann_~m 0))} assume !(0 == ~n); {317#(not (= ackermann_~m 0))} is VALID [2020-07-28 19:07:16,326 INFO L263 TraceCheckUtils]: 7: Hoare triple {317#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {298#true} is VALID [2020-07-28 19:07:16,327 INFO L280 TraceCheckUtils]: 8: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {326#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {326#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {327#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {327#(= 0 |ackermann_#in~m|)} assume true; {327#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,337 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {327#(= 0 |ackermann_#in~m|)} {317#(not (= ackermann_~m 0))} #46#return; {299#false} is VALID [2020-07-28 19:07:16,337 INFO L280 TraceCheckUtils]: 12: Hoare triple {299#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {299#false} is VALID [2020-07-28 19:07:16,338 INFO L263 TraceCheckUtils]: 13: Hoare triple {299#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {298#true} is VALID [2020-07-28 19:07:16,338 INFO L280 TraceCheckUtils]: 14: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {298#true} is VALID [2020-07-28 19:07:16,338 INFO L280 TraceCheckUtils]: 15: Hoare triple {298#true} assume 0 == ~m;#res := 1 + ~n; {298#true} is VALID [2020-07-28 19:07:16,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {298#true} assume true; {298#true} is VALID [2020-07-28 19:07:16,339 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {298#true} {299#false} #48#return; {299#false} is VALID [2020-07-28 19:07:16,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {299#false} is VALID [2020-07-28 19:07:16,339 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-28 19:07:16,340 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {299#false} {298#true} #42#return; {299#false} is VALID [2020-07-28 19:07:16,340 INFO L280 TraceCheckUtils]: 21: Hoare triple {299#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {299#false} is VALID [2020-07-28 19:07:16,340 INFO L280 TraceCheckUtils]: 22: Hoare triple {299#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {299#false} is VALID [2020-07-28 19:07:16,340 INFO L280 TraceCheckUtils]: 23: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 19:07:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 19:07:16,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152142506] [2020-07-28 19:07:16,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047121031] [2020-07-28 19:07:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:16,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 19:07:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:16,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:16,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {298#true} is VALID [2020-07-28 19:07:16,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {298#true} is VALID [2020-07-28 19:07:16,692 INFO L280 TraceCheckUtils]: 2: Hoare triple {298#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {298#true} is VALID [2020-07-28 19:07:16,693 INFO L263 TraceCheckUtils]: 3: Hoare triple {298#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {298#true} is VALID [2020-07-28 19:07:16,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {298#true} is VALID [2020-07-28 19:07:16,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {298#true} assume !(0 == ~m); {298#true} is VALID [2020-07-28 19:07:16,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {298#true} assume !(0 == ~n); {298#true} is VALID [2020-07-28 19:07:16,694 INFO L263 TraceCheckUtils]: 7: Hoare triple {298#true} call #t~ret1 := ackermann(~m, ~n - 1); {298#true} is VALID [2020-07-28 19:07:16,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {355#(<= |ackermann_#in~m| ackermann_~m)} is VALID [2020-07-28 19:07:16,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {355#(<= |ackermann_#in~m| ackermann_~m)} assume 0 == ~m;#res := 1 + ~n; {359#(<= |ackermann_#in~m| 0)} is VALID [2020-07-28 19:07:16,697 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= |ackermann_#in~m| 0)} assume true; {359#(<= |ackermann_#in~m| 0)} is VALID [2020-07-28 19:07:16,699 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {359#(<= |ackermann_#in~m| 0)} {298#true} #46#return; {366#(<= ackermann_~m 0)} is VALID [2020-07-28 19:07:16,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {366#(<= ackermann_~m 0)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {366#(<= ackermann_~m 0)} is VALID [2020-07-28 19:07:16,700 INFO L263 TraceCheckUtils]: 13: Hoare triple {366#(<= ackermann_~m 0)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {298#true} is VALID [2020-07-28 19:07:16,701 INFO L280 TraceCheckUtils]: 14: Hoare triple {298#true} ~m := #in~m;~n := #in~n; {376#(<= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,703 INFO L280 TraceCheckUtils]: 15: Hoare triple {376#(<= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {380#(<= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,704 INFO L280 TraceCheckUtils]: 16: Hoare triple {380#(<= 0 |ackermann_#in~m|)} assume true; {380#(<= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:16,706 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {380#(<= 0 |ackermann_#in~m|)} {366#(<= ackermann_~m 0)} #48#return; {299#false} is VALID [2020-07-28 19:07:16,707 INFO L280 TraceCheckUtils]: 18: Hoare triple {299#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {299#false} is VALID [2020-07-28 19:07:16,707 INFO L280 TraceCheckUtils]: 19: Hoare triple {299#false} assume true; {299#false} is VALID [2020-07-28 19:07:16,707 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {299#false} {298#true} #42#return; {299#false} is VALID [2020-07-28 19:07:16,708 INFO L280 TraceCheckUtils]: 21: Hoare triple {299#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {299#false} is VALID [2020-07-28 19:07:16,708 INFO L280 TraceCheckUtils]: 22: Hoare triple {299#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {299#false} is VALID [2020-07-28 19:07:16,708 INFO L280 TraceCheckUtils]: 23: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 19:07:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-28 19:07:16,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:16,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2020-07-28 19:07:16,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57395669] [2020-07-28 19:07:16,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-28 19:07:16,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:16,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:07:16,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:16,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:07:16,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:16,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:07:16,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:07:16,762 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 10 states. [2020-07-28 19:07:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:17,380 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2020-07-28 19:07:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:07:17,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-28 19:07:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:07:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-28 19:07:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:07:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2020-07-28 19:07:17,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2020-07-28 19:07:17,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:17,487 INFO L225 Difference]: With dead ends: 47 [2020-07-28 19:07:17,487 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 19:07:17,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-07-28 19:07:17,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 19:07:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-07-28 19:07:17,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:17,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 24 states. [2020-07-28 19:07:17,513 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 24 states. [2020-07-28 19:07:17,514 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 24 states. [2020-07-28 19:07:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:17,523 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2020-07-28 19:07:17,523 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2020-07-28 19:07:17,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:17,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:17,526 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 29 states. [2020-07-28 19:07:17,526 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 29 states. [2020-07-28 19:07:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:17,530 INFO L93 Difference]: Finished difference Result 29 states and 43 transitions. [2020-07-28 19:07:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2020-07-28 19:07:17,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:17,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:17,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:17,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:17,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 19:07:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-07-28 19:07:17,535 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2020-07-28 19:07:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:17,535 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-07-28 19:07:17,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:07:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-07-28 19:07:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-28 19:07:17,538 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:17,538 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:17,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:07:17,752 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 416247163, now seen corresponding path program 1 times [2020-07-28 19:07:17,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:17,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678459288] [2020-07-28 19:07:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:17,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:17,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:17,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:17,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:17,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:17,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:17,958 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {560#true} #44#return; {610#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:17,958 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:17,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:17,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume 0 == ~n; {560#true} is VALID [2020-07-28 19:07:17,959 INFO L263 TraceCheckUtils]: 3: Hoare triple {560#true} call #t~ret0 := ackermann(~m - 1, 1); {560#true} is VALID [2020-07-28 19:07:17,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:17,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:17,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:17,963 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {560#true} #44#return; {610#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:17,964 INFO L280 TraceCheckUtils]: 8: Hoare triple {610#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:17,964 INFO L280 TraceCheckUtils]: 9: Hoare triple {611#(<= 2 |ackermann_#res|)} assume true; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:17,966 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {611#(<= 2 |ackermann_#res|)} {560#true} #46#return; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:17,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-07-28 19:07:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:18,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {614#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:18,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {614#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,016 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {599#(<= 2 |ackermann_#t~ret1|)} #48#return; {604#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:18,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:18,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:18,017 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume !(0 == ~n); {560#true} is VALID [2020-07-28 19:07:18,018 INFO L263 TraceCheckUtils]: 3: Hoare triple {560#true} call #t~ret1 := ackermann(~m, ~n - 1); {560#true} is VALID [2020-07-28 19:07:18,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:18,018 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:18,018 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#true} assume 0 == ~n; {560#true} is VALID [2020-07-28 19:07:18,018 INFO L263 TraceCheckUtils]: 7: Hoare triple {560#true} call #t~ret0 := ackermann(~m - 1, 1); {560#true} is VALID [2020-07-28 19:07:18,019 INFO L280 TraceCheckUtils]: 8: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:18,020 INFO L280 TraceCheckUtils]: 9: Hoare triple {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:18,021 INFO L280 TraceCheckUtils]: 10: Hoare triple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:18,022 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {560#true} #44#return; {610#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:18,023 INFO L280 TraceCheckUtils]: 12: Hoare triple {610#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,024 INFO L280 TraceCheckUtils]: 13: Hoare triple {611#(<= 2 |ackermann_#res|)} assume true; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,025 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {611#(<= 2 |ackermann_#res|)} {560#true} #46#return; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:18,026 INFO L280 TraceCheckUtils]: 15: Hoare triple {599#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:18,026 INFO L263 TraceCheckUtils]: 16: Hoare triple {599#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {560#true} is VALID [2020-07-28 19:07:18,027 INFO L280 TraceCheckUtils]: 17: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {614#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:18,027 INFO L280 TraceCheckUtils]: 18: Hoare triple {614#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,028 INFO L280 TraceCheckUtils]: 19: Hoare triple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,029 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {599#(<= 2 |ackermann_#t~ret1|)} #48#return; {604#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:18,030 INFO L280 TraceCheckUtils]: 21: Hoare triple {604#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {605#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,031 INFO L280 TraceCheckUtils]: 22: Hoare triple {605#(<= 3 |ackermann_#res|)} assume true; {605#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,035 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {605#(<= 3 |ackermann_#res|)} {560#true} #42#return; {586#(<= 3 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:18,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {560#true} is VALID [2020-07-28 19:07:18,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {560#true} is VALID [2020-07-28 19:07:18,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {560#true} is VALID [2020-07-28 19:07:18,038 INFO L263 TraceCheckUtils]: 3: Hoare triple {560#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {560#true} is VALID [2020-07-28 19:07:18,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:18,038 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:18,039 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#true} assume !(0 == ~n); {560#true} is VALID [2020-07-28 19:07:18,039 INFO L263 TraceCheckUtils]: 7: Hoare triple {560#true} call #t~ret1 := ackermann(~m, ~n - 1); {560#true} is VALID [2020-07-28 19:07:18,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:18,039 INFO L280 TraceCheckUtils]: 9: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:18,039 INFO L280 TraceCheckUtils]: 10: Hoare triple {560#true} assume 0 == ~n; {560#true} is VALID [2020-07-28 19:07:18,040 INFO L263 TraceCheckUtils]: 11: Hoare triple {560#true} call #t~ret0 := ackermann(~m - 1, 1); {560#true} is VALID [2020-07-28 19:07:18,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:18,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {612#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:18,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:18,046 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {613#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {560#true} #44#return; {610#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:18,047 INFO L280 TraceCheckUtils]: 16: Hoare triple {610#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,048 INFO L280 TraceCheckUtils]: 17: Hoare triple {611#(<= 2 |ackermann_#res|)} assume true; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,049 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {611#(<= 2 |ackermann_#res|)} {560#true} #46#return; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:18,050 INFO L280 TraceCheckUtils]: 19: Hoare triple {599#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:18,050 INFO L263 TraceCheckUtils]: 20: Hoare triple {599#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {560#true} is VALID [2020-07-28 19:07:18,051 INFO L280 TraceCheckUtils]: 21: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {614#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:18,052 INFO L280 TraceCheckUtils]: 22: Hoare triple {614#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,052 INFO L280 TraceCheckUtils]: 23: Hoare triple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,054 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {599#(<= 2 |ackermann_#t~ret1|)} #48#return; {604#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:18,055 INFO L280 TraceCheckUtils]: 25: Hoare triple {604#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {605#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,056 INFO L280 TraceCheckUtils]: 26: Hoare triple {605#(<= 3 |ackermann_#res|)} assume true; {605#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,057 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {605#(<= 3 |ackermann_#res|)} {560#true} #42#return; {586#(<= 3 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:18,058 INFO L280 TraceCheckUtils]: 28: Hoare triple {586#(<= 3 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {587#(<= 3 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:18,060 INFO L280 TraceCheckUtils]: 29: Hoare triple {587#(<= 3 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {561#false} is VALID [2020-07-28 19:07:18,060 INFO L280 TraceCheckUtils]: 30: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-28 19:07:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-28 19:07:18,062 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678459288] [2020-07-28 19:07:18,063 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168909100] [2020-07-28 19:07:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:18,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 19:07:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:18,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:18,523 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {560#true} is VALID [2020-07-28 19:07:18,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {560#true} is VALID [2020-07-28 19:07:18,524 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {560#true} is VALID [2020-07-28 19:07:18,524 INFO L263 TraceCheckUtils]: 3: Hoare triple {560#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {560#true} is VALID [2020-07-28 19:07:18,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:18,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:18,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#true} assume !(0 == ~n); {560#true} is VALID [2020-07-28 19:07:18,526 INFO L263 TraceCheckUtils]: 7: Hoare triple {560#true} call #t~ret1 := ackermann(~m, ~n - 1); {560#true} is VALID [2020-07-28 19:07:18,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {560#true} is VALID [2020-07-28 19:07:18,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {560#true} assume !(0 == ~m); {560#true} is VALID [2020-07-28 19:07:18,527 INFO L280 TraceCheckUtils]: 10: Hoare triple {560#true} assume 0 == ~n; {560#true} is VALID [2020-07-28 19:07:18,527 INFO L263 TraceCheckUtils]: 11: Hoare triple {560#true} call #t~ret0 := ackermann(~m - 1, 1); {560#true} is VALID [2020-07-28 19:07:18,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {655#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:18,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {655#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,531 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {560#true} #44#return; {610#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:18,531 INFO L280 TraceCheckUtils]: 16: Hoare triple {610#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,532 INFO L280 TraceCheckUtils]: 17: Hoare triple {611#(<= 2 |ackermann_#res|)} assume true; {611#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,533 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {611#(<= 2 |ackermann_#res|)} {560#true} #46#return; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:18,533 INFO L280 TraceCheckUtils]: 19: Hoare triple {599#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {599#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:18,533 INFO L263 TraceCheckUtils]: 20: Hoare triple {599#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {560#true} is VALID [2020-07-28 19:07:18,534 INFO L280 TraceCheckUtils]: 21: Hoare triple {560#true} ~m := #in~m;~n := #in~n; {655#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:18,535 INFO L280 TraceCheckUtils]: 22: Hoare triple {655#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,536 INFO L280 TraceCheckUtils]: 23: Hoare triple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:18,537 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {615#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {599#(<= 2 |ackermann_#t~ret1|)} #48#return; {604#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:18,538 INFO L280 TraceCheckUtils]: 25: Hoare triple {604#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {605#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,538 INFO L280 TraceCheckUtils]: 26: Hoare triple {605#(<= 3 |ackermann_#res|)} assume true; {605#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:18,540 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {605#(<= 3 |ackermann_#res|)} {560#true} #42#return; {586#(<= 3 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:18,541 INFO L280 TraceCheckUtils]: 28: Hoare triple {586#(<= 3 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {587#(<= 3 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:18,541 INFO L280 TraceCheckUtils]: 29: Hoare triple {587#(<= 3 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {561#false} is VALID [2020-07-28 19:07:18,542 INFO L280 TraceCheckUtils]: 30: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-28 19:07:18,544 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-28 19:07:18,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:18,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 14 [2020-07-28 19:07:18,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74341230] [2020-07-28 19:07:18,546 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-28 19:07:18,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:18,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 19:07:18,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:18,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 19:07:18,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:18,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 19:07:18,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-28 19:07:18,602 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand 14 states. [2020-07-28 19:07:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:20,331 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2020-07-28 19:07:20,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-28 19:07:20,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2020-07-28 19:07:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:07:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-28 19:07:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:07:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-28 19:07:20,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 74 transitions. [2020-07-28 19:07:20,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:20,460 INFO L225 Difference]: With dead ends: 50 [2020-07-28 19:07:20,460 INFO L226 Difference]: Without dead ends: 46 [2020-07-28 19:07:20,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2020-07-28 19:07:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-28 19:07:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2020-07-28 19:07:20,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:20,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 32 states. [2020-07-28 19:07:20,497 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 32 states. [2020-07-28 19:07:20,497 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 32 states. [2020-07-28 19:07:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:20,507 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. [2020-07-28 19:07:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-07-28 19:07:20,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:20,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:20,512 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 46 states. [2020-07-28 19:07:20,513 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 46 states. [2020-07-28 19:07:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:20,526 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. [2020-07-28 19:07:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 79 transitions. [2020-07-28 19:07:20,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:20,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:20,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:20,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-28 19:07:20,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2020-07-28 19:07:20,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 49 transitions. Word has length 31 [2020-07-28 19:07:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:20,540 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 49 transitions. [2020-07-28 19:07:20,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 19:07:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 49 transitions. [2020-07-28 19:07:20,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-28 19:07:20,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:20,542 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:20,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:20,756 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash -781004688, now seen corresponding path program 2 times [2020-07-28 19:07:20,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:20,758 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250483984] [2020-07-28 19:07:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:20,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:20,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:20,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:20,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:21,029 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:21,030 INFO L280 TraceCheckUtils]: 1: Hoare triple {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,033 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {922#true} #44#return; {1004#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,034 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:21,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,038 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {922#true} #44#return; {1004#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {1004#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,040 INFO L280 TraceCheckUtils]: 9: Hoare triple {1005#(<= 2 |ackermann_#res|)} assume true; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,041 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1005#(<= 2 |ackermann_#res|)} {922#true} #46#return; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-07-28 19:07:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:21,084 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1008#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:21,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {994#(<= 2 |ackermann_#t~ret1|)} #48#return; {999#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:21,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume !(0 == ~n); {922#true} is VALID [2020-07-28 19:07:21,088 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret1 := ackermann(~m, ~n - 1); {922#true} is VALID [2020-07-28 19:07:21,088 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,089 INFO L263 TraceCheckUtils]: 7: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,090 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:21,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,093 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {922#true} #44#return; {1004#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,094 INFO L280 TraceCheckUtils]: 12: Hoare triple {1004#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,095 INFO L280 TraceCheckUtils]: 13: Hoare triple {1005#(<= 2 |ackermann_#res|)} assume true; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,097 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1005#(<= 2 |ackermann_#res|)} {922#true} #46#return; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,097 INFO L280 TraceCheckUtils]: 15: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,097 INFO L263 TraceCheckUtils]: 16: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {922#true} is VALID [2020-07-28 19:07:21,098 INFO L280 TraceCheckUtils]: 17: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1008#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:21,099 INFO L280 TraceCheckUtils]: 18: Hoare triple {1008#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,099 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,101 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {994#(<= 2 |ackermann_#t~ret1|)} #48#return; {999#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:21,101 INFO L280 TraceCheckUtils]: 21: Hoare triple {999#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,102 INFO L280 TraceCheckUtils]: 22: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,103 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #44#return; {981#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,104 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} assume !(0 == ~n); {922#true} is VALID [2020-07-28 19:07:21,105 INFO L263 TraceCheckUtils]: 7: Hoare triple {922#true} call #t~ret1 := ackermann(~m, ~n - 1); {922#true} is VALID [2020-07-28 19:07:21,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,106 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,106 INFO L263 TraceCheckUtils]: 11: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:21,108 INFO L280 TraceCheckUtils]: 13: Hoare triple {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,110 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {922#true} #44#return; {1004#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,111 INFO L280 TraceCheckUtils]: 16: Hoare triple {1004#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,112 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#(<= 2 |ackermann_#res|)} assume true; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,113 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1005#(<= 2 |ackermann_#res|)} {922#true} #46#return; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,114 INFO L280 TraceCheckUtils]: 19: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,114 INFO L263 TraceCheckUtils]: 20: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {922#true} is VALID [2020-07-28 19:07:21,114 INFO L280 TraceCheckUtils]: 21: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1008#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:21,115 INFO L280 TraceCheckUtils]: 22: Hoare triple {1008#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,115 INFO L280 TraceCheckUtils]: 23: Hoare triple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,117 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {994#(<= 2 |ackermann_#t~ret1|)} #48#return; {999#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:21,117 INFO L280 TraceCheckUtils]: 25: Hoare triple {999#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,118 INFO L280 TraceCheckUtils]: 26: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,119 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #44#return; {981#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,119 INFO L280 TraceCheckUtils]: 28: Hoare triple {981#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,120 INFO L280 TraceCheckUtils]: 29: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,121 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #42#return; {955#(<= 3 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:21,122 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {922#true} is VALID [2020-07-28 19:07:21,122 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {922#true} is VALID [2020-07-28 19:07:21,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {922#true} is VALID [2020-07-28 19:07:21,123 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {922#true} is VALID [2020-07-28 19:07:21,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,124 INFO L263 TraceCheckUtils]: 7: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} assume !(0 == ~n); {922#true} is VALID [2020-07-28 19:07:21,124 INFO L263 TraceCheckUtils]: 11: Hoare triple {922#true} call #t~ret1 := ackermann(~m, ~n - 1); {922#true} is VALID [2020-07-28 19:07:21,125 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,125 INFO L280 TraceCheckUtils]: 13: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,125 INFO L280 TraceCheckUtils]: 14: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,125 INFO L263 TraceCheckUtils]: 15: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,134 INFO L280 TraceCheckUtils]: 16: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-28 19:07:21,137 INFO L280 TraceCheckUtils]: 17: Hoare triple {1006#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m;#res := 1 + ~n; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,143 INFO L280 TraceCheckUtils]: 18: Hoare triple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-28 19:07:21,145 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1007#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {922#true} #44#return; {1004#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,146 INFO L280 TraceCheckUtils]: 20: Hoare triple {1004#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,149 INFO L280 TraceCheckUtils]: 21: Hoare triple {1005#(<= 2 |ackermann_#res|)} assume true; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,150 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1005#(<= 2 |ackermann_#res|)} {922#true} #46#return; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,151 INFO L280 TraceCheckUtils]: 23: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,151 INFO L263 TraceCheckUtils]: 24: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {922#true} is VALID [2020-07-28 19:07:21,151 INFO L280 TraceCheckUtils]: 25: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1008#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:21,152 INFO L280 TraceCheckUtils]: 26: Hoare triple {1008#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m;#res := 1 + ~n; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,153 INFO L280 TraceCheckUtils]: 27: Hoare triple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,154 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {994#(<= 2 |ackermann_#t~ret1|)} #48#return; {999#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:21,156 INFO L280 TraceCheckUtils]: 29: Hoare triple {999#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,157 INFO L280 TraceCheckUtils]: 30: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,158 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #44#return; {981#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,159 INFO L280 TraceCheckUtils]: 32: Hoare triple {981#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,159 INFO L280 TraceCheckUtils]: 33: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,160 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #42#return; {955#(<= 3 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:21,161 INFO L280 TraceCheckUtils]: 35: Hoare triple {955#(<= 3 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {956#(<= 3 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:21,162 INFO L280 TraceCheckUtils]: 36: Hoare triple {956#(<= 3 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {923#false} is VALID [2020-07-28 19:07:21,162 INFO L280 TraceCheckUtils]: 37: Hoare triple {923#false} assume !false; {923#false} is VALID [2020-07-28 19:07:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-28 19:07:21,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250483984] [2020-07-28 19:07:21,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150620822] [2020-07-28 19:07:21,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:21,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 19:07:21,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:07:21,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-28 19:07:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:21,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:21,625 INFO L280 TraceCheckUtils]: 0: Hoare triple {922#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {922#true} is VALID [2020-07-28 19:07:21,626 INFO L280 TraceCheckUtils]: 1: Hoare triple {922#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {922#true} is VALID [2020-07-28 19:07:21,626 INFO L280 TraceCheckUtils]: 2: Hoare triple {922#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {922#true} is VALID [2020-07-28 19:07:21,626 INFO L263 TraceCheckUtils]: 3: Hoare triple {922#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {922#true} is VALID [2020-07-28 19:07:21,627 INFO L280 TraceCheckUtils]: 4: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,627 INFO L280 TraceCheckUtils]: 5: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,627 INFO L280 TraceCheckUtils]: 6: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,627 INFO L263 TraceCheckUtils]: 7: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {922#true} assume !(0 == ~n); {922#true} is VALID [2020-07-28 19:07:21,628 INFO L263 TraceCheckUtils]: 11: Hoare triple {922#true} call #t~ret1 := ackermann(~m, ~n - 1); {922#true} is VALID [2020-07-28 19:07:21,629 INFO L280 TraceCheckUtils]: 12: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {922#true} is VALID [2020-07-28 19:07:21,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {922#true} assume !(0 == ~m); {922#true} is VALID [2020-07-28 19:07:21,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {922#true} assume 0 == ~n; {922#true} is VALID [2020-07-28 19:07:21,629 INFO L263 TraceCheckUtils]: 15: Hoare triple {922#true} call #t~ret0 := ackermann(~m - 1, 1); {922#true} is VALID [2020-07-28 19:07:21,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1061#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:21,632 INFO L280 TraceCheckUtils]: 17: Hoare triple {1061#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,634 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,636 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {922#true} #44#return; {1004#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,636 INFO L280 TraceCheckUtils]: 20: Hoare triple {1004#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,637 INFO L280 TraceCheckUtils]: 21: Hoare triple {1005#(<= 2 |ackermann_#res|)} assume true; {1005#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,638 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1005#(<= 2 |ackermann_#res|)} {922#true} #46#return; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,638 INFO L280 TraceCheckUtils]: 23: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {994#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:21,638 INFO L263 TraceCheckUtils]: 24: Hoare triple {994#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {922#true} is VALID [2020-07-28 19:07:21,639 INFO L280 TraceCheckUtils]: 25: Hoare triple {922#true} ~m := #in~m;~n := #in~n; {1061#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:21,639 INFO L280 TraceCheckUtils]: 26: Hoare triple {1061#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,640 INFO L280 TraceCheckUtils]: 27: Hoare triple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:21,641 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1009#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {994#(<= 2 |ackermann_#t~ret1|)} #48#return; {999#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:21,642 INFO L280 TraceCheckUtils]: 29: Hoare triple {999#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,642 INFO L280 TraceCheckUtils]: 30: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,643 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #44#return; {981#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:21,644 INFO L280 TraceCheckUtils]: 32: Hoare triple {981#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,644 INFO L280 TraceCheckUtils]: 33: Hoare triple {982#(<= 3 |ackermann_#res|)} assume true; {982#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:21,645 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {982#(<= 3 |ackermann_#res|)} {922#true} #42#return; {955#(<= 3 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:21,646 INFO L280 TraceCheckUtils]: 35: Hoare triple {955#(<= 3 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {956#(<= 3 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:21,647 INFO L280 TraceCheckUtils]: 36: Hoare triple {956#(<= 3 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {923#false} is VALID [2020-07-28 19:07:21,647 INFO L280 TraceCheckUtils]: 37: Hoare triple {923#false} assume !false; {923#false} is VALID [2020-07-28 19:07:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-28 19:07:21,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:21,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2020-07-28 19:07:21,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788027044] [2020-07-28 19:07:21,649 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-28 19:07:21,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:21,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-28 19:07:21,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:21,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-28 19:07:21,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-28 19:07:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-28 19:07:21,696 INFO L87 Difference]: Start difference. First operand 32 states and 49 transitions. Second operand 15 states. [2020-07-28 19:07:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:23,529 INFO L93 Difference]: Finished difference Result 61 states and 112 transitions. [2020-07-28 19:07:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-28 19:07:23,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 38 [2020-07-28 19:07:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:07:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2020-07-28 19:07:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:07:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 74 transitions. [2020-07-28 19:07:23,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 74 transitions. [2020-07-28 19:07:23,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:23,665 INFO L225 Difference]: With dead ends: 61 [2020-07-28 19:07:23,665 INFO L226 Difference]: Without dead ends: 57 [2020-07-28 19:07:23,666 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2020-07-28 19:07:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-28 19:07:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2020-07-28 19:07:23,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:23,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 30 states. [2020-07-28 19:07:23,694 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 30 states. [2020-07-28 19:07:23,694 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 30 states. [2020-07-28 19:07:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:23,701 INFO L93 Difference]: Finished difference Result 57 states and 107 transitions. [2020-07-28 19:07:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 107 transitions. [2020-07-28 19:07:23,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:23,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:23,703 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 57 states. [2020-07-28 19:07:23,703 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 57 states. [2020-07-28 19:07:23,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:23,710 INFO L93 Difference]: Finished difference Result 57 states and 107 transitions. [2020-07-28 19:07:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 107 transitions. [2020-07-28 19:07:23,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:23,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:23,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:23,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 19:07:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2020-07-28 19:07:23,714 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 38 [2020-07-28 19:07:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:23,715 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2020-07-28 19:07:23,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-28 19:07:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2020-07-28 19:07:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-28 19:07:23,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:23,716 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:23,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:23,928 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:23,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:23,929 INFO L82 PathProgramCache]: Analyzing trace with hash 947442768, now seen corresponding path program 3 times [2020-07-28 19:07:23,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:23,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828089070] [2020-07-28 19:07:23,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:23,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:24,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:24,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:24,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,098 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,099 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,103 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,107 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,108 INFO L280 TraceCheckUtils]: 8: Hoare triple {1433#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,108 INFO L280 TraceCheckUtils]: 9: Hoare triple {1433#(<= |ackermann_#in~m| 1)} assume true; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,109 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1433#(<= |ackermann_#in~m| 1)} {1372#true} #46#return; {1416#(<= ackermann_~m 1)} is VALID [2020-07-28 19:07:24,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-07-28 19:07:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:24,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:24,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,145 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,146 INFO L280 TraceCheckUtils]: 2: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,147 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,150 INFO L263 TraceCheckUtils]: 3: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,150 INFO L280 TraceCheckUtils]: 4: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,151 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,152 INFO L280 TraceCheckUtils]: 6: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,154 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,155 INFO L280 TraceCheckUtils]: 8: Hoare triple {1439#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,155 INFO L280 TraceCheckUtils]: 9: Hoare triple {1439#(<= 1 |ackermann_#in~m|)} assume true; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,157 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1439#(<= 1 |ackermann_#in~m|)} {1416#(<= ackermann_~m 1)} #48#return; {1373#false} is VALID [2020-07-28 19:07:24,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1372#true} is VALID [2020-07-28 19:07:24,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {1372#true} assume !(0 == ~m); {1372#true} is VALID [2020-07-28 19:07:24,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {1372#true} assume !(0 == ~n); {1372#true} is VALID [2020-07-28 19:07:24,158 INFO L263 TraceCheckUtils]: 3: Hoare triple {1372#true} call #t~ret1 := ackermann(~m, ~n - 1); {1372#true} is VALID [2020-07-28 19:07:24,159 INFO L280 TraceCheckUtils]: 4: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,160 INFO L263 TraceCheckUtils]: 7: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,161 INFO L280 TraceCheckUtils]: 8: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,164 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,165 INFO L280 TraceCheckUtils]: 12: Hoare triple {1433#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,165 INFO L280 TraceCheckUtils]: 13: Hoare triple {1433#(<= |ackermann_#in~m| 1)} assume true; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,167 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1433#(<= |ackermann_#in~m| 1)} {1372#true} #46#return; {1416#(<= ackermann_~m 1)} is VALID [2020-07-28 19:07:24,167 INFO L280 TraceCheckUtils]: 15: Hoare triple {1416#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1416#(<= ackermann_~m 1)} is VALID [2020-07-28 19:07:24,168 INFO L263 TraceCheckUtils]: 16: Hoare triple {1416#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1372#true} is VALID [2020-07-28 19:07:24,168 INFO L280 TraceCheckUtils]: 17: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,169 INFO L280 TraceCheckUtils]: 18: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,170 INFO L280 TraceCheckUtils]: 19: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,170 INFO L263 TraceCheckUtils]: 20: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,170 INFO L280 TraceCheckUtils]: 21: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,172 INFO L280 TraceCheckUtils]: 23: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,173 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,174 INFO L280 TraceCheckUtils]: 25: Hoare triple {1439#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,174 INFO L280 TraceCheckUtils]: 26: Hoare triple {1439#(<= 1 |ackermann_#in~m|)} assume true; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,176 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {1439#(<= 1 |ackermann_#in~m|)} {1416#(<= ackermann_~m 1)} #48#return; {1373#false} is VALID [2020-07-28 19:07:24,176 INFO L280 TraceCheckUtils]: 28: Hoare triple {1373#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1373#false} is VALID [2020-07-28 19:07:24,176 INFO L280 TraceCheckUtils]: 29: Hoare triple {1373#false} assume true; {1373#false} is VALID [2020-07-28 19:07:24,176 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1373#false} {1372#true} #42#return; {1373#false} is VALID [2020-07-28 19:07:24,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {1372#true} is VALID [2020-07-28 19:07:24,178 INFO L280 TraceCheckUtils]: 1: Hoare triple {1372#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {1372#true} is VALID [2020-07-28 19:07:24,178 INFO L280 TraceCheckUtils]: 2: Hoare triple {1372#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {1372#true} is VALID [2020-07-28 19:07:24,178 INFO L263 TraceCheckUtils]: 3: Hoare triple {1372#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {1372#true} is VALID [2020-07-28 19:07:24,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1372#true} is VALID [2020-07-28 19:07:24,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {1372#true} assume !(0 == ~m); {1372#true} is VALID [2020-07-28 19:07:24,179 INFO L280 TraceCheckUtils]: 6: Hoare triple {1372#true} assume !(0 == ~n); {1372#true} is VALID [2020-07-28 19:07:24,179 INFO L263 TraceCheckUtils]: 7: Hoare triple {1372#true} call #t~ret1 := ackermann(~m, ~n - 1); {1372#true} is VALID [2020-07-28 19:07:24,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,181 INFO L263 TraceCheckUtils]: 11: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,182 INFO L280 TraceCheckUtils]: 12: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,183 INFO L280 TraceCheckUtils]: 13: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,183 INFO L280 TraceCheckUtils]: 14: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,185 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,185 INFO L280 TraceCheckUtils]: 16: Hoare triple {1433#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,186 INFO L280 TraceCheckUtils]: 17: Hoare triple {1433#(<= |ackermann_#in~m| 1)} assume true; {1433#(<= |ackermann_#in~m| 1)} is VALID [2020-07-28 19:07:24,187 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1433#(<= |ackermann_#in~m| 1)} {1372#true} #46#return; {1416#(<= ackermann_~m 1)} is VALID [2020-07-28 19:07:24,187 INFO L280 TraceCheckUtils]: 19: Hoare triple {1416#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1416#(<= ackermann_~m 1)} is VALID [2020-07-28 19:07:24,188 INFO L263 TraceCheckUtils]: 20: Hoare triple {1416#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1372#true} is VALID [2020-07-28 19:07:24,188 INFO L280 TraceCheckUtils]: 21: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,189 INFO L280 TraceCheckUtils]: 22: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,189 INFO L280 TraceCheckUtils]: 23: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,190 INFO L263 TraceCheckUtils]: 24: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,190 INFO L280 TraceCheckUtils]: 25: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1428#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,191 INFO L280 TraceCheckUtils]: 26: Hoare triple {1428#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,192 INFO L280 TraceCheckUtils]: 27: Hoare triple {1434#(= 0 |ackermann_#in~m|)} assume true; {1434#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,193 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1434#(= 0 |ackermann_#in~m|)} {1428#(= ackermann_~m |ackermann_#in~m|)} #44#return; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,194 INFO L280 TraceCheckUtils]: 29: Hoare triple {1439#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,195 INFO L280 TraceCheckUtils]: 30: Hoare triple {1439#(<= 1 |ackermann_#in~m|)} assume true; {1439#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:24,196 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1439#(<= 1 |ackermann_#in~m|)} {1416#(<= ackermann_~m 1)} #48#return; {1373#false} is VALID [2020-07-28 19:07:24,196 INFO L280 TraceCheckUtils]: 32: Hoare triple {1373#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1373#false} is VALID [2020-07-28 19:07:24,196 INFO L280 TraceCheckUtils]: 33: Hoare triple {1373#false} assume true; {1373#false} is VALID [2020-07-28 19:07:24,197 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1373#false} {1372#true} #42#return; {1373#false} is VALID [2020-07-28 19:07:24,197 INFO L280 TraceCheckUtils]: 35: Hoare triple {1373#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {1373#false} is VALID [2020-07-28 19:07:24,197 INFO L280 TraceCheckUtils]: 36: Hoare triple {1373#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {1373#false} is VALID [2020-07-28 19:07:24,197 INFO L280 TraceCheckUtils]: 37: Hoare triple {1373#false} assume !false; {1373#false} is VALID [2020-07-28 19:07:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-28 19:07:24,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828089070] [2020-07-28 19:07:24,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058192312] [2020-07-28 19:07:24,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:24,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-28 19:07:24,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:07:24,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 19:07:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:24,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:24,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {1372#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {1372#true} is VALID [2020-07-28 19:07:24,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {1372#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {1372#true} is VALID [2020-07-28 19:07:24,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {1372#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {1372#true} is VALID [2020-07-28 19:07:24,589 INFO L263 TraceCheckUtils]: 3: Hoare triple {1372#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {1372#true} is VALID [2020-07-28 19:07:24,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1372#true} is VALID [2020-07-28 19:07:24,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {1372#true} assume !(0 == ~m); {1372#true} is VALID [2020-07-28 19:07:24,590 INFO L280 TraceCheckUtils]: 6: Hoare triple {1372#true} assume !(0 == ~n); {1372#true} is VALID [2020-07-28 19:07:24,590 INFO L263 TraceCheckUtils]: 7: Hoare triple {1372#true} call #t~ret1 := ackermann(~m, ~n - 1); {1372#true} is VALID [2020-07-28 19:07:24,590 INFO L280 TraceCheckUtils]: 8: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1372#true} is VALID [2020-07-28 19:07:24,590 INFO L280 TraceCheckUtils]: 9: Hoare triple {1372#true} assume !(0 == ~m); {1372#true} is VALID [2020-07-28 19:07:24,591 INFO L280 TraceCheckUtils]: 10: Hoare triple {1372#true} assume 0 == ~n; {1372#true} is VALID [2020-07-28 19:07:24,591 INFO L263 TraceCheckUtils]: 11: Hoare triple {1372#true} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,591 INFO L280 TraceCheckUtils]: 12: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1372#true} is VALID [2020-07-28 19:07:24,591 INFO L280 TraceCheckUtils]: 13: Hoare triple {1372#true} assume 0 == ~m;#res := 1 + ~n; {1372#true} is VALID [2020-07-28 19:07:24,591 INFO L280 TraceCheckUtils]: 14: Hoare triple {1372#true} assume true; {1372#true} is VALID [2020-07-28 19:07:24,592 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1372#true} {1372#true} #44#return; {1372#true} is VALID [2020-07-28 19:07:24,592 INFO L280 TraceCheckUtils]: 16: Hoare triple {1372#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1372#true} is VALID [2020-07-28 19:07:24,592 INFO L280 TraceCheckUtils]: 17: Hoare triple {1372#true} assume true; {1372#true} is VALID [2020-07-28 19:07:24,592 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1372#true} {1372#true} #46#return; {1372#true} is VALID [2020-07-28 19:07:24,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {1372#true} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1372#true} is VALID [2020-07-28 19:07:24,593 INFO L263 TraceCheckUtils]: 20: Hoare triple {1372#true} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1372#true} is VALID [2020-07-28 19:07:24,593 INFO L280 TraceCheckUtils]: 21: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1372#true} is VALID [2020-07-28 19:07:24,593 INFO L280 TraceCheckUtils]: 22: Hoare triple {1372#true} assume !(0 == ~m); {1372#true} is VALID [2020-07-28 19:07:24,593 INFO L280 TraceCheckUtils]: 23: Hoare triple {1372#true} assume 0 == ~n; {1372#true} is VALID [2020-07-28 19:07:24,593 INFO L263 TraceCheckUtils]: 24: Hoare triple {1372#true} call #t~ret0 := ackermann(~m - 1, 1); {1372#true} is VALID [2020-07-28 19:07:24,594 INFO L280 TraceCheckUtils]: 25: Hoare triple {1372#true} ~m := #in~m;~n := #in~n; {1518#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:24,595 INFO L280 TraceCheckUtils]: 26: Hoare triple {1518#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {1522#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:24,596 INFO L280 TraceCheckUtils]: 27: Hoare triple {1522#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1522#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:24,597 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1522#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1372#true} #44#return; {1529#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:24,597 INFO L280 TraceCheckUtils]: 29: Hoare triple {1529#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1533#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:24,598 INFO L280 TraceCheckUtils]: 30: Hoare triple {1533#(<= 2 |ackermann_#res|)} assume true; {1533#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:24,599 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1533#(<= 2 |ackermann_#res|)} {1372#true} #48#return; {1540#(<= 2 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:24,600 INFO L280 TraceCheckUtils]: 32: Hoare triple {1540#(<= 2 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1533#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:24,600 INFO L280 TraceCheckUtils]: 33: Hoare triple {1533#(<= 2 |ackermann_#res|)} assume true; {1533#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:24,601 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1533#(<= 2 |ackermann_#res|)} {1372#true} #42#return; {1550#(<= 2 |ULTIMATE.start_main_#t~ret5|)} is VALID [2020-07-28 19:07:24,602 INFO L280 TraceCheckUtils]: 35: Hoare triple {1550#(<= 2 |ULTIMATE.start_main_#t~ret5|)} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {1554#(<= 2 ULTIMATE.start_main_~result~0)} is VALID [2020-07-28 19:07:24,603 INFO L280 TraceCheckUtils]: 36: Hoare triple {1554#(<= 2 ULTIMATE.start_main_~result~0)} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {1373#false} is VALID [2020-07-28 19:07:24,603 INFO L280 TraceCheckUtils]: 37: Hoare triple {1373#false} assume !false; {1373#false} is VALID [2020-07-28 19:07:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-28 19:07:24,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:24,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2020-07-28 19:07:24,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96896881] [2020-07-28 19:07:24,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-28 19:07:24,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:24,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 19:07:24,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:24,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 19:07:24,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:24,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 19:07:24,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2020-07-28 19:07:24,684 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 14 states. [2020-07-28 19:07:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:25,972 INFO L93 Difference]: Finished difference Result 77 states and 134 transitions. [2020-07-28 19:07:25,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-28 19:07:25,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-28 19:07:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:07:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 75 transitions. [2020-07-28 19:07:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 19:07:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 75 transitions. [2020-07-28 19:07:25,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 75 transitions. [2020-07-28 19:07:26,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:26,098 INFO L225 Difference]: With dead ends: 77 [2020-07-28 19:07:26,099 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 19:07:26,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2020-07-28 19:07:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 19:07:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-28 19:07:26,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:26,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-28 19:07:26,143 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 19:07:26,143 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 19:07:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:26,148 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2020-07-28 19:07:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 77 transitions. [2020-07-28 19:07:26,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:26,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:26,149 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 19:07:26,149 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 19:07:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:26,153 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2020-07-28 19:07:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 77 transitions. [2020-07-28 19:07:26,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:26,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:26,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:26,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-28 19:07:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 77 transitions. [2020-07-28 19:07:26,159 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 77 transitions. Word has length 38 [2020-07-28 19:07:26,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:26,159 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 77 transitions. [2020-07-28 19:07:26,159 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 19:07:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 77 transitions. [2020-07-28 19:07:26,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-28 19:07:26,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:26,161 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:26,367 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:26,368 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:26,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash 153235045, now seen corresponding path program 4 times [2020-07-28 19:07:26,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:26,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100367145] [2020-07-28 19:07:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,472 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1966#(= 0 |ackermann_#in~n|)} #44#return; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,474 INFO L280 TraceCheckUtils]: 2: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,474 INFO L263 TraceCheckUtils]: 3: Hoare triple {1966#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,474 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,476 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1830#true} {1966#(= 0 |ackermann_#in~n|)} #44#return; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,477 INFO L280 TraceCheckUtils]: 8: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,478 INFO L280 TraceCheckUtils]: 9: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume true; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,479 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1966#(= 0 |ackermann_#in~n|)} {1830#true} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,480 INFO L263 TraceCheckUtils]: 3: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,481 INFO L280 TraceCheckUtils]: 5: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,482 INFO L280 TraceCheckUtils]: 6: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,482 INFO L263 TraceCheckUtils]: 7: Hoare triple {1966#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,482 INFO L280 TraceCheckUtils]: 8: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,483 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1830#true} {1966#(= 0 |ackermann_#in~n|)} #44#return; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume true; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,485 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1966#(= 0 |ackermann_#in~n|)} {1830#true} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,486 INFO L280 TraceCheckUtils]: 15: Hoare triple {1831#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1831#false} is VALID [2020-07-28 19:07:26,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,486 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-07-28 19:07:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1830#true} #44#return; {1830#true} is VALID [2020-07-28 19:07:26,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,502 INFO L263 TraceCheckUtils]: 3: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,518 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1830#true} {1830#true} #44#return; {1830#true} is VALID [2020-07-28 19:07:26,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {1830#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1830#true} is VALID [2020-07-28 19:07:26,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,518 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,519 INFO L263 TraceCheckUtils]: 3: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,520 INFO L263 TraceCheckUtils]: 7: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,526 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,526 INFO L263 TraceCheckUtils]: 11: Hoare triple {1966#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,527 INFO L280 TraceCheckUtils]: 12: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,527 INFO L280 TraceCheckUtils]: 13: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,528 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1830#true} {1966#(= 0 |ackermann_#in~n|)} #44#return; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,529 INFO L280 TraceCheckUtils]: 17: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume true; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,530 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1966#(= 0 |ackermann_#in~n|)} {1830#true} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {1831#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1831#false} is VALID [2020-07-28 19:07:26,531 INFO L280 TraceCheckUtils]: 20: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,531 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,531 INFO L263 TraceCheckUtils]: 23: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1830#true} is VALID [2020-07-28 19:07:26,532 INFO L280 TraceCheckUtils]: 24: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,532 INFO L280 TraceCheckUtils]: 25: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,532 INFO L280 TraceCheckUtils]: 26: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,534 INFO L263 TraceCheckUtils]: 27: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,534 INFO L280 TraceCheckUtils]: 28: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,534 INFO L280 TraceCheckUtils]: 29: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,535 INFO L280 TraceCheckUtils]: 30: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,535 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1830#true} {1830#true} #44#return; {1830#true} is VALID [2020-07-28 19:07:26,535 INFO L280 TraceCheckUtils]: 32: Hoare triple {1830#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1830#true} is VALID [2020-07-28 19:07:26,535 INFO L280 TraceCheckUtils]: 33: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,536 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,536 INFO L280 TraceCheckUtils]: 35: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,536 INFO L280 TraceCheckUtils]: 36: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,536 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2020-07-28 19:07:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,541 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,542 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,543 INFO L263 TraceCheckUtils]: 3: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,543 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,544 INFO L263 TraceCheckUtils]: 7: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,544 INFO L280 TraceCheckUtils]: 8: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,545 INFO L263 TraceCheckUtils]: 11: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,546 INFO L280 TraceCheckUtils]: 13: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,547 INFO L280 TraceCheckUtils]: 14: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,547 INFO L263 TraceCheckUtils]: 15: Hoare triple {1966#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,547 INFO L280 TraceCheckUtils]: 16: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,549 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1830#true} {1966#(= 0 |ackermann_#in~n|)} #44#return; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,549 INFO L280 TraceCheckUtils]: 20: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,550 INFO L280 TraceCheckUtils]: 21: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume true; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,551 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1966#(= 0 |ackermann_#in~n|)} {1830#true} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,551 INFO L280 TraceCheckUtils]: 23: Hoare triple {1831#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1831#false} is VALID [2020-07-28 19:07:26,551 INFO L280 TraceCheckUtils]: 24: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,552 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,552 INFO L280 TraceCheckUtils]: 26: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,552 INFO L263 TraceCheckUtils]: 27: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1830#true} is VALID [2020-07-28 19:07:26,552 INFO L280 TraceCheckUtils]: 28: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,553 INFO L280 TraceCheckUtils]: 29: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,553 INFO L280 TraceCheckUtils]: 30: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,553 INFO L263 TraceCheckUtils]: 31: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,553 INFO L280 TraceCheckUtils]: 32: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,553 INFO L280 TraceCheckUtils]: 33: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,554 INFO L280 TraceCheckUtils]: 34: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,554 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1830#true} {1830#true} #44#return; {1830#true} is VALID [2020-07-28 19:07:26,554 INFO L280 TraceCheckUtils]: 36: Hoare triple {1830#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1830#true} is VALID [2020-07-28 19:07:26,554 INFO L280 TraceCheckUtils]: 37: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,554 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,555 INFO L280 TraceCheckUtils]: 39: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,555 INFO L280 TraceCheckUtils]: 40: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,555 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,555 INFO L280 TraceCheckUtils]: 42: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,556 INFO L263 TraceCheckUtils]: 43: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1830#true} is VALID [2020-07-28 19:07:26,556 INFO L280 TraceCheckUtils]: 44: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,556 INFO L280 TraceCheckUtils]: 45: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,556 INFO L280 TraceCheckUtils]: 46: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,556 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,557 INFO L280 TraceCheckUtils]: 48: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,557 INFO L280 TraceCheckUtils]: 49: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,557 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {1831#false} {1830#true} #42#return; {1831#false} is VALID [2020-07-28 19:07:26,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {1830#true} is VALID [2020-07-28 19:07:26,559 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {1830#true} is VALID [2020-07-28 19:07:26,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {1830#true} is VALID [2020-07-28 19:07:26,560 INFO L263 TraceCheckUtils]: 3: Hoare triple {1830#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {1830#true} is VALID [2020-07-28 19:07:26,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,560 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,561 INFO L263 TraceCheckUtils]: 7: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,561 INFO L280 TraceCheckUtils]: 8: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,561 INFO L280 TraceCheckUtils]: 9: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,561 INFO L280 TraceCheckUtils]: 10: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,562 INFO L263 TraceCheckUtils]: 11: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,562 INFO L280 TraceCheckUtils]: 12: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,562 INFO L280 TraceCheckUtils]: 13: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,562 INFO L280 TraceCheckUtils]: 14: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,563 INFO L263 TraceCheckUtils]: 15: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,563 INFO L280 TraceCheckUtils]: 16: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,564 INFO L280 TraceCheckUtils]: 17: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {1965#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,564 INFO L280 TraceCheckUtils]: 18: Hoare triple {1965#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,565 INFO L263 TraceCheckUtils]: 19: Hoare triple {1966#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,565 INFO L280 TraceCheckUtils]: 20: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,565 INFO L280 TraceCheckUtils]: 21: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,565 INFO L280 TraceCheckUtils]: 22: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,566 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1830#true} {1966#(= 0 |ackermann_#in~n|)} #44#return; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,567 INFO L280 TraceCheckUtils]: 24: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,567 INFO L280 TraceCheckUtils]: 25: Hoare triple {1966#(= 0 |ackermann_#in~n|)} assume true; {1966#(= 0 |ackermann_#in~n|)} is VALID [2020-07-28 19:07:26,568 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {1966#(= 0 |ackermann_#in~n|)} {1830#true} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,569 INFO L280 TraceCheckUtils]: 27: Hoare triple {1831#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1831#false} is VALID [2020-07-28 19:07:26,569 INFO L280 TraceCheckUtils]: 28: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,569 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,569 INFO L280 TraceCheckUtils]: 30: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,569 INFO L263 TraceCheckUtils]: 31: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1830#true} is VALID [2020-07-28 19:07:26,569 INFO L280 TraceCheckUtils]: 32: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,570 INFO L280 TraceCheckUtils]: 33: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,570 INFO L280 TraceCheckUtils]: 34: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,570 INFO L263 TraceCheckUtils]: 35: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,570 INFO L280 TraceCheckUtils]: 36: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,571 INFO L280 TraceCheckUtils]: 37: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,571 INFO L280 TraceCheckUtils]: 38: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,571 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1830#true} {1830#true} #44#return; {1830#true} is VALID [2020-07-28 19:07:26,571 INFO L280 TraceCheckUtils]: 40: Hoare triple {1830#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1830#true} is VALID [2020-07-28 19:07:26,571 INFO L280 TraceCheckUtils]: 41: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,571 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,572 INFO L280 TraceCheckUtils]: 43: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,572 INFO L280 TraceCheckUtils]: 44: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,572 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,572 INFO L280 TraceCheckUtils]: 46: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,573 INFO L263 TraceCheckUtils]: 47: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1830#true} is VALID [2020-07-28 19:07:26,573 INFO L280 TraceCheckUtils]: 48: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,573 INFO L280 TraceCheckUtils]: 49: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,573 INFO L280 TraceCheckUtils]: 50: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,573 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1830#true} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,574 INFO L280 TraceCheckUtils]: 52: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,574 INFO L280 TraceCheckUtils]: 53: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,574 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1831#false} {1830#true} #42#return; {1831#false} is VALID [2020-07-28 19:07:26,574 INFO L280 TraceCheckUtils]: 55: Hoare triple {1831#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {1831#false} is VALID [2020-07-28 19:07:26,574 INFO L280 TraceCheckUtils]: 56: Hoare triple {1831#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {1831#false} is VALID [2020-07-28 19:07:26,574 INFO L280 TraceCheckUtils]: 57: Hoare triple {1831#false} assume !false; {1831#false} is VALID [2020-07-28 19:07:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 32 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-07-28 19:07:26,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100367145] [2020-07-28 19:07:26,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151591914] [2020-07-28 19:07:26,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:26,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-28 19:07:26,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:07:26,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 19:07:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:26,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:26,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {1830#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {1830#true} is VALID [2020-07-28 19:07:26,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {1830#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {1830#true} is VALID [2020-07-28 19:07:26,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {1830#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {1830#true} is VALID [2020-07-28 19:07:26,747 INFO L263 TraceCheckUtils]: 3: Hoare triple {1830#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {1830#true} is VALID [2020-07-28 19:07:26,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,747 INFO L280 TraceCheckUtils]: 5: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,748 INFO L280 TraceCheckUtils]: 6: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,748 INFO L263 TraceCheckUtils]: 7: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,748 INFO L280 TraceCheckUtils]: 9: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,748 INFO L280 TraceCheckUtils]: 10: Hoare triple {1830#true} assume !(0 == ~n); {1830#true} is VALID [2020-07-28 19:07:26,748 INFO L263 TraceCheckUtils]: 11: Hoare triple {1830#true} call #t~ret1 := ackermann(~m, ~n - 1); {1830#true} is VALID [2020-07-28 19:07:26,749 INFO L280 TraceCheckUtils]: 12: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,749 INFO L280 TraceCheckUtils]: 13: Hoare triple {1830#true} assume !(0 == ~m); {1830#true} is VALID [2020-07-28 19:07:26,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {1830#true} assume 0 == ~n; {1830#true} is VALID [2020-07-28 19:07:26,749 INFO L263 TraceCheckUtils]: 15: Hoare triple {1830#true} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,750 INFO L280 TraceCheckUtils]: 16: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {2026#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:26,750 INFO L280 TraceCheckUtils]: 17: Hoare triple {2026#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {2026#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:26,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {2026#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {2033#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:26,751 INFO L263 TraceCheckUtils]: 19: Hoare triple {2033#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {1830#true} is VALID [2020-07-28 19:07:26,751 INFO L280 TraceCheckUtils]: 20: Hoare triple {1830#true} ~m := #in~m;~n := #in~n; {1830#true} is VALID [2020-07-28 19:07:26,751 INFO L280 TraceCheckUtils]: 21: Hoare triple {1830#true} assume 0 == ~m;#res := 1 + ~n; {1830#true} is VALID [2020-07-28 19:07:26,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {1830#true} assume true; {1830#true} is VALID [2020-07-28 19:07:26,752 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1830#true} {2033#(<= |ackermann_#in~n| 0)} #44#return; {2033#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:26,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {2033#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2033#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:26,752 INFO L280 TraceCheckUtils]: 25: Hoare triple {2033#(<= |ackermann_#in~n| 0)} assume true; {2033#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:26,753 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2033#(<= |ackermann_#in~n| 0)} {1830#true} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,753 INFO L280 TraceCheckUtils]: 27: Hoare triple {1831#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1831#false} is VALID [2020-07-28 19:07:26,753 INFO L280 TraceCheckUtils]: 28: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L280 TraceCheckUtils]: 30: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L263 TraceCheckUtils]: 31: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L280 TraceCheckUtils]: 32: Hoare triple {1831#false} ~m := #in~m;~n := #in~n; {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L280 TraceCheckUtils]: 33: Hoare triple {1831#false} assume !(0 == ~m); {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L280 TraceCheckUtils]: 34: Hoare triple {1831#false} assume 0 == ~n; {1831#false} is VALID [2020-07-28 19:07:26,754 INFO L263 TraceCheckUtils]: 35: Hoare triple {1831#false} call #t~ret0 := ackermann(~m - 1, 1); {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L280 TraceCheckUtils]: 36: Hoare triple {1831#false} ~m := #in~m;~n := #in~n; {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L280 TraceCheckUtils]: 37: Hoare triple {1831#false} assume 0 == ~m;#res := 1 + ~n; {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L280 TraceCheckUtils]: 38: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {1831#false} {1831#false} #44#return; {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L280 TraceCheckUtils]: 40: Hoare triple {1831#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L280 TraceCheckUtils]: 41: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,755 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {1831#false} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,756 INFO L280 TraceCheckUtils]: 43: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,756 INFO L280 TraceCheckUtils]: 44: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,756 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1831#false} {1830#true} #46#return; {1831#false} is VALID [2020-07-28 19:07:26,756 INFO L280 TraceCheckUtils]: 46: Hoare triple {1831#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1831#false} is VALID [2020-07-28 19:07:26,756 INFO L263 TraceCheckUtils]: 47: Hoare triple {1831#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1831#false} is VALID [2020-07-28 19:07:26,756 INFO L280 TraceCheckUtils]: 48: Hoare triple {1831#false} ~m := #in~m;~n := #in~n; {1831#false} is VALID [2020-07-28 19:07:26,757 INFO L280 TraceCheckUtils]: 49: Hoare triple {1831#false} assume 0 == ~m;#res := 1 + ~n; {1831#false} is VALID [2020-07-28 19:07:26,757 INFO L280 TraceCheckUtils]: 50: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,757 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1831#false} {1831#false} #48#return; {1831#false} is VALID [2020-07-28 19:07:26,757 INFO L280 TraceCheckUtils]: 52: Hoare triple {1831#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {1831#false} is VALID [2020-07-28 19:07:26,757 INFO L280 TraceCheckUtils]: 53: Hoare triple {1831#false} assume true; {1831#false} is VALID [2020-07-28 19:07:26,757 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1831#false} {1830#true} #42#return; {1831#false} is VALID [2020-07-28 19:07:26,758 INFO L280 TraceCheckUtils]: 55: Hoare triple {1831#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {1831#false} is VALID [2020-07-28 19:07:26,758 INFO L280 TraceCheckUtils]: 56: Hoare triple {1831#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {1831#false} is VALID [2020-07-28 19:07:26,758 INFO L280 TraceCheckUtils]: 57: Hoare triple {1831#false} assume !false; {1831#false} is VALID [2020-07-28 19:07:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-28 19:07:26,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:26,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-28 19:07:26,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655872058] [2020-07-28 19:07:26,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-28 19:07:26,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:26,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 19:07:26,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:26,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 19:07:26,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:26,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 19:07:26,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 19:07:26,829 INFO L87 Difference]: Start difference. First operand 49 states and 77 transitions. Second operand 6 states. [2020-07-28 19:07:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:26,999 INFO L93 Difference]: Finished difference Result 97 states and 184 transitions. [2020-07-28 19:07:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 19:07:27,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2020-07-28 19:07:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:07:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-07-28 19:07:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 19:07:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2020-07-28 19:07:27,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2020-07-28 19:07:27,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:27,078 INFO L225 Difference]: With dead ends: 97 [2020-07-28 19:07:27,078 INFO L226 Difference]: Without dead ends: 52 [2020-07-28 19:07:27,080 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 19:07:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-28 19:07:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-28 19:07:27,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:27,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2020-07-28 19:07:27,124 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-28 19:07:27,124 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-28 19:07:27,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:27,129 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2020-07-28 19:07:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2020-07-28 19:07:27,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:27,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:27,131 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2020-07-28 19:07:27,131 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2020-07-28 19:07:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:27,135 INFO L93 Difference]: Finished difference Result 52 states and 83 transitions. [2020-07-28 19:07:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2020-07-28 19:07:27,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:27,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:27,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:27,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-28 19:07:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2020-07-28 19:07:27,142 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 58 [2020-07-28 19:07:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:27,142 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2020-07-28 19:07:27,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 19:07:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2020-07-28 19:07:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-07-28 19:07:27,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:07:27,144 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:07:27,356 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-28 19:07:27,356 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:07:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:07:27,357 INFO L82 PathProgramCache]: Analyzing trace with hash -191844027, now seen corresponding path program 5 times [2020-07-28 19:07:27,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:07:27,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489668356] [2020-07-28 19:07:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:07:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,656 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,659 INFO L263 TraceCheckUtils]: 3: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,661 INFO L280 TraceCheckUtils]: 6: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,662 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,663 INFO L280 TraceCheckUtils]: 8: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,665 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2020-07-28 19:07:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,674 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2431#true} {2632#(<= 1 |ackermann_#in~m|)} #48#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,676 INFO L263 TraceCheckUtils]: 3: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,678 INFO L280 TraceCheckUtils]: 5: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,678 INFO L263 TraceCheckUtils]: 7: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,680 INFO L280 TraceCheckUtils]: 9: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,682 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,684 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,685 INFO L280 TraceCheckUtils]: 15: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,685 INFO L263 TraceCheckUtils]: 16: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,686 INFO L280 TraceCheckUtils]: 17: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,686 INFO L280 TraceCheckUtils]: 18: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,686 INFO L280 TraceCheckUtils]: 19: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,687 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2431#true} {2632#(<= 1 |ackermann_#in~m|)} #48#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,688 INFO L280 TraceCheckUtils]: 21: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,689 INFO L280 TraceCheckUtils]: 22: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,690 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,692 INFO L280 TraceCheckUtils]: 1: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,693 INFO L263 TraceCheckUtils]: 3: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,694 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,695 INFO L280 TraceCheckUtils]: 6: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,696 INFO L263 TraceCheckUtils]: 7: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,696 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,697 INFO L280 TraceCheckUtils]: 9: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,698 INFO L280 TraceCheckUtils]: 10: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,698 INFO L263 TraceCheckUtils]: 11: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,699 INFO L280 TraceCheckUtils]: 13: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,700 INFO L280 TraceCheckUtils]: 14: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,701 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,702 INFO L280 TraceCheckUtils]: 16: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,703 INFO L280 TraceCheckUtils]: 17: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,704 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,705 INFO L280 TraceCheckUtils]: 19: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,705 INFO L263 TraceCheckUtils]: 20: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,706 INFO L280 TraceCheckUtils]: 21: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,706 INFO L280 TraceCheckUtils]: 22: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,706 INFO L280 TraceCheckUtils]: 23: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,707 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {2431#true} {2632#(<= 1 |ackermann_#in~m|)} #48#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,708 INFO L280 TraceCheckUtils]: 25: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,709 INFO L280 TraceCheckUtils]: 26: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,711 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,712 INFO L280 TraceCheckUtils]: 28: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,713 INFO L280 TraceCheckUtils]: 29: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,714 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-07-28 19:07:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-07-28 19:07:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,729 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,730 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2431#true} {2431#true} #44#return; {2431#true} is VALID [2020-07-28 19:07:27,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,730 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:27,731 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume 0 == ~n; {2431#true} is VALID [2020-07-28 19:07:27,731 INFO L263 TraceCheckUtils]: 3: Hoare triple {2431#true} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,731 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,731 INFO L280 TraceCheckUtils]: 5: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,731 INFO L280 TraceCheckUtils]: 6: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,732 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {2431#true} {2431#true} #44#return; {2431#true} is VALID [2020-07-28 19:07:27,732 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2431#true} is VALID [2020-07-28 19:07:27,732 INFO L280 TraceCheckUtils]: 9: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,734 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2431#true} {2585#(<= 2 |ackermann_#in~m|)} #48#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,737 INFO L263 TraceCheckUtils]: 3: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,738 INFO L280 TraceCheckUtils]: 5: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,739 INFO L263 TraceCheckUtils]: 7: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,740 INFO L280 TraceCheckUtils]: 9: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,741 INFO L280 TraceCheckUtils]: 10: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,741 INFO L263 TraceCheckUtils]: 11: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,742 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,742 INFO L280 TraceCheckUtils]: 13: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,743 INFO L280 TraceCheckUtils]: 14: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,743 INFO L263 TraceCheckUtils]: 15: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,744 INFO L280 TraceCheckUtils]: 16: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,745 INFO L280 TraceCheckUtils]: 17: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,745 INFO L280 TraceCheckUtils]: 18: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,747 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,747 INFO L280 TraceCheckUtils]: 20: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,748 INFO L280 TraceCheckUtils]: 21: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,749 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,750 INFO L280 TraceCheckUtils]: 23: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,750 INFO L263 TraceCheckUtils]: 24: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,750 INFO L280 TraceCheckUtils]: 25: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,750 INFO L280 TraceCheckUtils]: 26: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,751 INFO L280 TraceCheckUtils]: 27: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,752 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2431#true} {2632#(<= 1 |ackermann_#in~m|)} #48#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,752 INFO L280 TraceCheckUtils]: 29: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,753 INFO L280 TraceCheckUtils]: 30: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,754 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,755 INFO L280 TraceCheckUtils]: 32: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,756 INFO L280 TraceCheckUtils]: 33: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,757 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,757 INFO L280 TraceCheckUtils]: 35: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,758 INFO L263 TraceCheckUtils]: 36: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,758 INFO L280 TraceCheckUtils]: 37: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,758 INFO L280 TraceCheckUtils]: 38: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:27,758 INFO L280 TraceCheckUtils]: 39: Hoare triple {2431#true} assume 0 == ~n; {2431#true} is VALID [2020-07-28 19:07:27,758 INFO L263 TraceCheckUtils]: 40: Hoare triple {2431#true} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,759 INFO L280 TraceCheckUtils]: 41: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,759 INFO L280 TraceCheckUtils]: 42: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,759 INFO L280 TraceCheckUtils]: 43: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,759 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2431#true} {2431#true} #44#return; {2431#true} is VALID [2020-07-28 19:07:27,760 INFO L280 TraceCheckUtils]: 45: Hoare triple {2431#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2431#true} is VALID [2020-07-28 19:07:27,760 INFO L280 TraceCheckUtils]: 46: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,761 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2431#true} {2585#(<= 2 |ackermann_#in~m|)} #48#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,762 INFO L280 TraceCheckUtils]: 48: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,762 INFO L280 TraceCheckUtils]: 49: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,763 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2431#true} #46#return; {2548#(<= 2 ackermann_~m)} is VALID [2020-07-28 19:07:27,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-07-28 19:07:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,776 INFO L280 TraceCheckUtils]: 2: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,777 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2548#(<= 2 ackermann_~m)} #48#return; {2432#false} is VALID [2020-07-28 19:07:27,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:27,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume !(0 == ~n); {2431#true} is VALID [2020-07-28 19:07:27,778 INFO L263 TraceCheckUtils]: 3: Hoare triple {2431#true} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,779 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,780 INFO L280 TraceCheckUtils]: 6: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,780 INFO L263 TraceCheckUtils]: 7: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,782 INFO L280 TraceCheckUtils]: 10: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,782 INFO L263 TraceCheckUtils]: 11: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,783 INFO L280 TraceCheckUtils]: 13: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,784 INFO L263 TraceCheckUtils]: 15: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,785 INFO L280 TraceCheckUtils]: 17: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,786 INFO L263 TraceCheckUtils]: 19: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,786 INFO L280 TraceCheckUtils]: 20: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,787 INFO L280 TraceCheckUtils]: 21: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,788 INFO L280 TraceCheckUtils]: 22: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,791 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,795 INFO L280 TraceCheckUtils]: 24: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,796 INFO L280 TraceCheckUtils]: 25: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,798 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,798 INFO L280 TraceCheckUtils]: 27: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,798 INFO L263 TraceCheckUtils]: 28: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,799 INFO L280 TraceCheckUtils]: 29: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,799 INFO L280 TraceCheckUtils]: 30: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,799 INFO L280 TraceCheckUtils]: 31: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,800 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {2431#true} {2632#(<= 1 |ackermann_#in~m|)} #48#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,800 INFO L280 TraceCheckUtils]: 33: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,801 INFO L280 TraceCheckUtils]: 34: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,802 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,802 INFO L280 TraceCheckUtils]: 36: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,802 INFO L280 TraceCheckUtils]: 37: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,804 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,804 INFO L280 TraceCheckUtils]: 39: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,805 INFO L263 TraceCheckUtils]: 40: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,805 INFO L280 TraceCheckUtils]: 41: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,805 INFO L280 TraceCheckUtils]: 42: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:27,805 INFO L280 TraceCheckUtils]: 43: Hoare triple {2431#true} assume 0 == ~n; {2431#true} is VALID [2020-07-28 19:07:27,806 INFO L263 TraceCheckUtils]: 44: Hoare triple {2431#true} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,806 INFO L280 TraceCheckUtils]: 45: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,806 INFO L280 TraceCheckUtils]: 46: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,806 INFO L280 TraceCheckUtils]: 47: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,806 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2431#true} {2431#true} #44#return; {2431#true} is VALID [2020-07-28 19:07:27,806 INFO L280 TraceCheckUtils]: 49: Hoare triple {2431#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2431#true} is VALID [2020-07-28 19:07:27,807 INFO L280 TraceCheckUtils]: 50: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,807 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2431#true} {2585#(<= 2 |ackermann_#in~m|)} #48#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,808 INFO L280 TraceCheckUtils]: 52: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,808 INFO L280 TraceCheckUtils]: 53: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,809 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2431#true} #46#return; {2548#(<= 2 ackermann_~m)} is VALID [2020-07-28 19:07:27,809 INFO L280 TraceCheckUtils]: 55: Hoare triple {2548#(<= 2 ackermann_~m)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2548#(<= 2 ackermann_~m)} is VALID [2020-07-28 19:07:27,810 INFO L263 TraceCheckUtils]: 56: Hoare triple {2548#(<= 2 ackermann_~m)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,810 INFO L280 TraceCheckUtils]: 57: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,811 INFO L280 TraceCheckUtils]: 58: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,812 INFO L280 TraceCheckUtils]: 59: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,813 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2548#(<= 2 ackermann_~m)} #48#return; {2432#false} is VALID [2020-07-28 19:07:27,813 INFO L280 TraceCheckUtils]: 61: Hoare triple {2432#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2432#false} is VALID [2020-07-28 19:07:27,813 INFO L280 TraceCheckUtils]: 62: Hoare triple {2432#false} assume true; {2432#false} is VALID [2020-07-28 19:07:27,813 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2432#false} {2431#true} #42#return; {2432#false} is VALID [2020-07-28 19:07:27,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {2431#true} is VALID [2020-07-28 19:07:27,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {2431#true} is VALID [2020-07-28 19:07:27,818 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {2431#true} is VALID [2020-07-28 19:07:27,818 INFO L263 TraceCheckUtils]: 3: Hoare triple {2431#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {2431#true} is VALID [2020-07-28 19:07:27,818 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,819 INFO L280 TraceCheckUtils]: 5: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:27,819 INFO L280 TraceCheckUtils]: 6: Hoare triple {2431#true} assume !(0 == ~n); {2431#true} is VALID [2020-07-28 19:07:27,819 INFO L263 TraceCheckUtils]: 7: Hoare triple {2431#true} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,822 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,824 INFO L280 TraceCheckUtils]: 9: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,824 INFO L280 TraceCheckUtils]: 10: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,825 INFO L263 TraceCheckUtils]: 11: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,825 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,825 INFO L280 TraceCheckUtils]: 13: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,826 INFO L280 TraceCheckUtils]: 14: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,826 INFO L263 TraceCheckUtils]: 15: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,826 INFO L280 TraceCheckUtils]: 16: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,827 INFO L280 TraceCheckUtils]: 17: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,827 INFO L280 TraceCheckUtils]: 18: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~n); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,827 INFO L263 TraceCheckUtils]: 19: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:27,829 INFO L280 TraceCheckUtils]: 20: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,831 INFO L280 TraceCheckUtils]: 21: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,831 INFO L280 TraceCheckUtils]: 22: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,831 INFO L263 TraceCheckUtils]: 23: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,832 INFO L280 TraceCheckUtils]: 24: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,832 INFO L280 TraceCheckUtils]: 25: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,833 INFO L280 TraceCheckUtils]: 26: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,834 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,834 INFO L280 TraceCheckUtils]: 28: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,835 INFO L280 TraceCheckUtils]: 29: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,836 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,837 INFO L280 TraceCheckUtils]: 31: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,837 INFO L263 TraceCheckUtils]: 32: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,838 INFO L280 TraceCheckUtils]: 33: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,838 INFO L280 TraceCheckUtils]: 34: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,838 INFO L280 TraceCheckUtils]: 35: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,839 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2431#true} {2632#(<= 1 |ackermann_#in~m|)} #48#return; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,840 INFO L280 TraceCheckUtils]: 37: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,841 INFO L280 TraceCheckUtils]: 38: Hoare triple {2632#(<= 1 |ackermann_#in~m|)} assume true; {2632#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,842 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2632#(<= 1 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #44#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,843 INFO L280 TraceCheckUtils]: 40: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,844 INFO L280 TraceCheckUtils]: 41: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,845 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2553#(= ackermann_~m |ackermann_#in~m|)} #46#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,846 INFO L280 TraceCheckUtils]: 43: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,846 INFO L263 TraceCheckUtils]: 44: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,846 INFO L280 TraceCheckUtils]: 45: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,846 INFO L280 TraceCheckUtils]: 46: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:27,847 INFO L280 TraceCheckUtils]: 47: Hoare triple {2431#true} assume 0 == ~n; {2431#true} is VALID [2020-07-28 19:07:27,847 INFO L263 TraceCheckUtils]: 48: Hoare triple {2431#true} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:27,847 INFO L280 TraceCheckUtils]: 49: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:27,847 INFO L280 TraceCheckUtils]: 50: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:27,848 INFO L280 TraceCheckUtils]: 51: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,848 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2431#true} {2431#true} #44#return; {2431#true} is VALID [2020-07-28 19:07:27,848 INFO L280 TraceCheckUtils]: 53: Hoare triple {2431#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2431#true} is VALID [2020-07-28 19:07:27,848 INFO L280 TraceCheckUtils]: 54: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:27,849 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {2431#true} {2585#(<= 2 |ackermann_#in~m|)} #48#return; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,849 INFO L280 TraceCheckUtils]: 56: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,850 INFO L280 TraceCheckUtils]: 57: Hoare triple {2585#(<= 2 |ackermann_#in~m|)} assume true; {2585#(<= 2 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,850 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2585#(<= 2 |ackermann_#in~m|)} {2431#true} #46#return; {2548#(<= 2 ackermann_~m)} is VALID [2020-07-28 19:07:27,851 INFO L280 TraceCheckUtils]: 59: Hoare triple {2548#(<= 2 ackermann_~m)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2548#(<= 2 ackermann_~m)} is VALID [2020-07-28 19:07:27,851 INFO L263 TraceCheckUtils]: 60: Hoare triple {2548#(<= 2 ackermann_~m)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:27,851 INFO L280 TraceCheckUtils]: 61: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2553#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,852 INFO L280 TraceCheckUtils]: 62: Hoare triple {2553#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m;#res := 1 + ~n; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,852 INFO L280 TraceCheckUtils]: 63: Hoare triple {2641#(= 0 |ackermann_#in~m|)} assume true; {2641#(= 0 |ackermann_#in~m|)} is VALID [2020-07-28 19:07:27,853 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2641#(= 0 |ackermann_#in~m|)} {2548#(<= 2 ackermann_~m)} #48#return; {2432#false} is VALID [2020-07-28 19:07:27,854 INFO L280 TraceCheckUtils]: 65: Hoare triple {2432#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2432#false} is VALID [2020-07-28 19:07:27,854 INFO L280 TraceCheckUtils]: 66: Hoare triple {2432#false} assume true; {2432#false} is VALID [2020-07-28 19:07:27,854 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2432#false} {2431#true} #42#return; {2432#false} is VALID [2020-07-28 19:07:27,854 INFO L280 TraceCheckUtils]: 68: Hoare triple {2432#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {2432#false} is VALID [2020-07-28 19:07:27,855 INFO L280 TraceCheckUtils]: 69: Hoare triple {2432#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {2432#false} is VALID [2020-07-28 19:07:27,855 INFO L280 TraceCheckUtils]: 70: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2020-07-28 19:07:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 63 proven. 63 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-07-28 19:07:27,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489668356] [2020-07-28 19:07:27,863 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213238177] [2020-07-28 19:07:27,863 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:27,901 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-28 19:07:27,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 19:07:27,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-28 19:07:27,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:07:27,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:07:28,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {2431#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~result~0;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~m~0 := main_#t~nondet3;havoc main_#t~nondet3; {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {2431#true} assume !(main_~m~0 < 0 || main_~m~0 > 3);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~n~0 := main_#t~nondet4;havoc main_#t~nondet4; {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#true} assume !(main_~n~0 < 0 || main_~n~0 > 23); {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L263 TraceCheckUtils]: 3: Hoare triple {2431#true} call main_#t~ret5 := ackermann(main_~m~0, main_~n~0); {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {2431#true} assume !(0 == ~n); {2431#true} is VALID [2020-07-28 19:07:28,493 INFO L263 TraceCheckUtils]: 7: Hoare triple {2431#true} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:28,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:28,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:28,494 INFO L280 TraceCheckUtils]: 10: Hoare triple {2431#true} assume !(0 == ~n); {2431#true} is VALID [2020-07-28 19:07:28,494 INFO L263 TraceCheckUtils]: 11: Hoare triple {2431#true} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:28,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:28,494 INFO L280 TraceCheckUtils]: 13: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {2431#true} assume 0 == ~n; {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L263 TraceCheckUtils]: 15: Hoare triple {2431#true} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L280 TraceCheckUtils]: 17: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L280 TraceCheckUtils]: 18: Hoare triple {2431#true} assume !(0 == ~n); {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L263 TraceCheckUtils]: 19: Hoare triple {2431#true} call #t~ret1 := ackermann(~m, ~n - 1); {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:28,495 INFO L280 TraceCheckUtils]: 21: Hoare triple {2431#true} assume !(0 == ~m); {2431#true} is VALID [2020-07-28 19:07:28,496 INFO L280 TraceCheckUtils]: 22: Hoare triple {2431#true} assume 0 == ~n; {2431#true} is VALID [2020-07-28 19:07:28,496 INFO L263 TraceCheckUtils]: 23: Hoare triple {2431#true} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:28,496 INFO L280 TraceCheckUtils]: 24: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2721#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:28,497 INFO L280 TraceCheckUtils]: 25: Hoare triple {2721#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:28,497 INFO L280 TraceCheckUtils]: 26: Hoare triple {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:28,498 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2431#true} #44#return; {2732#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:28,499 INFO L280 TraceCheckUtils]: 28: Hoare triple {2732#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2736#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:28,499 INFO L280 TraceCheckUtils]: 29: Hoare triple {2736#(<= 2 |ackermann_#res|)} assume true; {2736#(<= 2 |ackermann_#res|)} is VALID [2020-07-28 19:07:28,500 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2736#(<= 2 |ackermann_#res|)} {2431#true} #46#return; {2743#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:28,501 INFO L280 TraceCheckUtils]: 31: Hoare triple {2743#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2743#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:28,501 INFO L263 TraceCheckUtils]: 32: Hoare triple {2743#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:28,502 INFO L280 TraceCheckUtils]: 33: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2721#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:28,503 INFO L280 TraceCheckUtils]: 34: Hoare triple {2721#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~m;#res := 1 + ~n; {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:28,504 INFO L280 TraceCheckUtils]: 35: Hoare triple {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-28 19:07:28,505 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {2725#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2743#(<= 2 |ackermann_#t~ret1|)} #48#return; {2762#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-28 19:07:28,505 INFO L280 TraceCheckUtils]: 37: Hoare triple {2762#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2766#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:28,506 INFO L280 TraceCheckUtils]: 38: Hoare triple {2766#(<= 3 |ackermann_#res|)} assume true; {2766#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:28,507 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2766#(<= 3 |ackermann_#res|)} {2431#true} #44#return; {2773#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-28 19:07:28,508 INFO L280 TraceCheckUtils]: 40: Hoare triple {2773#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2766#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:28,508 INFO L280 TraceCheckUtils]: 41: Hoare triple {2766#(<= 3 |ackermann_#res|)} assume true; {2766#(<= 3 |ackermann_#res|)} is VALID [2020-07-28 19:07:28,509 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2766#(<= 3 |ackermann_#res|)} {2431#true} #46#return; {2783#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:28,509 INFO L280 TraceCheckUtils]: 43: Hoare triple {2783#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2783#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-28 19:07:28,509 INFO L263 TraceCheckUtils]: 44: Hoare triple {2783#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2431#true} is VALID [2020-07-28 19:07:28,510 INFO L280 TraceCheckUtils]: 45: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2721#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:28,511 INFO L280 TraceCheckUtils]: 46: Hoare triple {2721#(<= |ackermann_#in~n| ackermann_~n)} assume !(0 == ~m); {2721#(<= |ackermann_#in~n| ackermann_~n)} is VALID [2020-07-28 19:07:28,513 INFO L280 TraceCheckUtils]: 47: Hoare triple {2721#(<= |ackermann_#in~n| ackermann_~n)} assume 0 == ~n; {2799#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:28,514 INFO L263 TraceCheckUtils]: 48: Hoare triple {2799#(<= |ackermann_#in~n| 0)} call #t~ret0 := ackermann(~m - 1, 1); {2431#true} is VALID [2020-07-28 19:07:28,514 INFO L280 TraceCheckUtils]: 49: Hoare triple {2431#true} ~m := #in~m;~n := #in~n; {2431#true} is VALID [2020-07-28 19:07:28,514 INFO L280 TraceCheckUtils]: 50: Hoare triple {2431#true} assume 0 == ~m;#res := 1 + ~n; {2431#true} is VALID [2020-07-28 19:07:28,514 INFO L280 TraceCheckUtils]: 51: Hoare triple {2431#true} assume true; {2431#true} is VALID [2020-07-28 19:07:28,515 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2431#true} {2799#(<= |ackermann_#in~n| 0)} #44#return; {2799#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:28,515 INFO L280 TraceCheckUtils]: 53: Hoare triple {2799#(<= |ackermann_#in~n| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {2799#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:28,516 INFO L280 TraceCheckUtils]: 54: Hoare triple {2799#(<= |ackermann_#in~n| 0)} assume true; {2799#(<= |ackermann_#in~n| 0)} is VALID [2020-07-28 19:07:28,517 INFO L275 TraceCheckUtils]: 55: Hoare quadruple {2799#(<= |ackermann_#in~n| 0)} {2783#(<= 3 |ackermann_#t~ret1|)} #48#return; {2432#false} is VALID [2020-07-28 19:07:28,517 INFO L280 TraceCheckUtils]: 56: Hoare triple {2432#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2432#false} is VALID [2020-07-28 19:07:28,517 INFO L280 TraceCheckUtils]: 57: Hoare triple {2432#false} assume true; {2432#false} is VALID [2020-07-28 19:07:28,517 INFO L275 TraceCheckUtils]: 58: Hoare quadruple {2432#false} {2431#true} #46#return; {2432#false} is VALID [2020-07-28 19:07:28,517 INFO L280 TraceCheckUtils]: 59: Hoare triple {2432#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2432#false} is VALID [2020-07-28 19:07:28,518 INFO L263 TraceCheckUtils]: 60: Hoare triple {2432#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2432#false} is VALID [2020-07-28 19:07:28,518 INFO L280 TraceCheckUtils]: 61: Hoare triple {2432#false} ~m := #in~m;~n := #in~n; {2432#false} is VALID [2020-07-28 19:07:28,518 INFO L280 TraceCheckUtils]: 62: Hoare triple {2432#false} assume 0 == ~m;#res := 1 + ~n; {2432#false} is VALID [2020-07-28 19:07:28,518 INFO L280 TraceCheckUtils]: 63: Hoare triple {2432#false} assume true; {2432#false} is VALID [2020-07-28 19:07:28,518 INFO L275 TraceCheckUtils]: 64: Hoare quadruple {2432#false} {2432#false} #48#return; {2432#false} is VALID [2020-07-28 19:07:28,518 INFO L280 TraceCheckUtils]: 65: Hoare triple {2432#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;#res := #t~ret2;havoc #t~ret2;havoc #t~ret1; {2432#false} is VALID [2020-07-28 19:07:28,519 INFO L280 TraceCheckUtils]: 66: Hoare triple {2432#false} assume true; {2432#false} is VALID [2020-07-28 19:07:28,519 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2432#false} {2431#true} #42#return; {2432#false} is VALID [2020-07-28 19:07:28,519 INFO L280 TraceCheckUtils]: 68: Hoare triple {2432#false} assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;main_~result~0 := main_#t~ret5;havoc main_#t~ret5; {2432#false} is VALID [2020-07-28 19:07:28,519 INFO L280 TraceCheckUtils]: 69: Hoare triple {2432#false} assume !((main_~m~0 < 0 || main_~n~0 < 0) || main_~result~0 >= 0); {2432#false} is VALID [2020-07-28 19:07:28,519 INFO L280 TraceCheckUtils]: 70: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2020-07-28 19:07:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 97 proven. 37 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2020-07-28 19:07:28,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:07:28,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2020-07-28 19:07:28,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510523393] [2020-07-28 19:07:28,526 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2020-07-28 19:07:28,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:07:28,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-28 19:07:28,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:28,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-28 19:07:28,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:07:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-28 19:07:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-07-28 19:07:28,623 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand 17 states. [2020-07-28 19:07:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:30,595 INFO L93 Difference]: Finished difference Result 85 states and 170 transitions. [2020-07-28 19:07:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-28 19:07:30,595 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2020-07-28 19:07:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:07:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:07:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 78 transitions. [2020-07-28 19:07:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:07:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 78 transitions. [2020-07-28 19:07:30,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 78 transitions. [2020-07-28 19:07:30,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:07:30,727 INFO L225 Difference]: With dead ends: 85 [2020-07-28 19:07:30,728 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:07:30,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-07-28 19:07:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:07:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:07:30,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:07:30,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:30,731 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:30,731 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:30,732 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:07:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:07:30,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:30,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:30,732 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:30,732 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:07:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:07:30,733 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:07:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:07:30,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:30,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:07:30,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:07:30,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:07:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:07:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:07:30,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2020-07-28 19:07:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:07:30,734 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:07:30,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-28 19:07:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:07:30,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:07:30,935 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:07:30,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:07:31,455 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:07:31,456 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:07:31,456 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:07:31,456 INFO L268 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-07-28 19:07:31,456 INFO L271 CegarLoopResult]: At program point L26(lines 26 46) the Hoare annotation is: true [2020-07-28 19:07:31,457 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2020-07-28 19:07:31,457 INFO L268 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-07-28 19:07:31,457 INFO L268 CegarLoopResult]: For program point L41(lines 41 45) no Hoare annotation was computed. [2020-07-28 19:07:31,457 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 ULTIMATE.start_main_~n~0) [2020-07-28 19:07:31,457 INFO L268 CegarLoopResult]: For program point L40-1(line 40) no Hoare annotation was computed. [2020-07-28 19:07:31,458 INFO L268 CegarLoopResult]: For program point L34(lines 34 39) no Hoare annotation was computed. [2020-07-28 19:07:31,458 INFO L268 CegarLoopResult]: For program point ackermannEXIT(lines 15 23) no Hoare annotation was computed. [2020-07-28 19:07:31,458 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= 0 |ackermann_#in~m|))) [2020-07-28 19:07:31,458 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-07-28 19:07:31,458 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-28 19:07:31,458 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= 0 |ackermann_#in~m|)) (= 0 |ackermann_#in~n|)) [2020-07-28 19:07:31,458 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 1 |ackermann_#in~m|))) (or (and (<= 3 |ackermann_#t~ret1|) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse2))) [2020-07-28 19:07:31,459 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-28 19:07:31,459 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-28 19:07:31,459 INFO L268 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-07-28 19:07:31,459 INFO L268 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-07-28 19:07:31,459 INFO L268 CegarLoopResult]: For program point ackermannFINAL(lines 15 23) no Hoare annotation was computed. [2020-07-28 19:07:31,464 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:07:31,464 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 19:07:31,464 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 19:07:31,464 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 19:07:31,465 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 19:07:31,465 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 19:07:31,465 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:07:31,465 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-28 19:07:31,465 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-28 19:07:31,465 WARN L170 areAnnotationChecker]: ackermannFINAL has no Hoare annotation [2020-07-28 19:07:31,466 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 19:07:31,466 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 19:07:31,466 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:07:31,466 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 19:07:31,467 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-28 19:07:31,467 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-28 19:07:31,467 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-28 19:07:31,467 WARN L170 areAnnotationChecker]: ackermannEXIT has no Hoare annotation [2020-07-28 19:07:31,468 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-28 19:07:31,468 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 19:07:31,468 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-28 19:07:31,468 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-28 19:07:31,468 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 19:07:31,469 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 19:07:31,469 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 19:07:31,469 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 19:07:31,469 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 19:07:31,470 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 19:07:31,470 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 19:07:31,470 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:07:31,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:07:31 BoogieIcfgContainer [2020-07-28 19:07:31,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:07:31,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:07:31,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:07:31,479 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:07:31,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:07:14" (3/4) ... [2020-07-28 19:07:31,483 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:07:31,492 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2020-07-28 19:07:31,500 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:07:31,501 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 19:07:31,569 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:07:31,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:07:31,573 INFO L168 Benchmark]: Toolchain (without parser) took 18259.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 365.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 225.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,574 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:07:31,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,574 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,575 INFO L168 Benchmark]: Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,575 INFO L168 Benchmark]: RCFGBuilder took 339.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,576 INFO L168 Benchmark]: TraceAbstraction took 17399.67 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.7 MB). Peak memory consumption was 222.9 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,576 INFO L168 Benchmark]: Witness Printer took 91.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2020-07-28 19:07:31,578 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.46 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 339.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17399.67 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -27.7 MB). Peak memory consumption was 222.9 MB. Max. memory is 11.5 GB. * Witness Printer took 91.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.7s, OverallIterations: 8, TraceHistogramMax: 10, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 144 SDtfs, 199 SDslu, 569 SDs, 0 SdLazy, 1544 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 48 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 110 PreInvPairs, 136 NumberOfFragments, 60 HoareAnnotationTreeSize, 110 FomulaSimplifications, 7029 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 174 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 549 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 535 ConstructedInterpolants, 0 QuantifiedInterpolants, 45719 SizeOfPredicates, 19 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 776/948 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...