/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 04:39:57,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 04:39:57,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 04:39:57,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 04:39:57,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 04:39:57,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 04:39:57,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 04:39:57,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 04:39:57,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 04:39:57,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 04:39:57,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 04:39:57,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 04:39:57,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 04:39:57,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 04:39:57,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 04:39:57,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 04:39:57,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 04:39:57,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 04:39:57,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 04:39:57,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 04:39:57,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 04:39:57,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 04:39:57,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 04:39:57,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 04:39:57,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 04:39:57,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 04:39:57,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 04:39:57,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 04:39:57,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 04:39:57,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 04:39:57,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 04:39:57,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 04:39:57,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 04:39:57,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 04:39:57,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 04:39:57,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 04:39:57,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 04:39:57,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 04:39:57,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 04:39:57,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 04:39:57,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 04:39:57,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 04:39:57,673 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 04:39:57,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 04:39:57,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 04:39:57,675 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 04:39:57,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 04:39:57,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 04:39:57,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 04:39:57,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 04:39:57,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 04:39:57,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 04:39:57,677 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 04:39:57,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 04:39:57,677 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 04:39:57,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 04:39:57,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 04:39:57,681 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 04:39:57,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 04:39:57,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 04:39:57,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 04:39:57,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 04:39:57,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 04:39:57,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 04:39:57,685 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 04:39:57,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 04:39:57,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 04:39:57,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 04:39:57,949 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 04:39:57,949 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 04:39:57,950 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-18 04:39:58,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d25e631/007b7ab99ef64588b6372c11ebd20aef/FLAG87d0ca8b2 [2020-07-18 04:39:58,438 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 04:39:58,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-07-18 04:39:58,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d25e631/007b7ab99ef64588b6372c11ebd20aef/FLAG87d0ca8b2 [2020-07-18 04:39:58,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3d25e631/007b7ab99ef64588b6372c11ebd20aef [2020-07-18 04:39:58,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 04:39:58,848 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 04:39:58,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 04:39:58,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 04:39:58,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 04:39:58,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:39:58" (1/1) ... [2020-07-18 04:39:58,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c49794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:58, skipping insertion in model container [2020-07-18 04:39:58,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:39:58" (1/1) ... [2020-07-18 04:39:58,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 04:39:58,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 04:39:59,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:39:59,040 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 04:39:59,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 04:39:59,073 INFO L208 MainTranslator]: Completed translation [2020-07-18 04:39:59,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59 WrapperNode [2020-07-18 04:39:59,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 04:39:59,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 04:39:59,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 04:39:59,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 04:39:59,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... [2020-07-18 04:39:59,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 04:39:59,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 04:39:59,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 04:39:59,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 04:39:59,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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-18 04:39:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 04:39:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 04:39:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-07-18 04:39:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 04:39:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 04:39:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 04:39:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-07-18 04:39:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 04:39:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 04:39:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 04:39:59,628 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 04:39:59,628 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 04:39:59,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:39:59 BoogieIcfgContainer [2020-07-18 04:39:59,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 04:39:59,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 04:39:59,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 04:39:59,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 04:39:59,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:39:58" (1/3) ... [2020-07-18 04:39:59,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:39:59, skipping insertion in model container [2020-07-18 04:39:59,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:39:59" (2/3) ... [2020-07-18 04:39:59,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:39:59, skipping insertion in model container [2020-07-18 04:39:59,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:39:59" (3/3) ... [2020-07-18 04:39:59,640 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-07-18 04:39:59,651 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 04:39:59,658 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 04:39:59,671 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 04:39:59,689 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 04:39:59,690 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 04:39:59,690 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 04:39:59,690 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 04:39:59,690 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 04:39:59,690 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 04:39:59,690 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 04:39:59,691 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 04:39:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-18 04:39:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 04:39:59,717 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:39:59,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:39:59,719 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:39:59,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:39:59,725 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-07-18 04:39:59,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:39:59,733 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660555436] [2020-07-18 04:39:59,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:39:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:39:59,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-18 04:39:59,949 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-18 04:39:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:00,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} ~m := #in~m; {47#true} is VALID [2020-07-18 04:40:00,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} ~n := #in~n; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:00,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:00,037 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:00,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:00,041 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {51#(<= 0 main_~n~0)} #67#return; {58#(<= 1 |main_#t~ret5|)} is VALID [2020-07-18 04:40:00,042 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-18 04:40:00,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-18 04:40:00,043 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #57#return; {47#true} is VALID [2020-07-18 04:40:00,043 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret6 := main(); {47#true} is VALID [2020-07-18 04:40:00,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {47#true} is VALID [2020-07-18 04:40:00,044 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~m~0 := #t~nondet3; {47#true} is VALID [2020-07-18 04:40:00,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} havoc #t~nondet3; {47#true} is VALID [2020-07-18 04:40:00,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume !(~m~0 < 0 || ~m~0 > 3); {47#true} is VALID [2020-07-18 04:40:00,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {47#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {47#true} is VALID [2020-07-18 04:40:00,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#true} ~n~0 := #t~nondet4; {47#true} is VALID [2020-07-18 04:40:00,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {47#true} havoc #t~nondet4; {47#true} is VALID [2020-07-18 04:40:00,048 INFO L280 TraceCheckUtils]: 11: Hoare triple {47#true} assume !(~n~0 < 0 || ~n~0 > 23); {51#(<= 0 main_~n~0)} is VALID [2020-07-18 04:40:00,049 INFO L263 TraceCheckUtils]: 12: Hoare triple {51#(<= 0 main_~n~0)} call #t~ret5 := ackermann(~m~0, ~n~0); {47#true} is VALID [2020-07-18 04:40:00,049 INFO L280 TraceCheckUtils]: 13: Hoare triple {47#true} ~m := #in~m; {47#true} is VALID [2020-07-18 04:40:00,050 INFO L280 TraceCheckUtils]: 14: Hoare triple {47#true} ~n := #in~n; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:00,052 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {60#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:00,054 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:00,055 INFO L280 TraceCheckUtils]: 17: Hoare triple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:00,058 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {61#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {51#(<= 0 main_~n~0)} #67#return; {58#(<= 1 |main_#t~ret5|)} is VALID [2020-07-18 04:40:00,059 INFO L280 TraceCheckUtils]: 19: Hoare triple {58#(<= 1 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {58#(<= 1 |main_#t~ret5|)} is VALID [2020-07-18 04:40:00,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {58#(<= 1 |main_#t~ret5|)} ~result~0 := #t~ret5; {59#(<= 1 main_~result~0)} is VALID [2020-07-18 04:40:00,063 INFO L280 TraceCheckUtils]: 21: Hoare triple {59#(<= 1 main_~result~0)} havoc #t~ret5; {59#(<= 1 main_~result~0)} is VALID [2020-07-18 04:40:00,065 INFO L280 TraceCheckUtils]: 22: Hoare triple {59#(<= 1 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {48#false} is VALID [2020-07-18 04:40:00,065 INFO L280 TraceCheckUtils]: 23: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-18 04:40:00,069 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-18 04:40:00,070 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660555436] [2020-07-18 04:40:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:40:00,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 04:40:00,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393230782] [2020-07-18 04:40:00,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-18 04:40:00,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:00,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:40:00,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:00,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:40:00,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:40:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:40:00,139 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2020-07-18 04:40:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:00,775 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-07-18 04:40:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 04:40:00,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-18 04:40:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2020-07-18 04:40:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2020-07-18 04:40:00,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 71 transitions. [2020-07-18 04:40:00,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:00,900 INFO L225 Difference]: With dead ends: 61 [2020-07-18 04:40:00,900 INFO L226 Difference]: Without dead ends: 39 [2020-07-18 04:40:00,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-18 04:40:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-18 04:40:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-18 04:40:00,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:00,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2020-07-18 04:40:00,979 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-18 04:40:00,980 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-18 04:40:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:00,988 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-18 04:40:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-18 04:40:00,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:00,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:00,990 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2020-07-18 04:40:00,990 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2020-07-18 04:40:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:00,997 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2020-07-18 04:40:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-18 04:40:00,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:00,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:00,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:00,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-18 04:40:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-07-18 04:40:01,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2020-07-18 04:40:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:01,007 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-07-18 04:40:01,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:40:01,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2020-07-18 04:40:01,071 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-18 04:40:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-07-18 04:40:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 04:40:01,073 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:01,073 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:01,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 04:40:01,074 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-07-18 04:40:01,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:01,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1683227046] [2020-07-18 04:40:01,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:01,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-18 04:40:01,136 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {350#true} {350#true} #57#return; {350#true} is VALID [2020-07-18 04:40:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:01,247 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-18 04:40:01,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} ~n := #in~n; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:01,249 INFO L280 TraceCheckUtils]: 2: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:01,250 INFO L280 TraceCheckUtils]: 3: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:01,251 INFO L280 TraceCheckUtils]: 4: Hoare triple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:01,253 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {350#true} #61#return; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:01,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-18 04:40:01,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} ~n := #in~n; {350#true} is VALID [2020-07-18 04:40:01,254 INFO L280 TraceCheckUtils]: 2: Hoare triple {350#true} assume !(0 == ~m); {350#true} is VALID [2020-07-18 04:40:01,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {350#true} assume 0 == ~n; {350#true} is VALID [2020-07-18 04:40:01,255 INFO L263 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret0 := ackermann(~m - 1, 1); {350#true} is VALID [2020-07-18 04:40:01,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-18 04:40:01,256 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#true} ~n := #in~n; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:01,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:01,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:01,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:01,260 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {350#true} #61#return; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:01,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:01,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:01,263 INFO L280 TraceCheckUtils]: 13: Hoare triple {379#(<= 2 |ackermann_#res|)} havoc #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:01,264 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#(<= 2 |ackermann_#res|)} assume true; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:01,266 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#(<= 2 |ackermann_#res|)} {350#true} #67#return; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-18 04:40:01,268 INFO L263 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2020-07-18 04:40:01,268 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-18 04:40:01,268 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #57#return; {350#true} is VALID [2020-07-18 04:40:01,269 INFO L263 TraceCheckUtils]: 3: Hoare triple {350#true} call #t~ret6 := main(); {350#true} is VALID [2020-07-18 04:40:01,269 INFO L280 TraceCheckUtils]: 4: Hoare triple {350#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {350#true} is VALID [2020-07-18 04:40:01,269 INFO L280 TraceCheckUtils]: 5: Hoare triple {350#true} ~m~0 := #t~nondet3; {350#true} is VALID [2020-07-18 04:40:01,270 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#true} havoc #t~nondet3; {350#true} is VALID [2020-07-18 04:40:01,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {350#true} assume !(~m~0 < 0 || ~m~0 > 3); {350#true} is VALID [2020-07-18 04:40:01,270 INFO L280 TraceCheckUtils]: 8: Hoare triple {350#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {350#true} is VALID [2020-07-18 04:40:01,271 INFO L280 TraceCheckUtils]: 9: Hoare triple {350#true} ~n~0 := #t~nondet4; {350#true} is VALID [2020-07-18 04:40:01,271 INFO L280 TraceCheckUtils]: 10: Hoare triple {350#true} havoc #t~nondet4; {350#true} is VALID [2020-07-18 04:40:01,271 INFO L280 TraceCheckUtils]: 11: Hoare triple {350#true} assume !(~n~0 < 0 || ~n~0 > 23); {350#true} is VALID [2020-07-18 04:40:01,272 INFO L263 TraceCheckUtils]: 12: Hoare triple {350#true} call #t~ret5 := ackermann(~m~0, ~n~0); {350#true} is VALID [2020-07-18 04:40:01,272 INFO L280 TraceCheckUtils]: 13: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-18 04:40:01,272 INFO L280 TraceCheckUtils]: 14: Hoare triple {350#true} ~n := #in~n; {350#true} is VALID [2020-07-18 04:40:01,273 INFO L280 TraceCheckUtils]: 15: Hoare triple {350#true} assume !(0 == ~m); {350#true} is VALID [2020-07-18 04:40:01,273 INFO L280 TraceCheckUtils]: 16: Hoare triple {350#true} assume 0 == ~n; {350#true} is VALID [2020-07-18 04:40:01,273 INFO L263 TraceCheckUtils]: 17: Hoare triple {350#true} call #t~ret0 := ackermann(~m - 1, 1); {350#true} is VALID [2020-07-18 04:40:01,274 INFO L280 TraceCheckUtils]: 18: Hoare triple {350#true} ~m := #in~m; {350#true} is VALID [2020-07-18 04:40:01,275 INFO L280 TraceCheckUtils]: 19: Hoare triple {350#true} ~n := #in~n; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:01,276 INFO L280 TraceCheckUtils]: 20: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:01,277 INFO L280 TraceCheckUtils]: 21: Hoare triple {380#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:01,278 INFO L280 TraceCheckUtils]: 22: Hoare triple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:01,279 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {381#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {350#true} #61#return; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:01,280 INFO L280 TraceCheckUtils]: 24: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {378#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:01,281 INFO L280 TraceCheckUtils]: 25: Hoare triple {378#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:01,281 INFO L280 TraceCheckUtils]: 26: Hoare triple {379#(<= 2 |ackermann_#res|)} havoc #t~ret0; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:01,282 INFO L280 TraceCheckUtils]: 27: Hoare triple {379#(<= 2 |ackermann_#res|)} assume true; {379#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:01,283 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {379#(<= 2 |ackermann_#res|)} {350#true} #67#return; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-18 04:40:01,284 INFO L280 TraceCheckUtils]: 29: Hoare triple {370#(<= 2 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {370#(<= 2 |main_#t~ret5|)} is VALID [2020-07-18 04:40:01,285 INFO L280 TraceCheckUtils]: 30: Hoare triple {370#(<= 2 |main_#t~ret5|)} ~result~0 := #t~ret5; {371#(<= 2 main_~result~0)} is VALID [2020-07-18 04:40:01,286 INFO L280 TraceCheckUtils]: 31: Hoare triple {371#(<= 2 main_~result~0)} havoc #t~ret5; {371#(<= 2 main_~result~0)} is VALID [2020-07-18 04:40:01,287 INFO L280 TraceCheckUtils]: 32: Hoare triple {371#(<= 2 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {351#false} is VALID [2020-07-18 04:40:01,287 INFO L280 TraceCheckUtils]: 33: Hoare triple {351#false} assume !false; {351#false} is VALID [2020-07-18 04:40:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 04:40:01,291 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1683227046] [2020-07-18 04:40:01,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 04:40:01,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 04:40:01,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373578465] [2020-07-18 04:40:01,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-18 04:40:01,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:01,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 04:40:01,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:01,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 04:40:01,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:01,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 04:40:01,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 04:40:01,348 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2020-07-18 04:40:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:01,964 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-07-18 04:40:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 04:40:01,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-07-18 04:40:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:40:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2020-07-18 04:40:01,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 04:40:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2020-07-18 04:40:01,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2020-07-18 04:40:02,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:02,070 INFO L225 Difference]: With dead ends: 50 [2020-07-18 04:40:02,070 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 04:40:02,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-07-18 04:40:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 04:40:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-18 04:40:02,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:02,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-18 04:40:02,150 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-18 04:40:02,150 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-18 04:40:02,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:02,155 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-18 04:40:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-18 04:40:02,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:02,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:02,157 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-18 04:40:02,157 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-18 04:40:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:02,162 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2020-07-18 04:40:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2020-07-18 04:40:02,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:02,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:02,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:02,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-18 04:40:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-07-18 04:40:02,167 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2020-07-18 04:40:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:02,168 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-07-18 04:40:02,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 04:40:02,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 48 transitions. [2020-07-18 04:40:02,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-07-18 04:40:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 04:40:02,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:02,229 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:02,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 04:40:02,230 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:02,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2094172607, now seen corresponding path program 1 times [2020-07-18 04:40:02,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:02,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1413376656] [2020-07-18 04:40:02,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:02,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-18 04:40:02,286 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {667#true} {667#true} #57#return; {667#true} is VALID [2020-07-18 04:40:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:02,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,364 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-18 04:40:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:02,382 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-18 04:40:02,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-18 04:40:02,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-18 04:40:02,383 INFO L280 TraceCheckUtils]: 3: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-18 04:40:02,383 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-18 04:40:02,384 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-18 04:40:02,387 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-18 04:40:02,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-18 04:40:02,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#true} assume !(0 == ~m); {696#(not (= ackermann_~m 0))} is VALID [2020-07-18 04:40:02,391 INFO L280 TraceCheckUtils]: 3: Hoare triple {696#(not (= ackermann_~m 0))} assume !(0 == ~n); {696#(not (= ackermann_~m 0))} is VALID [2020-07-18 04:40:02,392 INFO L263 TraceCheckUtils]: 4: Hoare triple {696#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {667#true} is VALID [2020-07-18 04:40:02,392 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,393 INFO L280 TraceCheckUtils]: 6: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,396 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-18 04:40:02,396 INFO L280 TraceCheckUtils]: 11: Hoare triple {668#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {668#false} is VALID [2020-07-18 04:40:02,397 INFO L263 TraceCheckUtils]: 12: Hoare triple {668#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {667#true} is VALID [2020-07-18 04:40:02,397 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-18 04:40:02,397 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-18 04:40:02,397 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-18 04:40:02,398 INFO L280 TraceCheckUtils]: 16: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-18 04:40:02,398 INFO L280 TraceCheckUtils]: 17: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-18 04:40:02,398 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-18 04:40:02,398 INFO L280 TraceCheckUtils]: 19: Hoare triple {668#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {668#false} is VALID [2020-07-18 04:40:02,399 INFO L280 TraceCheckUtils]: 20: Hoare triple {668#false} #res := #t~ret2; {668#false} is VALID [2020-07-18 04:40:02,399 INFO L280 TraceCheckUtils]: 21: Hoare triple {668#false} havoc #t~ret1; {668#false} is VALID [2020-07-18 04:40:02,401 INFO L280 TraceCheckUtils]: 22: Hoare triple {668#false} havoc #t~ret2; {668#false} is VALID [2020-07-18 04:40:02,401 INFO L280 TraceCheckUtils]: 23: Hoare triple {668#false} assume true; {668#false} is VALID [2020-07-18 04:40:02,401 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {668#false} {667#true} #67#return; {668#false} is VALID [2020-07-18 04:40:02,409 INFO L263 TraceCheckUtils]: 0: Hoare triple {667#true} call ULTIMATE.init(); {667#true} is VALID [2020-07-18 04:40:02,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-18 04:40:02,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {667#true} {667#true} #57#return; {667#true} is VALID [2020-07-18 04:40:02,410 INFO L263 TraceCheckUtils]: 3: Hoare triple {667#true} call #t~ret6 := main(); {667#true} is VALID [2020-07-18 04:40:02,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {667#true} is VALID [2020-07-18 04:40:02,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#true} ~m~0 := #t~nondet3; {667#true} is VALID [2020-07-18 04:40:02,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {667#true} havoc #t~nondet3; {667#true} is VALID [2020-07-18 04:40:02,411 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#true} assume !(~m~0 < 0 || ~m~0 > 3); {667#true} is VALID [2020-07-18 04:40:02,411 INFO L280 TraceCheckUtils]: 8: Hoare triple {667#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {667#true} is VALID [2020-07-18 04:40:02,411 INFO L280 TraceCheckUtils]: 9: Hoare triple {667#true} ~n~0 := #t~nondet4; {667#true} is VALID [2020-07-18 04:40:02,412 INFO L280 TraceCheckUtils]: 10: Hoare triple {667#true} havoc #t~nondet4; {667#true} is VALID [2020-07-18 04:40:02,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {667#true} assume !(~n~0 < 0 || ~n~0 > 23); {667#true} is VALID [2020-07-18 04:40:02,412 INFO L263 TraceCheckUtils]: 12: Hoare triple {667#true} call #t~ret5 := ackermann(~m~0, ~n~0); {667#true} is VALID [2020-07-18 04:40:02,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-18 04:40:02,413 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-18 04:40:02,413 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#true} assume !(0 == ~m); {696#(not (= ackermann_~m 0))} is VALID [2020-07-18 04:40:02,419 INFO L280 TraceCheckUtils]: 16: Hoare triple {696#(not (= ackermann_~m 0))} assume !(0 == ~n); {696#(not (= ackermann_~m 0))} is VALID [2020-07-18 04:40:02,420 INFO L263 TraceCheckUtils]: 17: Hoare triple {696#(not (= ackermann_~m 0))} call #t~ret1 := ackermann(~m, ~n - 1); {667#true} is VALID [2020-07-18 04:40:02,423 INFO L280 TraceCheckUtils]: 18: Hoare triple {667#true} ~m := #in~m; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,424 INFO L280 TraceCheckUtils]: 19: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {709#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,425 INFO L280 TraceCheckUtils]: 20: Hoare triple {709#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,425 INFO L280 TraceCheckUtils]: 21: Hoare triple {710#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,426 INFO L280 TraceCheckUtils]: 22: Hoare triple {710#(= 0 |ackermann_#in~m|)} assume true; {710#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:02,428 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {710#(= 0 |ackermann_#in~m|)} {696#(not (= ackermann_~m 0))} #63#return; {668#false} is VALID [2020-07-18 04:40:02,429 INFO L280 TraceCheckUtils]: 24: Hoare triple {668#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {668#false} is VALID [2020-07-18 04:40:02,429 INFO L263 TraceCheckUtils]: 25: Hoare triple {668#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {667#true} is VALID [2020-07-18 04:40:02,429 INFO L280 TraceCheckUtils]: 26: Hoare triple {667#true} ~m := #in~m; {667#true} is VALID [2020-07-18 04:40:02,429 INFO L280 TraceCheckUtils]: 27: Hoare triple {667#true} ~n := #in~n; {667#true} is VALID [2020-07-18 04:40:02,430 INFO L280 TraceCheckUtils]: 28: Hoare triple {667#true} assume 0 == ~m; {667#true} is VALID [2020-07-18 04:40:02,430 INFO L280 TraceCheckUtils]: 29: Hoare triple {667#true} #res := 1 + ~n; {667#true} is VALID [2020-07-18 04:40:02,430 INFO L280 TraceCheckUtils]: 30: Hoare triple {667#true} assume true; {667#true} is VALID [2020-07-18 04:40:02,430 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {667#true} {668#false} #65#return; {668#false} is VALID [2020-07-18 04:40:02,430 INFO L280 TraceCheckUtils]: 32: Hoare triple {668#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {668#false} is VALID [2020-07-18 04:40:02,431 INFO L280 TraceCheckUtils]: 33: Hoare triple {668#false} #res := #t~ret2; {668#false} is VALID [2020-07-18 04:40:02,431 INFO L280 TraceCheckUtils]: 34: Hoare triple {668#false} havoc #t~ret1; {668#false} is VALID [2020-07-18 04:40:02,431 INFO L280 TraceCheckUtils]: 35: Hoare triple {668#false} havoc #t~ret2; {668#false} is VALID [2020-07-18 04:40:02,431 INFO L280 TraceCheckUtils]: 36: Hoare triple {668#false} assume true; {668#false} is VALID [2020-07-18 04:40:02,432 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {668#false} {667#true} #67#return; {668#false} is VALID [2020-07-18 04:40:02,432 INFO L280 TraceCheckUtils]: 38: Hoare triple {668#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {668#false} is VALID [2020-07-18 04:40:02,433 INFO L280 TraceCheckUtils]: 39: Hoare triple {668#false} ~result~0 := #t~ret5; {668#false} is VALID [2020-07-18 04:40:02,433 INFO L280 TraceCheckUtils]: 40: Hoare triple {668#false} havoc #t~ret5; {668#false} is VALID [2020-07-18 04:40:02,433 INFO L280 TraceCheckUtils]: 41: Hoare triple {668#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {668#false} is VALID [2020-07-18 04:40:02,433 INFO L280 TraceCheckUtils]: 42: Hoare triple {668#false} assume !false; {668#false} is VALID [2020-07-18 04:40:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-18 04:40:02,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1413376656] [2020-07-18 04:40:02,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:02,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-18 04:40:02,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632055155] [2020-07-18 04:40:02,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-18 04:40:02,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:02,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 04:40:02,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:02,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 04:40:02,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:02,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 04:40:02,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:40:02,485 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2020-07-18 04:40:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:02,813 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-07-18 04:40:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 04:40:02,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-07-18 04:40:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:40:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-18 04:40:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 04:40:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-18 04:40:02,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2020-07-18 04:40:02,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:02,911 INFO L225 Difference]: With dead ends: 73 [2020-07-18 04:40:02,911 INFO L226 Difference]: Without dead ends: 44 [2020-07-18 04:40:02,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:40:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-18 04:40:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-18 04:40:02,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:02,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-18 04:40:02,992 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-18 04:40:02,992 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-18 04:40:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:02,997 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-18 04:40:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-18 04:40:02,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:02,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:02,998 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-18 04:40:02,998 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-18 04:40:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:03,002 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-18 04:40:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-18 04:40:03,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:03,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:03,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:03,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-18 04:40:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-07-18 04:40:03,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-07-18 04:40:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:03,007 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-07-18 04:40:03,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 04:40:03,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2020-07-18 04:40:03,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-18 04:40:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 04:40:03,089 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:03,090 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:03,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 04:40:03,090 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:03,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-07-18 04:40:03,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:03,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2026148262] [2020-07-18 04:40:03,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:03,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} assume true; {1040#true} is VALID [2020-07-18 04:40:03,151 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1040#true} {1040#true} #57#return; {1040#true} is VALID [2020-07-18 04:40:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:03,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,342 INFO L280 TraceCheckUtils]: 2: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,343 INFO L280 TraceCheckUtils]: 3: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,344 INFO L280 TraceCheckUtils]: 4: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,345 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-18 04:40:03,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-18 04:40:03,346 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-18 04:40:03,347 INFO L263 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-18 04:40:03,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,348 INFO L280 TraceCheckUtils]: 7: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,351 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,351 INFO L280 TraceCheckUtils]: 11: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,354 INFO L280 TraceCheckUtils]: 13: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,358 INFO L280 TraceCheckUtils]: 14: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,361 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:03,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:03,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:03,403 INFO L280 TraceCheckUtils]: 3: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:03,403 INFO L280 TraceCheckUtils]: 4: Hoare triple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:03,404 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1097#(<= 2 |ackermann_#t~ret1|)} #65#return; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:03,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-18 04:40:03,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-18 04:40:03,406 INFO L280 TraceCheckUtils]: 3: Hoare triple {1040#true} assume !(0 == ~n); {1040#true} is VALID [2020-07-18 04:40:03,406 INFO L263 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret1 := ackermann(~m, ~n - 1); {1040#true} is VALID [2020-07-18 04:40:03,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,406 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-18 04:40:03,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-18 04:40:03,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-18 04:40:03,407 INFO L263 TraceCheckUtils]: 9: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-18 04:40:03,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,409 INFO L280 TraceCheckUtils]: 12: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,410 INFO L280 TraceCheckUtils]: 14: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,411 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,412 INFO L280 TraceCheckUtils]: 16: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,412 INFO L280 TraceCheckUtils]: 17: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,413 INFO L280 TraceCheckUtils]: 18: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,413 INFO L280 TraceCheckUtils]: 19: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,414 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:03,414 INFO L280 TraceCheckUtils]: 21: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:03,414 INFO L263 TraceCheckUtils]: 22: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1040#true} is VALID [2020-07-18 04:40:03,415 INFO L280 TraceCheckUtils]: 23: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,415 INFO L280 TraceCheckUtils]: 24: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:03,415 INFO L280 TraceCheckUtils]: 25: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:03,416 INFO L280 TraceCheckUtils]: 26: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:03,416 INFO L280 TraceCheckUtils]: 27: Hoare triple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:03,418 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1097#(<= 2 |ackermann_#t~ret1|)} #65#return; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:03,420 INFO L280 TraceCheckUtils]: 29: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:03,421 INFO L280 TraceCheckUtils]: 30: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,421 INFO L280 TraceCheckUtils]: 31: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret1; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,421 INFO L280 TraceCheckUtils]: 32: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,422 INFO L280 TraceCheckUtils]: 33: Hoare triple {1105#(<= 3 |ackermann_#res|)} assume true; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,426 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1105#(<= 3 |ackermann_#res|)} {1040#true} #67#return; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-18 04:40:03,428 INFO L263 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1040#true} is VALID [2020-07-18 04:40:03,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#true} assume true; {1040#true} is VALID [2020-07-18 04:40:03,429 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1040#true} {1040#true} #57#return; {1040#true} is VALID [2020-07-18 04:40:03,429 INFO L263 TraceCheckUtils]: 3: Hoare triple {1040#true} call #t~ret6 := main(); {1040#true} is VALID [2020-07-18 04:40:03,429 INFO L280 TraceCheckUtils]: 4: Hoare triple {1040#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1040#true} is VALID [2020-07-18 04:40:03,430 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#true} ~m~0 := #t~nondet3; {1040#true} is VALID [2020-07-18 04:40:03,430 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#true} havoc #t~nondet3; {1040#true} is VALID [2020-07-18 04:40:03,430 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#true} assume !(~m~0 < 0 || ~m~0 > 3); {1040#true} is VALID [2020-07-18 04:40:03,430 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1040#true} is VALID [2020-07-18 04:40:03,430 INFO L280 TraceCheckUtils]: 9: Hoare triple {1040#true} ~n~0 := #t~nondet4; {1040#true} is VALID [2020-07-18 04:40:03,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#true} havoc #t~nondet4; {1040#true} is VALID [2020-07-18 04:40:03,431 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#true} assume !(~n~0 < 0 || ~n~0 > 23); {1040#true} is VALID [2020-07-18 04:40:03,431 INFO L263 TraceCheckUtils]: 12: Hoare triple {1040#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1040#true} is VALID [2020-07-18 04:40:03,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,432 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-18 04:40:03,432 INFO L280 TraceCheckUtils]: 15: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-18 04:40:03,432 INFO L280 TraceCheckUtils]: 16: Hoare triple {1040#true} assume !(0 == ~n); {1040#true} is VALID [2020-07-18 04:40:03,432 INFO L263 TraceCheckUtils]: 17: Hoare triple {1040#true} call #t~ret1 := ackermann(~m, ~n - 1); {1040#true} is VALID [2020-07-18 04:40:03,433 INFO L280 TraceCheckUtils]: 18: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,433 INFO L280 TraceCheckUtils]: 19: Hoare triple {1040#true} ~n := #in~n; {1040#true} is VALID [2020-07-18 04:40:03,433 INFO L280 TraceCheckUtils]: 20: Hoare triple {1040#true} assume !(0 == ~m); {1040#true} is VALID [2020-07-18 04:40:03,433 INFO L280 TraceCheckUtils]: 21: Hoare triple {1040#true} assume 0 == ~n; {1040#true} is VALID [2020-07-18 04:40:03,434 INFO L263 TraceCheckUtils]: 22: Hoare triple {1040#true} call #t~ret0 := ackermann(~m - 1, 1); {1040#true} is VALID [2020-07-18 04:40:03,434 INFO L280 TraceCheckUtils]: 23: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,435 INFO L280 TraceCheckUtils]: 24: Hoare triple {1040#true} ~n := #in~n; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,435 INFO L280 TraceCheckUtils]: 25: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:03,439 INFO L280 TraceCheckUtils]: 26: Hoare triple {1114#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,439 INFO L280 TraceCheckUtils]: 27: Hoare triple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:03,440 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1115#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {1040#true} #61#return; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,441 INFO L280 TraceCheckUtils]: 29: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1112#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:03,442 INFO L280 TraceCheckUtils]: 30: Hoare triple {1112#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,442 INFO L280 TraceCheckUtils]: 31: Hoare triple {1113#(<= 2 |ackermann_#res|)} havoc #t~ret0; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,443 INFO L280 TraceCheckUtils]: 32: Hoare triple {1113#(<= 2 |ackermann_#res|)} assume true; {1113#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,444 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1113#(<= 2 |ackermann_#res|)} {1040#true} #63#return; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:03,444 INFO L280 TraceCheckUtils]: 34: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1097#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:03,445 INFO L263 TraceCheckUtils]: 35: Hoare triple {1097#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1040#true} is VALID [2020-07-18 04:40:03,445 INFO L280 TraceCheckUtils]: 36: Hoare triple {1040#true} ~m := #in~m; {1040#true} is VALID [2020-07-18 04:40:03,446 INFO L280 TraceCheckUtils]: 37: Hoare triple {1040#true} ~n := #in~n; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:03,446 INFO L280 TraceCheckUtils]: 38: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {1116#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:03,447 INFO L280 TraceCheckUtils]: 39: Hoare triple {1116#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:03,447 INFO L280 TraceCheckUtils]: 40: Hoare triple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:03,449 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1117#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {1097#(<= 2 |ackermann_#t~ret1|)} #65#return; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:03,449 INFO L280 TraceCheckUtils]: 42: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1104#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:03,450 INFO L280 TraceCheckUtils]: 43: Hoare triple {1104#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,451 INFO L280 TraceCheckUtils]: 44: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret1; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,451 INFO L280 TraceCheckUtils]: 45: Hoare triple {1105#(<= 3 |ackermann_#res|)} havoc #t~ret2; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,452 INFO L280 TraceCheckUtils]: 46: Hoare triple {1105#(<= 3 |ackermann_#res|)} assume true; {1105#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:03,453 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {1105#(<= 3 |ackermann_#res|)} {1040#true} #67#return; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-18 04:40:03,453 INFO L280 TraceCheckUtils]: 48: Hoare triple {1079#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1079#(<= 3 |main_#t~ret5|)} is VALID [2020-07-18 04:40:03,454 INFO L280 TraceCheckUtils]: 49: Hoare triple {1079#(<= 3 |main_#t~ret5|)} ~result~0 := #t~ret5; {1080#(<= 3 main_~result~0)} is VALID [2020-07-18 04:40:03,455 INFO L280 TraceCheckUtils]: 50: Hoare triple {1080#(<= 3 main_~result~0)} havoc #t~ret5; {1080#(<= 3 main_~result~0)} is VALID [2020-07-18 04:40:03,455 INFO L280 TraceCheckUtils]: 51: Hoare triple {1080#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1041#false} is VALID [2020-07-18 04:40:03,456 INFO L280 TraceCheckUtils]: 52: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2020-07-18 04:40:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-18 04:40:03,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2026148262] [2020-07-18 04:40:03,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:03,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 04:40:03,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585113516] [2020-07-18 04:40:03,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-07-18 04:40:03,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:03,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 04:40:03,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:03,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 04:40:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 04:40:03,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-18 04:40:03,510 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2020-07-18 04:40:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:05,667 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2020-07-18 04:40:05,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 04:40:05,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-07-18 04:40:05,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 04:40:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2020-07-18 04:40:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 04:40:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 109 transitions. [2020-07-18 04:40:05,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 109 transitions. [2020-07-18 04:40:05,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:05,823 INFO L225 Difference]: With dead ends: 87 [2020-07-18 04:40:05,824 INFO L226 Difference]: Without dead ends: 81 [2020-07-18 04:40:05,825 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2020-07-18 04:40:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-18 04:40:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2020-07-18 04:40:05,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:05,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 57 states. [2020-07-18 04:40:05,941 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 57 states. [2020-07-18 04:40:05,941 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 57 states. [2020-07-18 04:40:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:05,948 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2020-07-18 04:40:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2020-07-18 04:40:05,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:05,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:05,950 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 81 states. [2020-07-18 04:40:05,951 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 81 states. [2020-07-18 04:40:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:05,958 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2020-07-18 04:40:05,958 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2020-07-18 04:40:05,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:05,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:05,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:05,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:05,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-18 04:40:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2020-07-18 04:40:05,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 53 [2020-07-18 04:40:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:05,964 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2020-07-18 04:40:05,964 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 04:40:05,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 74 transitions. [2020-07-18 04:40:06,101 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-18 04:40:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-07-18 04:40:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 04:40:06,103 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:06,103 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:06,104 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 04:40:06,104 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 358541405, now seen corresponding path program 2 times [2020-07-18 04:40:06,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:06,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2003453206] [2020-07-18 04:40:06,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} assume true; {1601#true} is VALID [2020-07-18 04:40:06,156 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1601#true} {1601#true} #57#return; {1601#true} is VALID [2020-07-18 04:40:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,234 INFO L280 TraceCheckUtils]: 3: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,235 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,238 INFO L263 TraceCheckUtils]: 4: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-18 04:40:06,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,240 INFO L280 TraceCheckUtils]: 7: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,242 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,243 INFO L280 TraceCheckUtils]: 11: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,243 INFO L280 TraceCheckUtils]: 12: Hoare triple {1690#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {1690#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,244 INFO L280 TraceCheckUtils]: 14: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume true; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,245 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1690#(<= |ackermann_#in~m| 1)} {1601#true} #63#return; {1666#(<= ackermann_~m 1)} is VALID [2020-07-18 04:40:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:06,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,278 INFO L280 TraceCheckUtils]: 4: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,279 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,282 INFO L263 TraceCheckUtils]: 4: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-18 04:40:06,282 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,286 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,288 INFO L280 TraceCheckUtils]: 14: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume true; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,289 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1698#(<= 1 |ackermann_#in~m|)} {1666#(<= ackermann_~m 1)} #65#return; {1602#false} is VALID [2020-07-18 04:40:06,290 INFO L280 TraceCheckUtils]: 0: Hoare triple {1601#true} ~m := #in~m; {1601#true} is VALID [2020-07-18 04:40:06,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {1601#true} ~n := #in~n; {1601#true} is VALID [2020-07-18 04:40:06,290 INFO L280 TraceCheckUtils]: 2: Hoare triple {1601#true} assume !(0 == ~m); {1601#true} is VALID [2020-07-18 04:40:06,290 INFO L280 TraceCheckUtils]: 3: Hoare triple {1601#true} assume !(0 == ~n); {1601#true} is VALID [2020-07-18 04:40:06,291 INFO L263 TraceCheckUtils]: 4: Hoare triple {1601#true} call #t~ret1 := ackermann(~m, ~n - 1); {1601#true} is VALID [2020-07-18 04:40:06,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,293 INFO L263 TraceCheckUtils]: 9: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-18 04:40:06,294 INFO L280 TraceCheckUtils]: 10: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,294 INFO L280 TraceCheckUtils]: 11: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,295 INFO L280 TraceCheckUtils]: 12: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,295 INFO L280 TraceCheckUtils]: 13: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,296 INFO L280 TraceCheckUtils]: 14: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,297 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,297 INFO L280 TraceCheckUtils]: 16: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,298 INFO L280 TraceCheckUtils]: 17: Hoare triple {1690#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,298 INFO L280 TraceCheckUtils]: 18: Hoare triple {1690#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,299 INFO L280 TraceCheckUtils]: 19: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume true; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,300 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1690#(<= |ackermann_#in~m| 1)} {1601#true} #63#return; {1666#(<= ackermann_~m 1)} is VALID [2020-07-18 04:40:06,301 INFO L280 TraceCheckUtils]: 21: Hoare triple {1666#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1666#(<= ackermann_~m 1)} is VALID [2020-07-18 04:40:06,301 INFO L263 TraceCheckUtils]: 22: Hoare triple {1666#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1601#true} is VALID [2020-07-18 04:40:06,301 INFO L280 TraceCheckUtils]: 23: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,302 INFO L280 TraceCheckUtils]: 24: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,302 INFO L280 TraceCheckUtils]: 25: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,303 INFO L280 TraceCheckUtils]: 26: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,303 INFO L263 TraceCheckUtils]: 27: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-18 04:40:06,304 INFO L280 TraceCheckUtils]: 28: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,304 INFO L280 TraceCheckUtils]: 29: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,305 INFO L280 TraceCheckUtils]: 30: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,305 INFO L280 TraceCheckUtils]: 31: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,306 INFO L280 TraceCheckUtils]: 32: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,307 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,307 INFO L280 TraceCheckUtils]: 34: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,308 INFO L280 TraceCheckUtils]: 35: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,308 INFO L280 TraceCheckUtils]: 36: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,309 INFO L280 TraceCheckUtils]: 37: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume true; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,310 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {1698#(<= 1 |ackermann_#in~m|)} {1666#(<= ackermann_~m 1)} #65#return; {1602#false} is VALID [2020-07-18 04:40:06,310 INFO L280 TraceCheckUtils]: 39: Hoare triple {1602#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1602#false} is VALID [2020-07-18 04:40:06,310 INFO L280 TraceCheckUtils]: 40: Hoare triple {1602#false} #res := #t~ret2; {1602#false} is VALID [2020-07-18 04:40:06,311 INFO L280 TraceCheckUtils]: 41: Hoare triple {1602#false} havoc #t~ret1; {1602#false} is VALID [2020-07-18 04:40:06,311 INFO L280 TraceCheckUtils]: 42: Hoare triple {1602#false} havoc #t~ret2; {1602#false} is VALID [2020-07-18 04:40:06,311 INFO L280 TraceCheckUtils]: 43: Hoare triple {1602#false} assume true; {1602#false} is VALID [2020-07-18 04:40:06,311 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {1602#false} {1601#true} #67#return; {1602#false} is VALID [2020-07-18 04:40:06,313 INFO L263 TraceCheckUtils]: 0: Hoare triple {1601#true} call ULTIMATE.init(); {1601#true} is VALID [2020-07-18 04:40:06,313 INFO L280 TraceCheckUtils]: 1: Hoare triple {1601#true} assume true; {1601#true} is VALID [2020-07-18 04:40:06,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1601#true} {1601#true} #57#return; {1601#true} is VALID [2020-07-18 04:40:06,314 INFO L263 TraceCheckUtils]: 3: Hoare triple {1601#true} call #t~ret6 := main(); {1601#true} is VALID [2020-07-18 04:40:06,314 INFO L280 TraceCheckUtils]: 4: Hoare triple {1601#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1601#true} is VALID [2020-07-18 04:40:06,314 INFO L280 TraceCheckUtils]: 5: Hoare triple {1601#true} ~m~0 := #t~nondet3; {1601#true} is VALID [2020-07-18 04:40:06,315 INFO L280 TraceCheckUtils]: 6: Hoare triple {1601#true} havoc #t~nondet3; {1601#true} is VALID [2020-07-18 04:40:06,315 INFO L280 TraceCheckUtils]: 7: Hoare triple {1601#true} assume !(~m~0 < 0 || ~m~0 > 3); {1601#true} is VALID [2020-07-18 04:40:06,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {1601#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1601#true} is VALID [2020-07-18 04:40:06,315 INFO L280 TraceCheckUtils]: 9: Hoare triple {1601#true} ~n~0 := #t~nondet4; {1601#true} is VALID [2020-07-18 04:40:06,315 INFO L280 TraceCheckUtils]: 10: Hoare triple {1601#true} havoc #t~nondet4; {1601#true} is VALID [2020-07-18 04:40:06,316 INFO L280 TraceCheckUtils]: 11: Hoare triple {1601#true} assume !(~n~0 < 0 || ~n~0 > 23); {1601#true} is VALID [2020-07-18 04:40:06,316 INFO L263 TraceCheckUtils]: 12: Hoare triple {1601#true} call #t~ret5 := ackermann(~m~0, ~n~0); {1601#true} is VALID [2020-07-18 04:40:06,316 INFO L280 TraceCheckUtils]: 13: Hoare triple {1601#true} ~m := #in~m; {1601#true} is VALID [2020-07-18 04:40:06,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {1601#true} ~n := #in~n; {1601#true} is VALID [2020-07-18 04:40:06,316 INFO L280 TraceCheckUtils]: 15: Hoare triple {1601#true} assume !(0 == ~m); {1601#true} is VALID [2020-07-18 04:40:06,317 INFO L280 TraceCheckUtils]: 16: Hoare triple {1601#true} assume !(0 == ~n); {1601#true} is VALID [2020-07-18 04:40:06,317 INFO L263 TraceCheckUtils]: 17: Hoare triple {1601#true} call #t~ret1 := ackermann(~m, ~n - 1); {1601#true} is VALID [2020-07-18 04:40:06,318 INFO L280 TraceCheckUtils]: 18: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,318 INFO L280 TraceCheckUtils]: 19: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,319 INFO L280 TraceCheckUtils]: 20: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,319 INFO L280 TraceCheckUtils]: 21: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,319 INFO L263 TraceCheckUtils]: 22: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-18 04:40:06,320 INFO L280 TraceCheckUtils]: 23: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,320 INFO L280 TraceCheckUtils]: 24: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,321 INFO L280 TraceCheckUtils]: 25: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,322 INFO L280 TraceCheckUtils]: 26: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,322 INFO L280 TraceCheckUtils]: 27: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,323 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,324 INFO L280 TraceCheckUtils]: 29: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,324 INFO L280 TraceCheckUtils]: 30: Hoare triple {1690#(<= |ackermann_#in~m| 1)} #res := #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,325 INFO L280 TraceCheckUtils]: 31: Hoare triple {1690#(<= |ackermann_#in~m| 1)} havoc #t~ret0; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,325 INFO L280 TraceCheckUtils]: 32: Hoare triple {1690#(<= |ackermann_#in~m| 1)} assume true; {1690#(<= |ackermann_#in~m| 1)} is VALID [2020-07-18 04:40:06,326 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1690#(<= |ackermann_#in~m| 1)} {1601#true} #63#return; {1666#(<= ackermann_~m 1)} is VALID [2020-07-18 04:40:06,327 INFO L280 TraceCheckUtils]: 34: Hoare triple {1666#(<= ackermann_~m 1)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1666#(<= ackermann_~m 1)} is VALID [2020-07-18 04:40:06,327 INFO L263 TraceCheckUtils]: 35: Hoare triple {1666#(<= ackermann_~m 1)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {1601#true} is VALID [2020-07-18 04:40:06,327 INFO L280 TraceCheckUtils]: 36: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,328 INFO L280 TraceCheckUtils]: 37: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,328 INFO L280 TraceCheckUtils]: 38: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume !(0 == ~m); {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,329 INFO L280 TraceCheckUtils]: 39: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,329 INFO L263 TraceCheckUtils]: 40: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} call #t~ret0 := ackermann(~m - 1, 1); {1601#true} is VALID [2020-07-18 04:40:06,330 INFO L280 TraceCheckUtils]: 41: Hoare triple {1601#true} ~m := #in~m; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,330 INFO L280 TraceCheckUtils]: 42: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} ~n := #in~n; {1683#(= ackermann_~m |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,331 INFO L280 TraceCheckUtils]: 43: Hoare triple {1683#(= ackermann_~m |ackermann_#in~m|)} assume 0 == ~m; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,331 INFO L280 TraceCheckUtils]: 44: Hoare triple {1691#(= 0 |ackermann_#in~m|)} #res := 1 + ~n; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,332 INFO L280 TraceCheckUtils]: 45: Hoare triple {1691#(= 0 |ackermann_#in~m|)} assume true; {1691#(= 0 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,333 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {1691#(= 0 |ackermann_#in~m|)} {1683#(= ackermann_~m |ackermann_#in~m|)} #61#return; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,333 INFO L280 TraceCheckUtils]: 47: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,334 INFO L280 TraceCheckUtils]: 48: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} #res := #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,334 INFO L280 TraceCheckUtils]: 49: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} havoc #t~ret0; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,335 INFO L280 TraceCheckUtils]: 50: Hoare triple {1698#(<= 1 |ackermann_#in~m|)} assume true; {1698#(<= 1 |ackermann_#in~m|)} is VALID [2020-07-18 04:40:06,336 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1698#(<= 1 |ackermann_#in~m|)} {1666#(<= ackermann_~m 1)} #65#return; {1602#false} is VALID [2020-07-18 04:40:06,336 INFO L280 TraceCheckUtils]: 52: Hoare triple {1602#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {1602#false} is VALID [2020-07-18 04:40:06,336 INFO L280 TraceCheckUtils]: 53: Hoare triple {1602#false} #res := #t~ret2; {1602#false} is VALID [2020-07-18 04:40:06,336 INFO L280 TraceCheckUtils]: 54: Hoare triple {1602#false} havoc #t~ret1; {1602#false} is VALID [2020-07-18 04:40:06,337 INFO L280 TraceCheckUtils]: 55: Hoare triple {1602#false} havoc #t~ret2; {1602#false} is VALID [2020-07-18 04:40:06,337 INFO L280 TraceCheckUtils]: 56: Hoare triple {1602#false} assume true; {1602#false} is VALID [2020-07-18 04:40:06,337 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {1602#false} {1601#true} #67#return; {1602#false} is VALID [2020-07-18 04:40:06,337 INFO L280 TraceCheckUtils]: 58: Hoare triple {1602#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {1602#false} is VALID [2020-07-18 04:40:06,338 INFO L280 TraceCheckUtils]: 59: Hoare triple {1602#false} ~result~0 := #t~ret5; {1602#false} is VALID [2020-07-18 04:40:06,338 INFO L280 TraceCheckUtils]: 60: Hoare triple {1602#false} havoc #t~ret5; {1602#false} is VALID [2020-07-18 04:40:06,338 INFO L280 TraceCheckUtils]: 61: Hoare triple {1602#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {1602#false} is VALID [2020-07-18 04:40:06,338 INFO L280 TraceCheckUtils]: 62: Hoare triple {1602#false} assume !false; {1602#false} is VALID [2020-07-18 04:40:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-18 04:40:06,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2003453206] [2020-07-18 04:40:06,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:06,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 04:40:06,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344613404] [2020-07-18 04:40:06,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-18 04:40:06,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:06,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 04:40:06,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:06,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 04:40:06,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:06,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 04:40:06,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 04:40:06,392 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 7 states. [2020-07-18 04:40:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:06,985 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2020-07-18 04:40:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 04:40:06,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-07-18 04:40:06,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:06,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2020-07-18 04:40:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 04:40:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2020-07-18 04:40:06,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 95 transitions. [2020-07-18 04:40:07,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:07,092 INFO L225 Difference]: With dead ends: 125 [2020-07-18 04:40:07,092 INFO L226 Difference]: Without dead ends: 81 [2020-07-18 04:40:07,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-18 04:40:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-18 04:40:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-07-18 04:40:07,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:07,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 81 states. [2020-07-18 04:40:07,314 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-18 04:40:07,314 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-18 04:40:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:07,321 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2020-07-18 04:40:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-18 04:40:07,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:07,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:07,323 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 81 states. [2020-07-18 04:40:07,323 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 81 states. [2020-07-18 04:40:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:07,329 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2020-07-18 04:40:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-18 04:40:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:07,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:07,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:07,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-07-18 04:40:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2020-07-18 04:40:07,337 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 63 [2020-07-18 04:40:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:07,337 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2020-07-18 04:40:07,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 04:40:07,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 81 states and 110 transitions. [2020-07-18 04:40:07,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-07-18 04:40:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-07-18 04:40:07,543 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:07,543 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:07,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 04:40:07,543 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:07,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 3 times [2020-07-18 04:40:07,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:07,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377119804] [2020-07-18 04:40:07,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,598 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} assume true; {2282#true} is VALID [2020-07-18 04:40:07,598 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2282#true} {2282#true} #57#return; {2282#true} is VALID [2020-07-18 04:40:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,776 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,777 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,778 INFO L280 TraceCheckUtils]: 4: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,779 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,780 INFO L280 TraceCheckUtils]: 3: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-18 04:40:07,781 INFO L263 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-18 04:40:07,781 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,782 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,783 INFO L280 TraceCheckUtils]: 9: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,784 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,786 INFO L280 TraceCheckUtils]: 13: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,786 INFO L280 TraceCheckUtils]: 14: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,787 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:07,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,823 INFO L280 TraceCheckUtils]: 3: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,825 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,826 INFO L280 TraceCheckUtils]: 3: Hoare triple {2282#true} assume !(0 == ~n); {2282#true} is VALID [2020-07-18 04:40:07,826 INFO L263 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret1 := ackermann(~m, ~n - 1); {2282#true} is VALID [2020-07-18 04:40:07,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,827 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,827 INFO L280 TraceCheckUtils]: 8: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-18 04:40:07,827 INFO L263 TraceCheckUtils]: 9: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-18 04:40:07,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,828 INFO L280 TraceCheckUtils]: 11: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,829 INFO L280 TraceCheckUtils]: 12: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,830 INFO L280 TraceCheckUtils]: 14: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,831 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,832 INFO L280 TraceCheckUtils]: 16: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,832 INFO L280 TraceCheckUtils]: 17: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,833 INFO L280 TraceCheckUtils]: 18: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,834 INFO L280 TraceCheckUtils]: 19: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,835 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,835 INFO L280 TraceCheckUtils]: 21: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,835 INFO L263 TraceCheckUtils]: 22: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2282#true} is VALID [2020-07-18 04:40:07,836 INFO L280 TraceCheckUtils]: 23: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,836 INFO L280 TraceCheckUtils]: 24: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,836 INFO L280 TraceCheckUtils]: 25: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,837 INFO L280 TraceCheckUtils]: 26: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,838 INFO L280 TraceCheckUtils]: 27: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,839 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,839 INFO L280 TraceCheckUtils]: 29: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,840 INFO L280 TraceCheckUtils]: 30: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,841 INFO L280 TraceCheckUtils]: 31: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,842 INFO L280 TraceCheckUtils]: 32: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,842 INFO L280 TraceCheckUtils]: 33: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,843 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #61#return; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,845 INFO L280 TraceCheckUtils]: 2: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,846 INFO L280 TraceCheckUtils]: 3: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-18 04:40:07,846 INFO L263 TraceCheckUtils]: 4: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-18 04:40:07,846 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,846 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,846 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {2282#true} assume !(0 == ~n); {2282#true} is VALID [2020-07-18 04:40:07,847 INFO L263 TraceCheckUtils]: 9: Hoare triple {2282#true} call #t~ret1 := ackermann(~m, ~n - 1); {2282#true} is VALID [2020-07-18 04:40:07,847 INFO L280 TraceCheckUtils]: 10: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,847 INFO L280 TraceCheckUtils]: 11: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,847 INFO L280 TraceCheckUtils]: 12: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-18 04:40:07,848 INFO L263 TraceCheckUtils]: 14: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-18 04:40:07,848 INFO L280 TraceCheckUtils]: 15: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,855 INFO L280 TraceCheckUtils]: 17: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,856 INFO L280 TraceCheckUtils]: 18: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,857 INFO L280 TraceCheckUtils]: 19: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,858 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,858 INFO L280 TraceCheckUtils]: 21: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,859 INFO L280 TraceCheckUtils]: 22: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,859 INFO L280 TraceCheckUtils]: 23: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,860 INFO L280 TraceCheckUtils]: 24: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,861 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,861 INFO L280 TraceCheckUtils]: 26: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,862 INFO L263 TraceCheckUtils]: 27: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2282#true} is VALID [2020-07-18 04:40:07,862 INFO L280 TraceCheckUtils]: 28: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,862 INFO L280 TraceCheckUtils]: 29: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,863 INFO L280 TraceCheckUtils]: 30: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,863 INFO L280 TraceCheckUtils]: 31: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,864 INFO L280 TraceCheckUtils]: 32: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,865 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,866 INFO L280 TraceCheckUtils]: 34: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,866 INFO L280 TraceCheckUtils]: 35: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,867 INFO L280 TraceCheckUtils]: 36: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,867 INFO L280 TraceCheckUtils]: 37: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,868 INFO L280 TraceCheckUtils]: 38: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,868 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #61#return; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,869 INFO L280 TraceCheckUtils]: 40: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,869 INFO L280 TraceCheckUtils]: 41: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,869 INFO L280 TraceCheckUtils]: 42: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,870 INFO L280 TraceCheckUtils]: 43: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,870 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #67#return; {2331#(<= 3 |main_#t~ret5|)} is VALID [2020-07-18 04:40:07,872 INFO L263 TraceCheckUtils]: 0: Hoare triple {2282#true} call ULTIMATE.init(); {2282#true} is VALID [2020-07-18 04:40:07,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {2282#true} assume true; {2282#true} is VALID [2020-07-18 04:40:07,872 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2282#true} {2282#true} #57#return; {2282#true} is VALID [2020-07-18 04:40:07,872 INFO L263 TraceCheckUtils]: 3: Hoare triple {2282#true} call #t~ret6 := main(); {2282#true} is VALID [2020-07-18 04:40:07,873 INFO L280 TraceCheckUtils]: 4: Hoare triple {2282#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2282#true} is VALID [2020-07-18 04:40:07,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {2282#true} ~m~0 := #t~nondet3; {2282#true} is VALID [2020-07-18 04:40:07,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {2282#true} havoc #t~nondet3; {2282#true} is VALID [2020-07-18 04:40:07,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {2282#true} assume !(~m~0 < 0 || ~m~0 > 3); {2282#true} is VALID [2020-07-18 04:40:07,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {2282#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2282#true} is VALID [2020-07-18 04:40:07,873 INFO L280 TraceCheckUtils]: 9: Hoare triple {2282#true} ~n~0 := #t~nondet4; {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L280 TraceCheckUtils]: 10: Hoare triple {2282#true} havoc #t~nondet4; {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L280 TraceCheckUtils]: 11: Hoare triple {2282#true} assume !(~n~0 < 0 || ~n~0 > 23); {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L263 TraceCheckUtils]: 12: Hoare triple {2282#true} call #t~ret5 := ackermann(~m~0, ~n~0); {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L280 TraceCheckUtils]: 13: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L280 TraceCheckUtils]: 15: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,874 INFO L280 TraceCheckUtils]: 16: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-18 04:40:07,875 INFO L263 TraceCheckUtils]: 17: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-18 04:40:07,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,875 INFO L280 TraceCheckUtils]: 19: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,875 INFO L280 TraceCheckUtils]: 20: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,875 INFO L280 TraceCheckUtils]: 21: Hoare triple {2282#true} assume !(0 == ~n); {2282#true} is VALID [2020-07-18 04:40:07,879 INFO L263 TraceCheckUtils]: 22: Hoare triple {2282#true} call #t~ret1 := ackermann(~m, ~n - 1); {2282#true} is VALID [2020-07-18 04:40:07,879 INFO L280 TraceCheckUtils]: 23: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,880 INFO L280 TraceCheckUtils]: 24: Hoare triple {2282#true} ~n := #in~n; {2282#true} is VALID [2020-07-18 04:40:07,880 INFO L280 TraceCheckUtils]: 25: Hoare triple {2282#true} assume !(0 == ~m); {2282#true} is VALID [2020-07-18 04:40:07,880 INFO L280 TraceCheckUtils]: 26: Hoare triple {2282#true} assume 0 == ~n; {2282#true} is VALID [2020-07-18 04:40:07,880 INFO L263 TraceCheckUtils]: 27: Hoare triple {2282#true} call #t~ret0 := ackermann(~m - 1, 1); {2282#true} is VALID [2020-07-18 04:40:07,880 INFO L280 TraceCheckUtils]: 28: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,881 INFO L280 TraceCheckUtils]: 29: Hoare triple {2282#true} ~n := #in~n; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,882 INFO L280 TraceCheckUtils]: 30: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:07,883 INFO L280 TraceCheckUtils]: 31: Hoare triple {2402#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,885 INFO L280 TraceCheckUtils]: 32: Hoare triple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:07,889 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2403#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {2282#true} #61#return; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,889 INFO L280 TraceCheckUtils]: 34: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2400#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,890 INFO L280 TraceCheckUtils]: 35: Hoare triple {2400#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,890 INFO L280 TraceCheckUtils]: 36: Hoare triple {2401#(<= 2 |ackermann_#res|)} havoc #t~ret0; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,891 INFO L280 TraceCheckUtils]: 37: Hoare triple {2401#(<= 2 |ackermann_#res|)} assume true; {2401#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,892 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2401#(<= 2 |ackermann_#res|)} {2282#true} #63#return; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,892 INFO L280 TraceCheckUtils]: 39: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {2386#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:07,892 INFO L263 TraceCheckUtils]: 40: Hoare triple {2386#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {2282#true} is VALID [2020-07-18 04:40:07,893 INFO L280 TraceCheckUtils]: 41: Hoare triple {2282#true} ~m := #in~m; {2282#true} is VALID [2020-07-18 04:40:07,893 INFO L280 TraceCheckUtils]: 42: Hoare triple {2282#true} ~n := #in~n; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,894 INFO L280 TraceCheckUtils]: 43: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {2404#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:07,894 INFO L280 TraceCheckUtils]: 44: Hoare triple {2404#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,895 INFO L280 TraceCheckUtils]: 45: Hoare triple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:07,896 INFO L275 TraceCheckUtils]: 46: Hoare quadruple {2405#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {2386#(<= 2 |ackermann_#t~ret1|)} #65#return; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,897 INFO L280 TraceCheckUtils]: 47: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {2393#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:07,897 INFO L280 TraceCheckUtils]: 48: Hoare triple {2393#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,898 INFO L280 TraceCheckUtils]: 49: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret1; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,898 INFO L280 TraceCheckUtils]: 50: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret2; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,899 INFO L280 TraceCheckUtils]: 51: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,899 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #61#return; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,900 INFO L280 TraceCheckUtils]: 53: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {2368#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:07,900 INFO L280 TraceCheckUtils]: 54: Hoare triple {2368#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,901 INFO L280 TraceCheckUtils]: 55: Hoare triple {2369#(<= 3 |ackermann_#res|)} havoc #t~ret0; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,902 INFO L280 TraceCheckUtils]: 56: Hoare triple {2369#(<= 3 |ackermann_#res|)} assume true; {2369#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:07,903 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2369#(<= 3 |ackermann_#res|)} {2282#true} #67#return; {2331#(<= 3 |main_#t~ret5|)} is VALID [2020-07-18 04:40:07,904 INFO L280 TraceCheckUtils]: 58: Hoare triple {2331#(<= 3 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {2331#(<= 3 |main_#t~ret5|)} is VALID [2020-07-18 04:40:07,905 INFO L280 TraceCheckUtils]: 59: Hoare triple {2331#(<= 3 |main_#t~ret5|)} ~result~0 := #t~ret5; {2332#(<= 3 main_~result~0)} is VALID [2020-07-18 04:40:07,906 INFO L280 TraceCheckUtils]: 60: Hoare triple {2332#(<= 3 main_~result~0)} havoc #t~ret5; {2332#(<= 3 main_~result~0)} is VALID [2020-07-18 04:40:07,906 INFO L280 TraceCheckUtils]: 61: Hoare triple {2332#(<= 3 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {2283#false} is VALID [2020-07-18 04:40:07,906 INFO L280 TraceCheckUtils]: 62: Hoare triple {2283#false} assume !false; {2283#false} is VALID [2020-07-18 04:40:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-18 04:40:07,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377119804] [2020-07-18 04:40:07,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:07,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-18 04:40:07,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322052915] [2020-07-18 04:40:07,910 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-07-18 04:40:07,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:07,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 04:40:07,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:07,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 04:40:07,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 04:40:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-18 04:40:07,972 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 14 states. [2020-07-18 04:40:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:10,011 INFO L93 Difference]: Finished difference Result 154 states and 245 transitions. [2020-07-18 04:40:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-18 04:40:10,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-07-18 04:40:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:40:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 111 transitions. [2020-07-18 04:40:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 04:40:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 111 transitions. [2020-07-18 04:40:10,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 111 transitions. [2020-07-18 04:40:10,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:10,168 INFO L225 Difference]: With dead ends: 154 [2020-07-18 04:40:10,168 INFO L226 Difference]: Without dead ends: 148 [2020-07-18 04:40:10,169 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2020-07-18 04:40:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-07-18 04:40:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 79. [2020-07-18 04:40:10,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:10,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 79 states. [2020-07-18 04:40:10,382 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 79 states. [2020-07-18 04:40:10,382 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 79 states. [2020-07-18 04:40:10,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:10,394 INFO L93 Difference]: Finished difference Result 148 states and 237 transitions. [2020-07-18 04:40:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 237 transitions. [2020-07-18 04:40:10,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:10,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:10,397 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 148 states. [2020-07-18 04:40:10,397 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 148 states. [2020-07-18 04:40:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:10,410 INFO L93 Difference]: Finished difference Result 148 states and 237 transitions. [2020-07-18 04:40:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 237 transitions. [2020-07-18 04:40:10,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:10,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:10,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:10,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-18 04:40:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2020-07-18 04:40:10,417 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 63 [2020-07-18 04:40:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:10,417 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-07-18 04:40:10,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 04:40:10,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 104 transitions. [2020-07-18 04:40:10,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2020-07-18 04:40:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-18 04:40:10,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:10,630 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:10,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 04:40:10,633 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 449882030, now seen corresponding path program 4 times [2020-07-18 04:40:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:10,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [841197983] [2020-07-18 04:40:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,672 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,672 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3205#true} {3205#true} #57#return; {3205#true} is VALID [2020-07-18 04:40:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,750 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,752 INFO L280 TraceCheckUtils]: 3: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,752 INFO L263 TraceCheckUtils]: 4: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,753 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,755 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,776 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-18 04:40:10,777 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,778 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,778 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-18 04:40:10,778 INFO L263 TraceCheckUtils]: 4: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,779 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,781 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,783 INFO L280 TraceCheckUtils]: 7: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,784 INFO L280 TraceCheckUtils]: 8: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,784 INFO L263 TraceCheckUtils]: 9: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,785 INFO L280 TraceCheckUtils]: 13: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,785 INFO L280 TraceCheckUtils]: 14: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,786 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,787 INFO L280 TraceCheckUtils]: 16: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,787 INFO L280 TraceCheckUtils]: 17: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,787 INFO L280 TraceCheckUtils]: 18: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,788 INFO L280 TraceCheckUtils]: 19: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,789 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-18 04:40:10,789 INFO L280 TraceCheckUtils]: 21: Hoare triple {3206#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,789 INFO L280 TraceCheckUtils]: 22: Hoare triple {3206#false} #res := #t~ret0; {3206#false} is VALID [2020-07-18 04:40:10,789 INFO L280 TraceCheckUtils]: 23: Hoare triple {3206#false} havoc #t~ret0; {3206#false} is VALID [2020-07-18 04:40:10,790 INFO L280 TraceCheckUtils]: 24: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-18 04:40:10,790 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3206#false} {3205#true} #63#return; {3206#false} is VALID [2020-07-18 04:40:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:10,811 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,812 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,812 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,812 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-18 04:40:10,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,813 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,813 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-18 04:40:10,813 INFO L263 TraceCheckUtils]: 4: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,814 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,814 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,814 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,814 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,815 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-18 04:40:10,815 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3205#true} is VALID [2020-07-18 04:40:10,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {3205#true} #res := #t~ret0; {3205#true} is VALID [2020-07-18 04:40:10,815 INFO L280 TraceCheckUtils]: 13: Hoare triple {3205#true} havoc #t~ret0; {3205#true} is VALID [2020-07-18 04:40:10,815 INFO L280 TraceCheckUtils]: 14: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,816 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3205#true} {3206#false} #65#return; {3206#false} is VALID [2020-07-18 04:40:10,816 INFO L280 TraceCheckUtils]: 0: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {3205#true} assume !(0 == ~n); {3205#true} is VALID [2020-07-18 04:40:10,817 INFO L263 TraceCheckUtils]: 4: Hoare triple {3205#true} call #t~ret1 := ackermann(~m, ~n - 1); {3205#true} is VALID [2020-07-18 04:40:10,817 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,817 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,817 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-18 04:40:10,818 INFO L263 TraceCheckUtils]: 9: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,818 INFO L280 TraceCheckUtils]: 10: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,819 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,820 INFO L280 TraceCheckUtils]: 12: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,821 INFO L280 TraceCheckUtils]: 13: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,821 INFO L263 TraceCheckUtils]: 14: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,821 INFO L280 TraceCheckUtils]: 15: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,821 INFO L280 TraceCheckUtils]: 16: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,822 INFO L280 TraceCheckUtils]: 18: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,823 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,824 INFO L280 TraceCheckUtils]: 22: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,824 INFO L280 TraceCheckUtils]: 23: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,825 INFO L280 TraceCheckUtils]: 24: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,826 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-18 04:40:10,826 INFO L280 TraceCheckUtils]: 26: Hoare triple {3206#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,826 INFO L280 TraceCheckUtils]: 27: Hoare triple {3206#false} #res := #t~ret0; {3206#false} is VALID [2020-07-18 04:40:10,826 INFO L280 TraceCheckUtils]: 28: Hoare triple {3206#false} havoc #t~ret0; {3206#false} is VALID [2020-07-18 04:40:10,826 INFO L280 TraceCheckUtils]: 29: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-18 04:40:10,827 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3206#false} {3205#true} #63#return; {3206#false} is VALID [2020-07-18 04:40:10,827 INFO L280 TraceCheckUtils]: 31: Hoare triple {3206#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,827 INFO L263 TraceCheckUtils]: 32: Hoare triple {3206#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3205#true} is VALID [2020-07-18 04:40:10,827 INFO L280 TraceCheckUtils]: 33: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,827 INFO L280 TraceCheckUtils]: 34: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,827 INFO L280 TraceCheckUtils]: 35: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,828 INFO L280 TraceCheckUtils]: 36: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-18 04:40:10,828 INFO L263 TraceCheckUtils]: 37: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,828 INFO L280 TraceCheckUtils]: 38: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,828 INFO L280 TraceCheckUtils]: 39: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,828 INFO L280 TraceCheckUtils]: 40: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,829 INFO L280 TraceCheckUtils]: 41: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,829 INFO L280 TraceCheckUtils]: 42: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,829 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-18 04:40:10,829 INFO L280 TraceCheckUtils]: 44: Hoare triple {3205#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3205#true} is VALID [2020-07-18 04:40:10,829 INFO L280 TraceCheckUtils]: 45: Hoare triple {3205#true} #res := #t~ret0; {3205#true} is VALID [2020-07-18 04:40:10,830 INFO L280 TraceCheckUtils]: 46: Hoare triple {3205#true} havoc #t~ret0; {3205#true} is VALID [2020-07-18 04:40:10,830 INFO L280 TraceCheckUtils]: 47: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,830 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3205#true} {3206#false} #65#return; {3206#false} is VALID [2020-07-18 04:40:10,830 INFO L280 TraceCheckUtils]: 49: Hoare triple {3206#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,830 INFO L280 TraceCheckUtils]: 50: Hoare triple {3206#false} #res := #t~ret2; {3206#false} is VALID [2020-07-18 04:40:10,831 INFO L280 TraceCheckUtils]: 51: Hoare triple {3206#false} havoc #t~ret1; {3206#false} is VALID [2020-07-18 04:40:10,831 INFO L280 TraceCheckUtils]: 52: Hoare triple {3206#false} havoc #t~ret2; {3206#false} is VALID [2020-07-18 04:40:10,831 INFO L280 TraceCheckUtils]: 53: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-18 04:40:10,831 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {3206#false} {3205#true} #67#return; {3206#false} is VALID [2020-07-18 04:40:10,833 INFO L263 TraceCheckUtils]: 0: Hoare triple {3205#true} call ULTIMATE.init(); {3205#true} is VALID [2020-07-18 04:40:10,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,833 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3205#true} {3205#true} #57#return; {3205#true} is VALID [2020-07-18 04:40:10,834 INFO L263 TraceCheckUtils]: 3: Hoare triple {3205#true} call #t~ret6 := main(); {3205#true} is VALID [2020-07-18 04:40:10,834 INFO L280 TraceCheckUtils]: 4: Hoare triple {3205#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3205#true} is VALID [2020-07-18 04:40:10,834 INFO L280 TraceCheckUtils]: 5: Hoare triple {3205#true} ~m~0 := #t~nondet3; {3205#true} is VALID [2020-07-18 04:40:10,834 INFO L280 TraceCheckUtils]: 6: Hoare triple {3205#true} havoc #t~nondet3; {3205#true} is VALID [2020-07-18 04:40:10,834 INFO L280 TraceCheckUtils]: 7: Hoare triple {3205#true} assume !(~m~0 < 0 || ~m~0 > 3); {3205#true} is VALID [2020-07-18 04:40:10,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {3205#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3205#true} is VALID [2020-07-18 04:40:10,835 INFO L280 TraceCheckUtils]: 9: Hoare triple {3205#true} ~n~0 := #t~nondet4; {3205#true} is VALID [2020-07-18 04:40:10,835 INFO L280 TraceCheckUtils]: 10: Hoare triple {3205#true} havoc #t~nondet4; {3205#true} is VALID [2020-07-18 04:40:10,835 INFO L280 TraceCheckUtils]: 11: Hoare triple {3205#true} assume !(~n~0 < 0 || ~n~0 > 23); {3205#true} is VALID [2020-07-18 04:40:10,835 INFO L263 TraceCheckUtils]: 12: Hoare triple {3205#true} call #t~ret5 := ackermann(~m~0, ~n~0); {3205#true} is VALID [2020-07-18 04:40:10,835 INFO L280 TraceCheckUtils]: 13: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {3205#true} assume !(0 == ~n); {3205#true} is VALID [2020-07-18 04:40:10,836 INFO L263 TraceCheckUtils]: 17: Hoare triple {3205#true} call #t~ret1 := ackermann(~m, ~n - 1); {3205#true} is VALID [2020-07-18 04:40:10,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,837 INFO L280 TraceCheckUtils]: 20: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,837 INFO L280 TraceCheckUtils]: 21: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-18 04:40:10,837 INFO L263 TraceCheckUtils]: 22: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,837 INFO L280 TraceCheckUtils]: 23: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,840 INFO L280 TraceCheckUtils]: 24: Hoare triple {3205#true} ~n := #in~n; {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {3322#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,841 INFO L280 TraceCheckUtils]: 26: Hoare triple {3322#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,842 INFO L263 TraceCheckUtils]: 27: Hoare triple {3323#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,842 INFO L280 TraceCheckUtils]: 28: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,842 INFO L280 TraceCheckUtils]: 29: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,842 INFO L280 TraceCheckUtils]: 30: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,842 INFO L280 TraceCheckUtils]: 31: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,843 INFO L280 TraceCheckUtils]: 32: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,843 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {3205#true} {3323#(= 0 |ackermann_#in~n|)} #61#return; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,844 INFO L280 TraceCheckUtils]: 34: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,844 INFO L280 TraceCheckUtils]: 35: Hoare triple {3323#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,845 INFO L280 TraceCheckUtils]: 36: Hoare triple {3323#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,845 INFO L280 TraceCheckUtils]: 37: Hoare triple {3323#(= 0 |ackermann_#in~n|)} assume true; {3323#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:10,846 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {3323#(= 0 |ackermann_#in~n|)} {3205#true} #61#return; {3206#false} is VALID [2020-07-18 04:40:10,846 INFO L280 TraceCheckUtils]: 39: Hoare triple {3206#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,846 INFO L280 TraceCheckUtils]: 40: Hoare triple {3206#false} #res := #t~ret0; {3206#false} is VALID [2020-07-18 04:40:10,847 INFO L280 TraceCheckUtils]: 41: Hoare triple {3206#false} havoc #t~ret0; {3206#false} is VALID [2020-07-18 04:40:10,847 INFO L280 TraceCheckUtils]: 42: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-18 04:40:10,847 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3206#false} {3205#true} #63#return; {3206#false} is VALID [2020-07-18 04:40:10,847 INFO L280 TraceCheckUtils]: 44: Hoare triple {3206#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,847 INFO L263 TraceCheckUtils]: 45: Hoare triple {3206#false} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3205#true} is VALID [2020-07-18 04:40:10,847 INFO L280 TraceCheckUtils]: 46: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,848 INFO L280 TraceCheckUtils]: 47: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,848 INFO L280 TraceCheckUtils]: 48: Hoare triple {3205#true} assume !(0 == ~m); {3205#true} is VALID [2020-07-18 04:40:10,848 INFO L280 TraceCheckUtils]: 49: Hoare triple {3205#true} assume 0 == ~n; {3205#true} is VALID [2020-07-18 04:40:10,848 INFO L263 TraceCheckUtils]: 50: Hoare triple {3205#true} call #t~ret0 := ackermann(~m - 1, 1); {3205#true} is VALID [2020-07-18 04:40:10,848 INFO L280 TraceCheckUtils]: 51: Hoare triple {3205#true} ~m := #in~m; {3205#true} is VALID [2020-07-18 04:40:10,848 INFO L280 TraceCheckUtils]: 52: Hoare triple {3205#true} ~n := #in~n; {3205#true} is VALID [2020-07-18 04:40:10,849 INFO L280 TraceCheckUtils]: 53: Hoare triple {3205#true} assume 0 == ~m; {3205#true} is VALID [2020-07-18 04:40:10,849 INFO L280 TraceCheckUtils]: 54: Hoare triple {3205#true} #res := 1 + ~n; {3205#true} is VALID [2020-07-18 04:40:10,849 INFO L280 TraceCheckUtils]: 55: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,849 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {3205#true} {3205#true} #61#return; {3205#true} is VALID [2020-07-18 04:40:10,849 INFO L280 TraceCheckUtils]: 57: Hoare triple {3205#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {3205#true} is VALID [2020-07-18 04:40:10,849 INFO L280 TraceCheckUtils]: 58: Hoare triple {3205#true} #res := #t~ret0; {3205#true} is VALID [2020-07-18 04:40:10,850 INFO L280 TraceCheckUtils]: 59: Hoare triple {3205#true} havoc #t~ret0; {3205#true} is VALID [2020-07-18 04:40:10,850 INFO L280 TraceCheckUtils]: 60: Hoare triple {3205#true} assume true; {3205#true} is VALID [2020-07-18 04:40:10,850 INFO L275 TraceCheckUtils]: 61: Hoare quadruple {3205#true} {3206#false} #65#return; {3206#false} is VALID [2020-07-18 04:40:10,854 INFO L280 TraceCheckUtils]: 62: Hoare triple {3206#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,854 INFO L280 TraceCheckUtils]: 63: Hoare triple {3206#false} #res := #t~ret2; {3206#false} is VALID [2020-07-18 04:40:10,855 INFO L280 TraceCheckUtils]: 64: Hoare triple {3206#false} havoc #t~ret1; {3206#false} is VALID [2020-07-18 04:40:10,855 INFO L280 TraceCheckUtils]: 65: Hoare triple {3206#false} havoc #t~ret2; {3206#false} is VALID [2020-07-18 04:40:10,855 INFO L280 TraceCheckUtils]: 66: Hoare triple {3206#false} assume true; {3206#false} is VALID [2020-07-18 04:40:10,855 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {3206#false} {3205#true} #67#return; {3206#false} is VALID [2020-07-18 04:40:10,855 INFO L280 TraceCheckUtils]: 68: Hoare triple {3206#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {3206#false} is VALID [2020-07-18 04:40:10,856 INFO L280 TraceCheckUtils]: 69: Hoare triple {3206#false} ~result~0 := #t~ret5; {3206#false} is VALID [2020-07-18 04:40:10,856 INFO L280 TraceCheckUtils]: 70: Hoare triple {3206#false} havoc #t~ret5; {3206#false} is VALID [2020-07-18 04:40:10,856 INFO L280 TraceCheckUtils]: 71: Hoare triple {3206#false} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {3206#false} is VALID [2020-07-18 04:40:10,856 INFO L280 TraceCheckUtils]: 72: Hoare triple {3206#false} assume !false; {3206#false} is VALID [2020-07-18 04:40:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-07-18 04:40:10,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [841197983] [2020-07-18 04:40:10,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:10,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-07-18 04:40:10,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614334222] [2020-07-18 04:40:10,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-18 04:40:10,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:10,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 04:40:10,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:10,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 04:40:10,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:10,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 04:40:10,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 04:40:10,925 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 4 states. [2020-07-18 04:40:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:11,301 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2020-07-18 04:40:11,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 04:40:11,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-07-18 04:40:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 04:40:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-18 04:40:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 04:40:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-07-18 04:40:11,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2020-07-18 04:40:11,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:11,392 INFO L225 Difference]: With dead ends: 144 [2020-07-18 04:40:11,392 INFO L226 Difference]: Without dead ends: 78 [2020-07-18 04:40:11,393 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 04:40:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-18 04:40:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-18 04:40:11,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:11,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-18 04:40:11,622 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-18 04:40:11,622 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-18 04:40:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:11,628 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-18 04:40:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-18 04:40:11,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:11,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:11,629 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-18 04:40:11,629 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-18 04:40:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:11,646 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2020-07-18 04:40:11,646 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-18 04:40:11,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:11,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:11,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:11,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:11,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-18 04:40:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-07-18 04:40:11,654 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 73 [2020-07-18 04:40:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:11,654 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-07-18 04:40:11,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 04:40:11,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 78 states and 104 transitions. [2020-07-18 04:40:11,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-07-18 04:40:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-07-18 04:40:11,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 04:40:11,839 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 04:40:11,839 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 04:40:11,839 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 04:40:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 04:40:11,840 INFO L82 PathProgramCache]: Analyzing trace with hash 990403329, now seen corresponding path program 5 times [2020-07-18 04:40:11,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 04:40:11,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32315859] [2020-07-18 04:40:11,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 04:40:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:11,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-18 04:40:11,934 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3940#true} {3940#true} #57#return; {3940#true} is VALID [2020-07-18 04:40:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,135 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,136 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,137 INFO L280 TraceCheckUtils]: 3: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,138 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,139 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,140 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,140 INFO L280 TraceCheckUtils]: 7: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,141 INFO L280 TraceCheckUtils]: 9: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,142 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,142 INFO L280 TraceCheckUtils]: 11: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,143 INFO L280 TraceCheckUtils]: 12: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,143 INFO L280 TraceCheckUtils]: 13: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,143 INFO L280 TraceCheckUtils]: 14: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,144 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,185 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,187 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,187 INFO L280 TraceCheckUtils]: 2: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,188 INFO L280 TraceCheckUtils]: 4: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,189 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,189 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,189 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,190 INFO L263 TraceCheckUtils]: 9: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,191 INFO L280 TraceCheckUtils]: 12: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,192 INFO L280 TraceCheckUtils]: 13: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,193 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,194 INFO L280 TraceCheckUtils]: 17: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,194 INFO L280 TraceCheckUtils]: 18: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,194 INFO L280 TraceCheckUtils]: 19: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,195 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,196 INFO L280 TraceCheckUtils]: 21: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,196 INFO L263 TraceCheckUtils]: 22: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-18 04:40:12,196 INFO L280 TraceCheckUtils]: 23: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,196 INFO L280 TraceCheckUtils]: 24: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,197 INFO L280 TraceCheckUtils]: 25: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,197 INFO L280 TraceCheckUtils]: 26: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,197 INFO L280 TraceCheckUtils]: 27: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,198 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,199 INFO L280 TraceCheckUtils]: 29: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,199 INFO L280 TraceCheckUtils]: 30: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,199 INFO L280 TraceCheckUtils]: 31: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,200 INFO L280 TraceCheckUtils]: 32: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,200 INFO L280 TraceCheckUtils]: 33: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,201 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,202 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,202 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,202 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,203 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,203 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-18 04:40:12,203 INFO L263 TraceCheckUtils]: 9: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-18 04:40:12,203 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,204 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,204 INFO L280 TraceCheckUtils]: 12: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,204 INFO L280 TraceCheckUtils]: 13: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,204 INFO L263 TraceCheckUtils]: 14: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,204 INFO L280 TraceCheckUtils]: 15: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,205 INFO L280 TraceCheckUtils]: 16: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,205 INFO L280 TraceCheckUtils]: 17: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,206 INFO L280 TraceCheckUtils]: 18: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,206 INFO L280 TraceCheckUtils]: 19: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,207 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,208 INFO L280 TraceCheckUtils]: 21: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,208 INFO L280 TraceCheckUtils]: 22: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,209 INFO L280 TraceCheckUtils]: 23: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,209 INFO L280 TraceCheckUtils]: 24: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,210 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,210 INFO L280 TraceCheckUtils]: 26: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,210 INFO L263 TraceCheckUtils]: 27: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-18 04:40:12,211 INFO L280 TraceCheckUtils]: 28: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,211 INFO L280 TraceCheckUtils]: 29: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,211 INFO L280 TraceCheckUtils]: 30: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,212 INFO L280 TraceCheckUtils]: 31: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,212 INFO L280 TraceCheckUtils]: 32: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,213 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,214 INFO L280 TraceCheckUtils]: 34: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,214 INFO L280 TraceCheckUtils]: 35: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,215 INFO L280 TraceCheckUtils]: 36: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,215 INFO L280 TraceCheckUtils]: 37: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,216 INFO L280 TraceCheckUtils]: 38: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,216 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,217 INFO L280 TraceCheckUtils]: 40: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,217 INFO L280 TraceCheckUtils]: 41: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,218 INFO L280 TraceCheckUtils]: 42: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,218 INFO L280 TraceCheckUtils]: 43: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,219 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #63#return; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 04:40:12,267 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-18 04:40:12,267 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-18 04:40:12,268 INFO L280 TraceCheckUtils]: 4: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-18 04:40:12,269 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,269 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,270 INFO L280 TraceCheckUtils]: 2: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,271 INFO L280 TraceCheckUtils]: 3: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,271 INFO L263 TraceCheckUtils]: 4: Hoare triple {4155#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-18 04:40:12,272 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-18 04:40:12,272 INFO L280 TraceCheckUtils]: 9: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-18 04:40:12,273 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,274 INFO L280 TraceCheckUtils]: 11: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,274 INFO L280 TraceCheckUtils]: 12: Hoare triple {4155#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,275 INFO L280 TraceCheckUtils]: 13: Hoare triple {4155#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,275 INFO L280 TraceCheckUtils]: 14: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume true; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,276 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {4155#(= 0 |ackermann_#in~n|)} {4065#(<= 3 |ackermann_#t~ret1|)} #65#return; {3941#false} is VALID [2020-07-18 04:40:12,277 INFO L280 TraceCheckUtils]: 0: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,277 INFO L280 TraceCheckUtils]: 2: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-18 04:40:12,277 INFO L263 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-18 04:40:12,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,278 INFO L263 TraceCheckUtils]: 9: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,279 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-18 04:40:12,279 INFO L263 TraceCheckUtils]: 14: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-18 04:40:12,279 INFO L280 TraceCheckUtils]: 15: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,280 INFO L280 TraceCheckUtils]: 16: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,280 INFO L280 TraceCheckUtils]: 17: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,280 INFO L280 TraceCheckUtils]: 18: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,280 INFO L263 TraceCheckUtils]: 19: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,280 INFO L280 TraceCheckUtils]: 20: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,281 INFO L280 TraceCheckUtils]: 21: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,281 INFO L280 TraceCheckUtils]: 22: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,282 INFO L280 TraceCheckUtils]: 23: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,282 INFO L280 TraceCheckUtils]: 24: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,283 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,284 INFO L280 TraceCheckUtils]: 26: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,285 INFO L280 TraceCheckUtils]: 27: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,285 INFO L280 TraceCheckUtils]: 28: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,291 INFO L280 TraceCheckUtils]: 29: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,295 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,296 INFO L280 TraceCheckUtils]: 31: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,296 INFO L263 TraceCheckUtils]: 32: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-18 04:40:12,296 INFO L280 TraceCheckUtils]: 33: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,297 INFO L280 TraceCheckUtils]: 34: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,297 INFO L280 TraceCheckUtils]: 35: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,298 INFO L280 TraceCheckUtils]: 36: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,298 INFO L280 TraceCheckUtils]: 37: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,300 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,301 INFO L280 TraceCheckUtils]: 39: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,302 INFO L280 TraceCheckUtils]: 40: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,303 INFO L280 TraceCheckUtils]: 41: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,304 INFO L280 TraceCheckUtils]: 42: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,304 INFO L280 TraceCheckUtils]: 43: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,306 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,307 INFO L280 TraceCheckUtils]: 45: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,308 INFO L280 TraceCheckUtils]: 46: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,308 INFO L280 TraceCheckUtils]: 47: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,309 INFO L280 TraceCheckUtils]: 48: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,311 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #63#return; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,311 INFO L280 TraceCheckUtils]: 50: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,312 INFO L263 TraceCheckUtils]: 51: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-18 04:40:12,312 INFO L280 TraceCheckUtils]: 52: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,313 INFO L280 TraceCheckUtils]: 53: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,313 INFO L280 TraceCheckUtils]: 54: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,314 INFO L280 TraceCheckUtils]: 55: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,315 INFO L263 TraceCheckUtils]: 56: Hoare triple {4155#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,315 INFO L280 TraceCheckUtils]: 57: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,315 INFO L280 TraceCheckUtils]: 58: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,316 INFO L280 TraceCheckUtils]: 59: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-18 04:40:12,316 INFO L280 TraceCheckUtils]: 60: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-18 04:40:12,316 INFO L280 TraceCheckUtils]: 61: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-18 04:40:12,317 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,318 INFO L280 TraceCheckUtils]: 63: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,319 INFO L280 TraceCheckUtils]: 64: Hoare triple {4155#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,320 INFO L280 TraceCheckUtils]: 65: Hoare triple {4155#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,321 INFO L280 TraceCheckUtils]: 66: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume true; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,322 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {4155#(= 0 |ackermann_#in~n|)} {4065#(<= 3 |ackermann_#t~ret1|)} #65#return; {3941#false} is VALID [2020-07-18 04:40:12,323 INFO L280 TraceCheckUtils]: 68: Hoare triple {3941#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3941#false} is VALID [2020-07-18 04:40:12,323 INFO L280 TraceCheckUtils]: 69: Hoare triple {3941#false} #res := #t~ret2; {3941#false} is VALID [2020-07-18 04:40:12,323 INFO L280 TraceCheckUtils]: 70: Hoare triple {3941#false} havoc #t~ret1; {3941#false} is VALID [2020-07-18 04:40:12,323 INFO L280 TraceCheckUtils]: 71: Hoare triple {3941#false} havoc #t~ret2; {3941#false} is VALID [2020-07-18 04:40:12,324 INFO L280 TraceCheckUtils]: 72: Hoare triple {3941#false} assume true; {3941#false} is VALID [2020-07-18 04:40:12,324 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3941#false} {3940#true} #67#return; {4018#(<= 5 |main_#t~ret5|)} is VALID [2020-07-18 04:40:12,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {3940#true} call ULTIMATE.init(); {3940#true} is VALID [2020-07-18 04:40:12,335 INFO L280 TraceCheckUtils]: 1: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-18 04:40:12,336 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3940#true} {3940#true} #57#return; {3940#true} is VALID [2020-07-18 04:40:12,336 INFO L263 TraceCheckUtils]: 3: Hoare triple {3940#true} call #t~ret6 := main(); {3940#true} is VALID [2020-07-18 04:40:12,336 INFO L280 TraceCheckUtils]: 4: Hoare triple {3940#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3940#true} is VALID [2020-07-18 04:40:12,336 INFO L280 TraceCheckUtils]: 5: Hoare triple {3940#true} ~m~0 := #t~nondet3; {3940#true} is VALID [2020-07-18 04:40:12,336 INFO L280 TraceCheckUtils]: 6: Hoare triple {3940#true} havoc #t~nondet3; {3940#true} is VALID [2020-07-18 04:40:12,337 INFO L280 TraceCheckUtils]: 7: Hoare triple {3940#true} assume !(~m~0 < 0 || ~m~0 > 3); {3940#true} is VALID [2020-07-18 04:40:12,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {3940#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3940#true} is VALID [2020-07-18 04:40:12,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {3940#true} ~n~0 := #t~nondet4; {3940#true} is VALID [2020-07-18 04:40:12,338 INFO L280 TraceCheckUtils]: 10: Hoare triple {3940#true} havoc #t~nondet4; {3940#true} is VALID [2020-07-18 04:40:12,338 INFO L280 TraceCheckUtils]: 11: Hoare triple {3940#true} assume !(~n~0 < 0 || ~n~0 > 23); {3940#true} is VALID [2020-07-18 04:40:12,338 INFO L263 TraceCheckUtils]: 12: Hoare triple {3940#true} call #t~ret5 := ackermann(~m~0, ~n~0); {3940#true} is VALID [2020-07-18 04:40:12,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,339 INFO L280 TraceCheckUtils]: 14: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,339 INFO L280 TraceCheckUtils]: 15: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-18 04:40:12,339 INFO L263 TraceCheckUtils]: 17: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-18 04:40:12,340 INFO L280 TraceCheckUtils]: 18: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,340 INFO L280 TraceCheckUtils]: 20: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,340 INFO L280 TraceCheckUtils]: 21: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,340 INFO L263 TraceCheckUtils]: 22: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,340 INFO L280 TraceCheckUtils]: 23: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,341 INFO L280 TraceCheckUtils]: 24: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,341 INFO L280 TraceCheckUtils]: 25: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,341 INFO L280 TraceCheckUtils]: 26: Hoare triple {3940#true} assume !(0 == ~n); {3940#true} is VALID [2020-07-18 04:40:12,341 INFO L263 TraceCheckUtils]: 27: Hoare triple {3940#true} call #t~ret1 := ackermann(~m, ~n - 1); {3940#true} is VALID [2020-07-18 04:40:12,341 INFO L280 TraceCheckUtils]: 28: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,341 INFO L280 TraceCheckUtils]: 29: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,342 INFO L280 TraceCheckUtils]: 30: Hoare triple {3940#true} assume !(0 == ~m); {3940#true} is VALID [2020-07-18 04:40:12,342 INFO L280 TraceCheckUtils]: 31: Hoare triple {3940#true} assume 0 == ~n; {3940#true} is VALID [2020-07-18 04:40:12,342 INFO L263 TraceCheckUtils]: 32: Hoare triple {3940#true} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,342 INFO L280 TraceCheckUtils]: 33: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,343 INFO L280 TraceCheckUtils]: 34: Hoare triple {3940#true} ~n := #in~n; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,343 INFO L280 TraceCheckUtils]: 35: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} assume 0 == ~m; {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} is VALID [2020-07-18 04:40:12,344 INFO L280 TraceCheckUtils]: 36: Hoare triple {4151#(or (= ackermann_~n |ackermann_#in~n|) (= ackermann_~n 1))} #res := 1 + ~n; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,345 INFO L280 TraceCheckUtils]: 37: Hoare triple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} assume true; {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} is VALID [2020-07-18 04:40:12,346 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {4152#(or (<= 2 |ackermann_#res|) (not (= 1 |ackermann_#in~n|)))} {3940#true} #61#return; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,346 INFO L280 TraceCheckUtils]: 39: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4149#(<= 2 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,347 INFO L280 TraceCheckUtils]: 40: Hoare triple {4149#(<= 2 |ackermann_#t~ret0|)} #res := #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,347 INFO L280 TraceCheckUtils]: 41: Hoare triple {4150#(<= 2 |ackermann_#res|)} havoc #t~ret0; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,348 INFO L280 TraceCheckUtils]: 42: Hoare triple {4150#(<= 2 |ackermann_#res|)} assume true; {4150#(<= 2 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,349 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4150#(<= 2 |ackermann_#res|)} {3940#true} #63#return; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,349 INFO L280 TraceCheckUtils]: 44: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4135#(<= 2 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,350 INFO L263 TraceCheckUtils]: 45: Hoare triple {4135#(<= 2 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-18 04:40:12,350 INFO L280 TraceCheckUtils]: 46: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,350 INFO L280 TraceCheckUtils]: 47: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,351 INFO L280 TraceCheckUtils]: 48: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~m; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,351 INFO L280 TraceCheckUtils]: 49: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} #res := 1 + ~n; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,352 INFO L280 TraceCheckUtils]: 50: Hoare triple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} assume true; {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} is VALID [2020-07-18 04:40:12,353 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {4154#(<= (+ |ackermann_#in~n| 1) |ackermann_#res|)} {4135#(<= 2 |ackermann_#t~ret1|)} #65#return; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,354 INFO L280 TraceCheckUtils]: 52: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {4142#(<= 3 |ackermann_#t~ret2|)} is VALID [2020-07-18 04:40:12,355 INFO L280 TraceCheckUtils]: 53: Hoare triple {4142#(<= 3 |ackermann_#t~ret2|)} #res := #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,356 INFO L280 TraceCheckUtils]: 54: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret1; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,357 INFO L280 TraceCheckUtils]: 55: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret2; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,358 INFO L280 TraceCheckUtils]: 56: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,359 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #61#return; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,360 INFO L280 TraceCheckUtils]: 58: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4117#(<= 3 |ackermann_#t~ret0|)} is VALID [2020-07-18 04:40:12,361 INFO L280 TraceCheckUtils]: 59: Hoare triple {4117#(<= 3 |ackermann_#t~ret0|)} #res := #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,361 INFO L280 TraceCheckUtils]: 60: Hoare triple {4118#(<= 3 |ackermann_#res|)} havoc #t~ret0; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,362 INFO L280 TraceCheckUtils]: 61: Hoare triple {4118#(<= 3 |ackermann_#res|)} assume true; {4118#(<= 3 |ackermann_#res|)} is VALID [2020-07-18 04:40:12,364 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4118#(<= 3 |ackermann_#res|)} {3940#true} #63#return; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,364 INFO L280 TraceCheckUtils]: 63: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {4065#(<= 3 |ackermann_#t~ret1|)} is VALID [2020-07-18 04:40:12,365 INFO L263 TraceCheckUtils]: 64: Hoare triple {4065#(<= 3 |ackermann_#t~ret1|)} call #t~ret2 := ackermann(~m - 1, #t~ret1); {3940#true} is VALID [2020-07-18 04:40:12,365 INFO L280 TraceCheckUtils]: 65: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,366 INFO L280 TraceCheckUtils]: 66: Hoare triple {3940#true} ~n := #in~n; {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,367 INFO L280 TraceCheckUtils]: 67: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume !(0 == ~m); {4153#(= ackermann_~n |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,368 INFO L280 TraceCheckUtils]: 68: Hoare triple {4153#(= ackermann_~n |ackermann_#in~n|)} assume 0 == ~n; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,368 INFO L263 TraceCheckUtils]: 69: Hoare triple {4155#(= 0 |ackermann_#in~n|)} call #t~ret0 := ackermann(~m - 1, 1); {3940#true} is VALID [2020-07-18 04:40:12,368 INFO L280 TraceCheckUtils]: 70: Hoare triple {3940#true} ~m := #in~m; {3940#true} is VALID [2020-07-18 04:40:12,368 INFO L280 TraceCheckUtils]: 71: Hoare triple {3940#true} ~n := #in~n; {3940#true} is VALID [2020-07-18 04:40:12,369 INFO L280 TraceCheckUtils]: 72: Hoare triple {3940#true} assume 0 == ~m; {3940#true} is VALID [2020-07-18 04:40:12,369 INFO L280 TraceCheckUtils]: 73: Hoare triple {3940#true} #res := 1 + ~n; {3940#true} is VALID [2020-07-18 04:40:12,369 INFO L280 TraceCheckUtils]: 74: Hoare triple {3940#true} assume true; {3940#true} is VALID [2020-07-18 04:40:12,371 INFO L275 TraceCheckUtils]: 75: Hoare quadruple {3940#true} {4155#(= 0 |ackermann_#in~n|)} #61#return; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,371 INFO L280 TraceCheckUtils]: 76: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,372 INFO L280 TraceCheckUtils]: 77: Hoare triple {4155#(= 0 |ackermann_#in~n|)} #res := #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,373 INFO L280 TraceCheckUtils]: 78: Hoare triple {4155#(= 0 |ackermann_#in~n|)} havoc #t~ret0; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,374 INFO L280 TraceCheckUtils]: 79: Hoare triple {4155#(= 0 |ackermann_#in~n|)} assume true; {4155#(= 0 |ackermann_#in~n|)} is VALID [2020-07-18 04:40:12,375 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {4155#(= 0 |ackermann_#in~n|)} {4065#(<= 3 |ackermann_#t~ret1|)} #65#return; {3941#false} is VALID [2020-07-18 04:40:12,376 INFO L280 TraceCheckUtils]: 81: Hoare triple {3941#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {3941#false} is VALID [2020-07-18 04:40:12,376 INFO L280 TraceCheckUtils]: 82: Hoare triple {3941#false} #res := #t~ret2; {3941#false} is VALID [2020-07-18 04:40:12,376 INFO L280 TraceCheckUtils]: 83: Hoare triple {3941#false} havoc #t~ret1; {3941#false} is VALID [2020-07-18 04:40:12,376 INFO L280 TraceCheckUtils]: 84: Hoare triple {3941#false} havoc #t~ret2; {3941#false} is VALID [2020-07-18 04:40:12,377 INFO L280 TraceCheckUtils]: 85: Hoare triple {3941#false} assume true; {3941#false} is VALID [2020-07-18 04:40:12,377 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {3941#false} {3940#true} #67#return; {4018#(<= 5 |main_#t~ret5|)} is VALID [2020-07-18 04:40:12,378 INFO L280 TraceCheckUtils]: 87: Hoare triple {4018#(<= 5 |main_#t~ret5|)} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647; {4018#(<= 5 |main_#t~ret5|)} is VALID [2020-07-18 04:40:12,379 INFO L280 TraceCheckUtils]: 88: Hoare triple {4018#(<= 5 |main_#t~ret5|)} ~result~0 := #t~ret5; {4019#(<= 5 main_~result~0)} is VALID [2020-07-18 04:40:12,379 INFO L280 TraceCheckUtils]: 89: Hoare triple {4019#(<= 5 main_~result~0)} havoc #t~ret5; {4019#(<= 5 main_~result~0)} is VALID [2020-07-18 04:40:12,380 INFO L280 TraceCheckUtils]: 90: Hoare triple {4019#(<= 5 main_~result~0)} assume !((~m~0 < 0 || ~n~0 < 0) || ~result~0 >= 0); {3941#false} is VALID [2020-07-18 04:40:12,381 INFO L280 TraceCheckUtils]: 91: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2020-07-18 04:40:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-07-18 04:40:12,394 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32315859] [2020-07-18 04:40:12,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 04:40:12,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-18 04:40:12,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459639079] [2020-07-18 04:40:12,398 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-07-18 04:40:12,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 04:40:12,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 04:40:12,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:12,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 04:40:12,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 04:40:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 04:40:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-18 04:40:12,498 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2020-07-18 04:40:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,514 INFO L93 Difference]: Finished difference Result 145 states and 234 transitions. [2020-07-18 04:40:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 04:40:14,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-07-18 04:40:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 04:40:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 04:40:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 119 transitions. [2020-07-18 04:40:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 04:40:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 119 transitions. [2020-07-18 04:40:14,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 119 transitions. [2020-07-18 04:40:14,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:14,714 INFO L225 Difference]: With dead ends: 145 [2020-07-18 04:40:14,715 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 04:40:14,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2020-07-18 04:40:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 04:40:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 04:40:14,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 04:40:14,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:14,718 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:14,719 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,719 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:40:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:40:14,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:14,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:14,720 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:14,720 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 04:40:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 04:40:14,721 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 04:40:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:40:14,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:14,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 04:40:14,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 04:40:14,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 04:40:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 04:40:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 04:40:14,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-07-18 04:40:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 04:40:14,723 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 04:40:14,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 04:40:14,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 04:40:14,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 04:40:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 04:40:14,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 04:40:14,724 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 04:40:14,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 04:40:16,782 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2020-07-18 04:40:17,179 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-07-18 04:40:17,336 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2020-07-18 04:40:17,562 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-07-18 04:40:17,845 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-07-18 04:40:18,256 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-07-18 04:40:18,511 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2020-07-18 04:40:18,517 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:40:18,517 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:40:18,517 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 04:40:18,518 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 04:40:18,518 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 04:40:18,518 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 04:40:18,518 INFO L264 CegarLoopResult]: At program point ackermannEXIT(lines 15 23) the Hoare annotation is: (let ((.cse2 (= ackermann_~m |ackermann_#in~m|)) (.cse6 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (<= 1 |ackermann_#in~m|))) (let ((.cse1 (and .cse2 .cse6 (<= 3 |ackermann_#res|) .cse5)) (.cse0 (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (and (or .cse0 .cse1) (let ((.cse4 (<= 2 |ackermann_#res|))) (let ((.cse3 (or (and .cse4 .cse6) (and .cse6 .cse0)))) (or (and (= 0 |ackermann_#in~m|) .cse2 .cse3) (and .cse4 .cse2 (<= ackermann_~m 1) (= 0 |ackermann_#in~n|) .cse5 .cse3) .cse1)))))) [2020-07-18 04:40:18,519 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|)) [2020-07-18 04:40:18,519 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-07-18 04:40:18,519 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= ackermann_~m 1) (<= 2 |ackermann_#t~ret1|) .cse3))) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-07-18 04:40:18,519 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|) (= 0 |ackermann_#in~n|)) [2020-07-18 04:40:18,520 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse3 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= ackermann_~m 1) (<= 2 |ackermann_#t~ret1|) .cse3))) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-07-18 04:40:18,520 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (not (= ackermann_~m 0)) (= ackermann_~n |ackermann_#in~n|)) [2020-07-18 04:40:18,520 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) .cse1) (and .cse0 .cse1 (<= 2 |ackermann_#t~ret0|) (<= ackermann_~m 1)))) (= 0 |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-07-18 04:40:18,520 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 3 |ackermann_#t~ret2|) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1))))) [2020-07-18 04:40:18,520 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) .cse1) (and .cse0 .cse1 (<= 2 |ackermann_#t~ret0|) (<= ackermann_~m 1)))) (= 0 |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-07-18 04:40:18,520 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 3 |ackermann_#t~ret2|) (or (= 1 |ackermann_#in~n|) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1))))) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= 0 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (<= 2 |ackermann_#res|) (let ((.cse0 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|)) (and .cse0 (<= ackermann_~m 1)))) (= ackermann_~n |ackermann_#in~n|) (<= 2 |ackermann_#t~ret0|) (= 0 |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (<= 3 |ackermann_#t~ret2|)) (.cse3 (<= 3 |ackermann_#res|)) (.cse4 (<= 1 |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse4) (and .cse0 (<= 3 |ackermann_#t~ret1|) .cse1 .cse2 .cse3 .cse4))) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point L16(lines 16 18) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 3 |ackermann_#res|) (<= 3 |ackermann_#t~ret2|) (<= 1 |ackermann_#in~m|)) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point L15(lines 15 23) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-07-18 04:40:18,521 INFO L264 CegarLoopResult]: At program point ackermannFINAL(lines 15 23) the Hoare annotation is: (let ((.cse2 (= ackermann_~m |ackermann_#in~m|)) (.cse6 (= ackermann_~n |ackermann_#in~n|)) (.cse5 (<= 1 |ackermann_#in~m|))) (let ((.cse1 (and .cse2 .cse6 (<= 3 |ackermann_#res|) .cse5)) (.cse0 (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (and (or .cse0 .cse1) (let ((.cse4 (<= 2 |ackermann_#res|))) (let ((.cse3 (or (and .cse4 .cse6) (and .cse6 .cse0)))) (or (and (= 0 |ackermann_#in~m|) .cse2 .cse3) (and .cse4 .cse2 (<= ackermann_~m 1) (= 0 |ackermann_#in~n|) .cse5 .cse3) .cse1)))))) [2020-07-18 04:40:18,521 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 46) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 46) the Hoare annotation is: true [2020-07-18 04:40:18,522 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: false [2020-07-18 04:40:18,522 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-18 04:40:18,522 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-07-18 04:40:18,522 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-07-18 04:40:18,522 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-18 04:40:18,523 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-07-18 04:40:18,523 INFO L264 CegarLoopResult]: At program point L40-3(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|) (<= 1 main_~result~0)) [2020-07-18 04:40:18,523 INFO L271 CegarLoopResult]: At program point L34(lines 34 39) the Hoare annotation is: true [2020-07-18 04:40:18,523 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2020-07-18 04:40:18,523 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-07-18 04:40:18,523 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-07-18 04:40:18,523 INFO L264 CegarLoopResult]: At program point L41(lines 41 45) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-07-18 04:40:18,553 INFO L163 areAnnotationChecker]: CFG has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 04:40:18,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:40:18 BoogieIcfgContainer [2020-07-18 04:40:18,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 04:40:18,570 INFO L168 Benchmark]: Toolchain (without parser) took 19722.14 ms. Allocated memory was 140.0 MB in the beginning and 396.9 MB in the end (delta: 256.9 MB). Free memory was 103.4 MB in the beginning and 327.7 MB in the end (delta: -224.3 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:18,570 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 04:40:18,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.25 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 93.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:18,571 INFO L168 Benchmark]: Boogie Preprocessor took 30.76 ms. Allocated memory is still 140.0 MB. Free memory was 93.5 MB in the beginning and 91.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:18,572 INFO L168 Benchmark]: RCFGBuilder took 526.99 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 91.8 MB in the beginning and 162.2 MB in the end (delta: -70.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:18,573 INFO L168 Benchmark]: TraceAbstraction took 18934.02 ms. Allocated memory was 204.5 MB in the beginning and 396.9 MB in the end (delta: 192.4 MB). Free memory was 161.3 MB in the beginning and 327.7 MB in the end (delta: -166.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2020-07-18 04:40:18,575 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 224.25 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 93.5 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.76 ms. Allocated memory is still 140.0 MB. Free memory was 93.5 MB in the beginning and 91.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.99 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 91.8 MB in the beginning and 162.2 MB in the end (delta: -70.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18934.02 ms. Allocated memory was 204.5 MB in the beginning and 396.9 MB in the end (delta: 192.4 MB). Free memory was 161.3 MB in the beginning and 327.7 MB in the end (delta: -166.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 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 - ProcedureContractResult [Line: 15]: Procedure Contract for ackermann Derived contract for procedure ackermann: (\old(n) + 1 <= \result || (((m == \old(m) && n == \old(n)) && 3 <= \result) && 1 <= \old(m))) && ((((0 == \old(m) && m == \old(m)) && ((2 <= \result && n == \old(n)) || (n == \old(n) && \old(n) + 1 <= \result))) || (((((2 <= \result && m == \old(m)) && m <= 1) && 0 == \old(n)) && 1 <= \old(m)) && ((2 <= \result && n == \old(n)) || (n == \old(n) && \old(n) + 1 <= \result)))) || (((m == \old(m) && n == \old(n)) && 3 <= \result) && 1 <= \old(m))) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 15.0s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 341 SDslu, 1250 SDs, 0 SdLazy, 1400 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 566 PreInvPairs, 997 NumberOfFragments, 632 HoareAnnotationTreeSize, 566 FomulaSimplifications, 70975 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2840 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 52851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 355/435 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...