/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/recHanoi03-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:08:24,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:08:24,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:08:24,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:08:24,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:08:24,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:08:24,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:08:24,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:08:24,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:08:24,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:08:24,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:08:24,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:08:24,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:08:24,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:08:24,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:08:24,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:08:24,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:08:24,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:08:24,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:08:24,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:08:24,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:08:24,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:08:24,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:08:24,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:08:24,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:08:24,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:08:24,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:08:24,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:08:24,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:08:24,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:08:24,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:08:24,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:08:24,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:08:24,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:08:24,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:08:24,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:08:24,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:08:24,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:08:24,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:08:24,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:08:24,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:08:24,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:08:24,258 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:08:24,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:08:24,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:08:24,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:08:24,260 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:08:24,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:08:24,261 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:08:24,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:08:24,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:08:24,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:08:24,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:08:24,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:08:24,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:08:24,262 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:08:24,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:08:24,263 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:08:24,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:08:24,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:08:24,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:08:24,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:08:24,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:08:24,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:08:24,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:08:24,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:08:24,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:08:24,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:08:24,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:08:24,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:08:24,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:08:24,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:08:24,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:08:24,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:08:24,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:08:24,605 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:08:24,605 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:08:24,606 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-07-17 22:08:24,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9970782be/701aec1a2a224720a149a3d1122bbe08/FLAGafbc8f282 [2020-07-17 22:08:25,144 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:08:25,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi03-2.c [2020-07-17 22:08:25,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9970782be/701aec1a2a224720a149a3d1122bbe08/FLAGafbc8f282 [2020-07-17 22:08:25,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9970782be/701aec1a2a224720a149a3d1122bbe08 [2020-07-17 22:08:25,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:08:25,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:08:25,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:08:25,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:08:25,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:08:25,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb4b9b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25, skipping insertion in model container [2020-07-17 22:08:25,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:08:25,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:08:25,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:08:25,698 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:08:25,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:08:25,730 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:08:25,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25 WrapperNode [2020-07-17 22:08:25,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:08:25,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:08:25,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:08:25,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:08:25,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (1/1) ... [2020-07-17 22:08:25,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:08:25,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:08:25,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:08:25,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:08:25,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (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-17 22:08:25,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:08:25,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:08:25,912 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2020-07-17 22:08:25,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:08:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:08:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:08:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2020-07-17 22:08:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:08:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:08:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:08:26,148 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:08:26,149 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:08:26,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:08:26 BoogieIcfgContainer [2020-07-17 22:08:26,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:08:26,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:08:26,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:08:26,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:08:26,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:08:25" (1/3) ... [2020-07-17 22:08:26,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12945413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:08:26, skipping insertion in model container [2020-07-17 22:08:26,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:08:25" (2/3) ... [2020-07-17 22:08:26,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12945413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:08:26, skipping insertion in model container [2020-07-17 22:08:26,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:08:26" (3/3) ... [2020-07-17 22:08:26,166 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2020-07-17 22:08:26,178 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:08:26,186 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:08:26,204 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:08:26,231 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:08:26,232 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:08:26,232 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:08:26,232 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:08:26,232 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:08:26,232 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:08:26,233 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:08:26,233 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:08:26,254 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-17 22:08:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-17 22:08:26,261 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:08:26,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:08:26,263 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:08:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:08:26,273 INFO L82 PathProgramCache]: Analyzing trace with hash 913793727, now seen corresponding path program 1 times [2020-07-17 22:08:26,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:08:26,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751481574] [2020-07-17 22:08:26,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:08:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:26,543 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:08:26,544 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:08:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:26,602 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~n := #in~n; {34#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:26,603 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:26,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} assume true; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:26,607 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} {24#true} #34#return; {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} is VALID [2020-07-17 22:08:26,608 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-17 22:08:26,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:08:26,609 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:08:26,609 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-17 22:08:26,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-17 22:08:26,610 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !(~n~0 < 1 || ~n~0 > 31); {24#true} is VALID [2020-07-17 22:08:26,611 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#true} call #t~ret2 := hanoi(~n~0); {24#true} is VALID [2020-07-17 22:08:26,612 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} ~n := #in~n; {34#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:26,613 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:26,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} assume true; {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:26,617 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {35#(and (= 1 |hanoi_#in~n|) (<= 1 |hanoi_#res|))} {24#true} #34#return; {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} is VALID [2020-07-17 22:08:26,622 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#(and (<= 1 |main_#t~ret2|) (= 1 main_~n~0))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(and (= 1 main_~n~0) (<= 1 main_~result~0))} is VALID [2020-07-17 22:08:26,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#(and (= 1 main_~n~0) (<= 1 main_~result~0))} assume !(~result~0 >= ~n~0); {25#false} is VALID [2020-07-17 22:08:26,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-17 22:08:26,631 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-17 22:08:26,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751481574] [2020-07-17 22:08:26,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:08:26,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:08:26,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102587511] [2020-07-17 22:08:26,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-17 22:08:26,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:08:26,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:08:26,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:08:26,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:08:26,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:08:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:08:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:08:26,716 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 6 states. [2020-07-17 22:08:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:27,009 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:08:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:08:27,010 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-17 22:08:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:08:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:08:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-17 22:08:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:08:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2020-07-17 22:08:27,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2020-07-17 22:08:27,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:08:27,112 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:08:27,112 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:08:27,116 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:08:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:08:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-17 22:08:27,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:08:27,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-17 22:08:27,164 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:08:27,164 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:08:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:27,169 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-17 22:08:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-17 22:08:27,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:08:27,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:08:27,171 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:08:27,171 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:08:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:27,175 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2020-07-17 22:08:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-17 22:08:27,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:08:27,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:08:27,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:08:27,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:08:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:08:27,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2020-07-17 22:08:27,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2020-07-17 22:08:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:08:27,182 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2020-07-17 22:08:27,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:08:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2020-07-17 22:08:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:08:27,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:08:27,184 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:08:27,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:08:27,184 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:08:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:08:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1998834103, now seen corresponding path program 1 times [2020-07-17 22:08:27,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:08:27,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051743401] [2020-07-17 22:08:27,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:08:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:27,288 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-17 22:08:27,288 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-17 22:08:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:27,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,411 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:27,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:27,414 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:27,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,416 INFO L280 TraceCheckUtils]: 1: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,416 INFO L263 TraceCheckUtils]: 2: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-17 22:08:27,417 INFO L280 TraceCheckUtils]: 3: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,418 INFO L280 TraceCheckUtils]: 4: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:27,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:27,421 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:27,422 INFO L280 TraceCheckUtils]: 7: Hoare triple {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-17 22:08:27,423 INFO L280 TraceCheckUtils]: 8: Hoare triple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-17 22:08:27,425 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {144#true} #34#return; {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} is VALID [2020-07-17 22:08:27,426 INFO L263 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2020-07-17 22:08:27,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-17 22:08:27,426 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-17 22:08:27,427 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2020-07-17 22:08:27,427 INFO L280 TraceCheckUtils]: 4: Hoare triple {144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2020-07-17 22:08:27,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {144#true} assume !(~n~0 < 1 || ~n~0 > 31); {144#true} is VALID [2020-07-17 22:08:27,427 INFO L263 TraceCheckUtils]: 6: Hoare triple {144#true} call #t~ret2 := hanoi(~n~0); {144#true} is VALID [2020-07-17 22:08:27,428 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,429 INFO L280 TraceCheckUtils]: 8: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,430 INFO L263 TraceCheckUtils]: 9: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-17 22:08:27,430 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#true} ~n := #in~n; {160#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:27,431 INFO L280 TraceCheckUtils]: 11: Hoare triple {160#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:27,432 INFO L280 TraceCheckUtils]: 12: Hoare triple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:27,434 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {167#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {160#(= hanoi_~n |hanoi_#in~n|)} #28#return; {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:27,435 INFO L280 TraceCheckUtils]: 14: Hoare triple {165#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-17 22:08:27,436 INFO L280 TraceCheckUtils]: 15: Hoare triple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2020-07-17 22:08:27,437 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {166#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {144#true} #34#return; {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} is VALID [2020-07-17 22:08:27,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {158#(<= (+ main_~n~0 1) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {159#(<= (+ main_~n~0 1) main_~result~0)} is VALID [2020-07-17 22:08:27,439 INFO L280 TraceCheckUtils]: 18: Hoare triple {159#(<= (+ main_~n~0 1) main_~result~0)} assume !(~result~0 >= ~n~0); {145#false} is VALID [2020-07-17 22:08:27,440 INFO L280 TraceCheckUtils]: 19: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-17 22:08:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:08:27,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051743401] [2020-07-17 22:08:27,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854743465] [2020-07-17 22:08:27,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:08:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:27,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:08:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:27,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:08:27,826 INFO L263 TraceCheckUtils]: 0: Hoare triple {144#true} call ULTIMATE.init(); {144#true} is VALID [2020-07-17 22:08:27,827 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#true} assume true; {144#true} is VALID [2020-07-17 22:08:27,827 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {144#true} {144#true} #30#return; {144#true} is VALID [2020-07-17 22:08:27,827 INFO L263 TraceCheckUtils]: 3: Hoare triple {144#true} call #t~ret3 := main(); {144#true} is VALID [2020-07-17 22:08:27,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {144#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {144#true} is VALID [2020-07-17 22:08:27,828 INFO L280 TraceCheckUtils]: 5: Hoare triple {144#true} assume !(~n~0 < 1 || ~n~0 > 31); {144#true} is VALID [2020-07-17 22:08:27,828 INFO L263 TraceCheckUtils]: 6: Hoare triple {144#true} call #t~ret2 := hanoi(~n~0); {144#true} is VALID [2020-07-17 22:08:27,829 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#true} ~n := #in~n; {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:27,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:27,830 INFO L263 TraceCheckUtils]: 9: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {144#true} is VALID [2020-07-17 22:08:27,831 INFO L280 TraceCheckUtils]: 10: Hoare triple {144#true} ~n := #in~n; {192#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:27,832 INFO L280 TraceCheckUtils]: 11: Hoare triple {192#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-17 22:08:27,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-17 22:08:27,834 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {205#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {192#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {212#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:27,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {212#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-17 22:08:27,837 INFO L280 TraceCheckUtils]: 15: Hoare triple {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} assume true; {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-17 22:08:27,839 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {216#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} {144#true} #34#return; {223#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| |main_#t~ret2|))) (<= main_~n~0 2))} is VALID [2020-07-17 22:08:27,840 INFO L280 TraceCheckUtils]: 17: Hoare triple {223#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| |main_#t~ret2|))) (<= main_~n~0 2))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {227#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| main_~result~0))) (<= main_~n~0 2))} is VALID [2020-07-17 22:08:27,842 INFO L280 TraceCheckUtils]: 18: Hoare triple {227#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_2| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_2| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_2| main_~result~0))) (<= main_~n~0 2))} assume !(~result~0 >= ~n~0); {145#false} is VALID [2020-07-17 22:08:27,842 INFO L280 TraceCheckUtils]: 19: Hoare triple {145#false} assume !false; {145#false} is VALID [2020-07-17 22:08:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-17 22:08:27,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:08:27,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-17 22:08:27,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665304602] [2020-07-17 22:08:27,847 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-07-17 22:08:27,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:08:27,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:08:27,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:08:27,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:08:27,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:08:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:08:27,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:08:27,891 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2020-07-17 22:08:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:28,346 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-17 22:08:28,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:08:28,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2020-07-17 22:08:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:08:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:08:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2020-07-17 22:08:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:08:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2020-07-17 22:08:28,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2020-07-17 22:08:28,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:08:28,394 INFO L225 Difference]: With dead ends: 26 [2020-07-17 22:08:28,394 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:08:28,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:08:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:08:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-17 22:08:28,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:08:28,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-17 22:08:28,404 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:08:28,404 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:08:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:28,407 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:08:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:08:28,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:08:28,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:08:28,408 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:08:28,408 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:08:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:28,411 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:08:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:08:28,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:08:28,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:08:28,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:08:28,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:08:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:08:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-17 22:08:28,415 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2020-07-17 22:08:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:08:28,415 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-17 22:08:28,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:08:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:08:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-17 22:08:28,416 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:08:28,417 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:08:28,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:08:28,630 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:08:28,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:08:28,631 INFO L82 PathProgramCache]: Analyzing trace with hash 293522751, now seen corresponding path program 2 times [2020-07-17 22:08:28,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:08:28,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470845132] [2020-07-17 22:08:28,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:08:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:28,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-17 22:08:28,746 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-17 22:08:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:28,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,898 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,900 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,902 INFO L263 TraceCheckUtils]: 2: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:28,903 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,904 INFO L280 TraceCheckUtils]: 5: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,906 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,907 INFO L280 TraceCheckUtils]: 7: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,908 INFO L280 TraceCheckUtils]: 8: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,909 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,911 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,911 INFO L263 TraceCheckUtils]: 2: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:28,912 INFO L280 TraceCheckUtils]: 3: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,912 INFO L280 TraceCheckUtils]: 4: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,913 INFO L263 TraceCheckUtils]: 5: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:28,913 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,914 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,917 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,918 INFO L280 TraceCheckUtils]: 10: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,918 INFO L280 TraceCheckUtils]: 11: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,920 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,921 INFO L280 TraceCheckUtils]: 13: Hoare triple {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-17 22:08:28,922 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} assume true; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-17 22:08:28,923 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} {345#true} #34#return; {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} is VALID [2020-07-17 22:08:28,924 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-17 22:08:28,924 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-17 22:08:28,925 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-17 22:08:28,925 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret3 := main(); {345#true} is VALID [2020-07-17 22:08:28,925 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {345#true} is VALID [2020-07-17 22:08:28,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} assume !(~n~0 < 1 || ~n~0 > 31); {345#true} is VALID [2020-07-17 22:08:28,926 INFO L263 TraceCheckUtils]: 6: Hoare triple {345#true} call #t~ret2 := hanoi(~n~0); {345#true} is VALID [2020-07-17 22:08:28,926 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,927 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,927 INFO L263 TraceCheckUtils]: 9: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:28,928 INFO L280 TraceCheckUtils]: 10: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,929 INFO L263 TraceCheckUtils]: 12: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:28,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#true} ~n := #in~n; {367#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:28,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {367#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,931 INFO L280 TraceCheckUtils]: 15: Hoare triple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,933 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {386#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,934 INFO L280 TraceCheckUtils]: 17: Hoare triple {384#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} assume true; {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:28,936 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {385#(<= (+ |hanoi_#in~n| 4) (* 2 |hanoi_#res|))} {367#(= hanoi_~n |hanoi_#in~n|)} #28#return; {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:28,937 INFO L280 TraceCheckUtils]: 20: Hoare triple {378#(<= (+ |hanoi_#in~n| 3) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-17 22:08:28,938 INFO L280 TraceCheckUtils]: 21: Hoare triple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} assume true; {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} is VALID [2020-07-17 22:08:28,952 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {379#(<= (+ |hanoi_#in~n| 4) |hanoi_#res|)} {345#true} #34#return; {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} is VALID [2020-07-17 22:08:28,955 INFO L280 TraceCheckUtils]: 23: Hoare triple {365#(<= (+ main_~n~0 4) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {366#(<= (+ main_~n~0 4) main_~result~0)} is VALID [2020-07-17 22:08:28,957 INFO L280 TraceCheckUtils]: 24: Hoare triple {366#(<= (+ main_~n~0 4) main_~result~0)} assume !(~result~0 >= ~n~0); {346#false} is VALID [2020-07-17 22:08:28,958 INFO L280 TraceCheckUtils]: 25: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-17 22:08:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:08:28,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470845132] [2020-07-17 22:08:28,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933242966] [2020-07-17 22:08:28,960 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:08:28,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:08:28,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:08:29,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-17 22:08:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:29,014 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:08:31,612 INFO L263 TraceCheckUtils]: 0: Hoare triple {345#true} call ULTIMATE.init(); {345#true} is VALID [2020-07-17 22:08:31,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {345#true} assume true; {345#true} is VALID [2020-07-17 22:08:31,613 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} #30#return; {345#true} is VALID [2020-07-17 22:08:31,613 INFO L263 TraceCheckUtils]: 3: Hoare triple {345#true} call #t~ret3 := main(); {345#true} is VALID [2020-07-17 22:08:31,613 INFO L280 TraceCheckUtils]: 4: Hoare triple {345#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {345#true} is VALID [2020-07-17 22:08:31,614 INFO L280 TraceCheckUtils]: 5: Hoare triple {345#true} assume !(~n~0 < 1 || ~n~0 > 31); {345#true} is VALID [2020-07-17 22:08:31,614 INFO L263 TraceCheckUtils]: 6: Hoare triple {345#true} call #t~ret2 := hanoi(~n~0); {345#true} is VALID [2020-07-17 22:08:31,615 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:31,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:31,616 INFO L263 TraceCheckUtils]: 9: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:31,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:31,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:31,617 INFO L263 TraceCheckUtils]: 12: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret0 := hanoi(~n - 1); {345#true} is VALID [2020-07-17 22:08:31,618 INFO L280 TraceCheckUtils]: 13: Hoare triple {345#true} ~n := #in~n; {411#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2020-07-17 22:08:31,619 INFO L280 TraceCheckUtils]: 14: Hoare triple {411#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-17 22:08:31,620 INFO L280 TraceCheckUtils]: 15: Hoare triple {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2020-07-17 22:08:31,621 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {433#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {411#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {440#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:31,623 INFO L280 TraceCheckUtils]: 17: Hoare triple {440#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-17 22:08:31,624 INFO L280 TraceCheckUtils]: 18: Hoare triple {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} assume true; {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} is VALID [2020-07-17 22:08:31,626 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {444#(and (<= |hanoi_#in~n| 2) (<= 1 (div (+ |hanoi_#res| (- 1)) 2)))} {411#(<= |hanoi_#in~n| hanoi_~n)} #28#return; {451#(and (<= |hanoi_#in~n| 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} is VALID [2020-07-17 22:08:31,628 INFO L280 TraceCheckUtils]: 20: Hoare triple {451#(and (<= |hanoi_#in~n| 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} is VALID [2020-07-17 22:08:31,630 INFO L280 TraceCheckUtils]: 21: Hoare triple {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} assume true; {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} is VALID [2020-07-17 22:08:31,633 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {455#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |hanoi_#res| (- 1)) 2)))) (<= |hanoi_#in~n| 3))} {345#true} #34#return; {462#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_5| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))) (<= main_~n~0 3))} is VALID [2020-07-17 22:08:31,637 INFO L280 TraceCheckUtils]: 23: Hoare triple {462#(and (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_5| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))) (<= main_~n~0 3))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {466#(and (<= main_~n~0 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_5| main_~result~0) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} is VALID [2020-07-17 22:08:31,639 INFO L280 TraceCheckUtils]: 24: Hoare triple {466#(and (<= main_~n~0 3) (exists ((|v_hanoi_#res_BEFORE_RETURN_5| Int) (|v_hanoi_#res_BEFORE_RETURN_4| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_4| (div (+ |v_hanoi_#res_BEFORE_RETURN_5| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_5| main_~result~0) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_4| (- 1)) 2)))))} assume !(~result~0 >= ~n~0); {346#false} is VALID [2020-07-17 22:08:31,640 INFO L280 TraceCheckUtils]: 25: Hoare triple {346#false} assume !false; {346#false} is VALID [2020-07-17 22:08:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-17 22:08:31,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:08:31,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2020-07-17 22:08:31,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910337981] [2020-07-17 22:08:31,661 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-17 22:08:31,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:08:31,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-17 22:08:31,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:08:31,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 22:08:31,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:08:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 22:08:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=263, Unknown=1, NotChecked=0, Total=306 [2020-07-17 22:08:31,738 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 18 states. [2020-07-17 22:08:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:32,572 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-17 22:08:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:08:32,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-17 22:08:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:08:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:08:32,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2020-07-17 22:08:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-17 22:08:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 36 transitions. [2020-07-17 22:08:32,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 36 transitions. [2020-07-17 22:08:32,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:08:32,656 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:08:32,656 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:08:32,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=85, Invalid=514, Unknown=1, NotChecked=0, Total=600 [2020-07-17 22:08:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:08:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 22:08:32,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:08:32,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-17 22:08:32,671 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:08:32,671 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:08:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:32,674 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:08:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:08:32,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:08:32,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:08:32,675 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:08:32,676 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:08:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:08:32,678 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:08:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:08:32,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:08:32,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:08:32,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:08:32,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:08:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:08:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-17 22:08:32,682 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2020-07-17 22:08:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:08:32,683 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-17 22:08:32,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 22:08:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:08:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-17 22:08:32,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:08:32,685 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:08:32,896 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:08:32,897 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:08:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:08:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1152432193, now seen corresponding path program 3 times [2020-07-17 22:08:32,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:08:32,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605720264] [2020-07-17 22:08:32,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:08:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:32,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-17 22:08:32,979 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-17 22:08:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:33,459 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,460 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,462 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,463 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,464 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,464 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,465 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,465 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,466 INFO L280 TraceCheckUtils]: 5: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,467 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,468 INFO L280 TraceCheckUtils]: 7: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,468 INFO L280 TraceCheckUtils]: 8: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,469 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,474 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,476 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,478 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,478 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,480 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,482 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,484 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,485 INFO L280 TraceCheckUtils]: 10: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,488 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,489 INFO L280 TraceCheckUtils]: 13: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,490 INFO L280 TraceCheckUtils]: 14: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,491 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,496 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,497 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,498 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,499 INFO L263 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,501 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,502 INFO L280 TraceCheckUtils]: 11: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,503 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,507 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,509 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,511 INFO L280 TraceCheckUtils]: 19: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,511 INFO L280 TraceCheckUtils]: 20: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,513 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,515 INFO L263 TraceCheckUtils]: 2: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,516 INFO L280 TraceCheckUtils]: 4: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,516 INFO L263 TraceCheckUtils]: 5: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,517 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,517 INFO L263 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,518 INFO L280 TraceCheckUtils]: 10: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,518 INFO L263 TraceCheckUtils]: 11: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,519 INFO L280 TraceCheckUtils]: 12: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,520 INFO L280 TraceCheckUtils]: 13: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,520 INFO L280 TraceCheckUtils]: 14: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,522 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,522 INFO L280 TraceCheckUtils]: 16: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,523 INFO L280 TraceCheckUtils]: 17: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,525 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,526 INFO L280 TraceCheckUtils]: 19: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,527 INFO L280 TraceCheckUtils]: 20: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,528 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,531 INFO L280 TraceCheckUtils]: 22: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,534 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,535 INFO L280 TraceCheckUtils]: 25: Hoare triple {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-17 22:08:33,536 INFO L280 TraceCheckUtils]: 26: Hoare triple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} assume true; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-17 22:08:33,537 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} {618#true} #34#return; {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} is VALID [2020-07-17 22:08:33,538 INFO L263 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2020-07-17 22:08:33,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-17 22:08:33,538 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-17 22:08:33,539 INFO L263 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2020-07-17 22:08:33,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {618#true} is VALID [2020-07-17 22:08:33,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#true} assume !(~n~0 < 1 || ~n~0 > 31); {618#true} is VALID [2020-07-17 22:08:33,539 INFO L263 TraceCheckUtils]: 6: Hoare triple {618#true} call #t~ret2 := hanoi(~n~0); {618#true} is VALID [2020-07-17 22:08:33,541 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,542 INFO L263 TraceCheckUtils]: 9: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,543 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,545 INFO L263 TraceCheckUtils]: 12: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,550 INFO L280 TraceCheckUtils]: 14: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,551 INFO L263 TraceCheckUtils]: 15: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,551 INFO L280 TraceCheckUtils]: 16: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,552 INFO L263 TraceCheckUtils]: 18: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:08:33,552 INFO L280 TraceCheckUtils]: 19: Hoare triple {618#true} ~n := #in~n; {652#(= hanoi_~n |hanoi_#in~n|)} is VALID [2020-07-17 22:08:33,553 INFO L280 TraceCheckUtils]: 20: Hoare triple {652#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,553 INFO L280 TraceCheckUtils]: 21: Hoare triple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} assume true; {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,554 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {713#(and (= 1 |hanoi_#in~n|) (<= |hanoi_#res| 1) (<= 1 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,555 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#(and (<= |hanoi_#in~n| 2) (= 1 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,556 INFO L280 TraceCheckUtils]: 24: Hoare triple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} assume true; {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,557 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {712#(<= (+ |hanoi_#in~n| 22) (* 8 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,558 INFO L280 TraceCheckUtils]: 26: Hoare triple {705#(<= (+ |hanoi_#in~n| 21) (* 8 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,559 INFO L280 TraceCheckUtils]: 27: Hoare triple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} assume true; {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,561 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {706#(<= (+ |hanoi_#in~n| 25) (* 4 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,561 INFO L280 TraceCheckUtils]: 29: Hoare triple {693#(<= (+ |hanoi_#in~n| 24) (* 4 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,562 INFO L280 TraceCheckUtils]: 30: Hoare triple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} assume true; {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} is VALID [2020-07-17 22:08:33,563 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {694#(<= (+ |hanoi_#in~n| 26) (* 2 |hanoi_#res|))} {652#(= hanoi_~n |hanoi_#in~n|)} #28#return; {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} is VALID [2020-07-17 22:08:33,564 INFO L280 TraceCheckUtils]: 32: Hoare triple {675#(<= (+ |hanoi_#in~n| 25) (* 2 |hanoi_#t~ret0|))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-17 22:08:33,564 INFO L280 TraceCheckUtils]: 33: Hoare triple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} assume true; {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} is VALID [2020-07-17 22:08:33,565 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {676#(<= (+ |hanoi_#in~n| 26) |hanoi_#res|)} {618#true} #34#return; {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} is VALID [2020-07-17 22:08:33,566 INFO L280 TraceCheckUtils]: 35: Hoare triple {650#(<= (+ main_~n~0 26) |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {651#(<= (+ main_~n~0 26) main_~result~0)} is VALID [2020-07-17 22:08:33,567 INFO L280 TraceCheckUtils]: 36: Hoare triple {651#(<= (+ main_~n~0 26) main_~result~0)} assume !(~result~0 >= ~n~0); {619#false} is VALID [2020-07-17 22:08:33,567 INFO L280 TraceCheckUtils]: 37: Hoare triple {619#false} assume !false; {619#false} is VALID [2020-07-17 22:08:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 22:08:33,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605720264] [2020-07-17 22:08:33,570 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499672045] [2020-07-17 22:08:33,571 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:08:33,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-17 22:08:33,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:08:33,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:08:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:08:33,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:09:00,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2020-07-17 22:09:00,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2020-07-17 22:09:00,337 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #30#return; {618#true} is VALID [2020-07-17 22:09:00,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2020-07-17 22:09:00,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {618#true} is VALID [2020-07-17 22:09:00,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#true} assume !(~n~0 < 1 || ~n~0 > 31); {732#(<= main_~n~0 31)} is VALID [2020-07-17 22:09:00,339 INFO L263 TraceCheckUtils]: 6: Hoare triple {732#(<= main_~n~0 31)} call #t~ret2 := hanoi(~n~0); {618#true} is VALID [2020-07-17 22:09:00,339 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-17 22:09:00,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-17 22:09:00,339 INFO L263 TraceCheckUtils]: 9: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:09:00,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-17 22:09:00,340 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-17 22:09:00,340 INFO L263 TraceCheckUtils]: 12: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:09:00,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-17 22:09:00,341 INFO L280 TraceCheckUtils]: 14: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-17 22:09:00,341 INFO L263 TraceCheckUtils]: 15: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:09:00,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-17 22:09:00,342 INFO L280 TraceCheckUtils]: 17: Hoare triple {618#true} assume !(1 == ~n); {618#true} is VALID [2020-07-17 22:09:00,342 INFO L263 TraceCheckUtils]: 18: Hoare triple {618#true} call #t~ret0 := hanoi(~n - 1); {618#true} is VALID [2020-07-17 22:09:00,342 INFO L280 TraceCheckUtils]: 19: Hoare triple {618#true} ~n := #in~n; {618#true} is VALID [2020-07-17 22:09:00,343 INFO L280 TraceCheckUtils]: 20: Hoare triple {618#true} assume 1 == ~n;#res := 1; {778#(<= 1 |hanoi_#res|)} is VALID [2020-07-17 22:09:00,344 INFO L280 TraceCheckUtils]: 21: Hoare triple {778#(<= 1 |hanoi_#res|)} assume true; {778#(<= 1 |hanoi_#res|)} is VALID [2020-07-17 22:09:00,345 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {778#(<= 1 |hanoi_#res|)} {618#true} #28#return; {785#(<= 1 |hanoi_#t~ret0|)} is VALID [2020-07-17 22:09:00,347 INFO L280 TraceCheckUtils]: 23: Hoare triple {785#(<= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} is VALID [2020-07-17 22:09:00,348 INFO L280 TraceCheckUtils]: 24: Hoare triple {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} assume true; {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} is VALID [2020-07-17 22:09:00,350 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {789#(<= 1 (div (+ |hanoi_#res| (- 1)) 2))} {618#true} #28#return; {796#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,353 INFO L280 TraceCheckUtils]: 26: Hoare triple {796#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| |hanoi_#t~ret0|) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,354 INFO L280 TraceCheckUtils]: 27: Hoare triple {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume true; {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,358 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {800#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |hanoi_#res| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} {618#true} #28#return; {807#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,363 INFO L280 TraceCheckUtils]: 29: Hoare triple {807#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,364 INFO L280 TraceCheckUtils]: 30: Hoare triple {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} assume true; {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,505 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {811#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2))))} {618#true} #28#return; {818#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,511 INFO L280 TraceCheckUtils]: 32: Hoare triple {818#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| |hanoi_#t~ret0|) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + 2 * #t~ret0;havoc #t~ret0; {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,512 INFO L280 TraceCheckUtils]: 33: Hoare triple {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} assume true; {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} is VALID [2020-07-17 22:09:00,549 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {822#(exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |hanoi_#res| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2))))} {732#(<= main_~n~0 31)} #34#return; {829#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} is VALID [2020-07-17 22:09:00,550 INFO L280 TraceCheckUtils]: 35: Hoare triple {829#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| |main_#t~ret2|) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {833#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| main_~result~0) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} is VALID [2020-07-17 22:09:00,553 INFO L280 TraceCheckUtils]: 36: Hoare triple {833#(and (<= main_~n~0 31) (exists ((|v_hanoi_#res_BEFORE_RETURN_7| Int) (|v_hanoi_#res_BEFORE_RETURN_9| Int) (|v_hanoi_#res_BEFORE_RETURN_8| Int) (|v_hanoi_#res_BEFORE_RETURN_10| Int)) (and (<= |v_hanoi_#res_BEFORE_RETURN_10| main_~result~0) (<= |v_hanoi_#res_BEFORE_RETURN_7| (div (+ |v_hanoi_#res_BEFORE_RETURN_8| (- 1)) 2)) (<= 1 (div (+ |v_hanoi_#res_BEFORE_RETURN_7| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_9| (div (+ |v_hanoi_#res_BEFORE_RETURN_10| (- 1)) 2)) (<= |v_hanoi_#res_BEFORE_RETURN_8| (div (+ |v_hanoi_#res_BEFORE_RETURN_9| (- 1)) 2)))))} assume !(~result~0 >= ~n~0); {619#false} is VALID [2020-07-17 22:09:00,553 INFO L280 TraceCheckUtils]: 37: Hoare triple {619#false} assume !false; {619#false} is VALID [2020-07-17 22:09:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-17 22:09:00,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:09:00,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2020-07-17 22:09:00,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503561701] [2020-07-17 22:09:00,559 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-17 22:09:00,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:09:00,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:09:00,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:09:00,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:09:00,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:09:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:09:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=570, Unknown=11, NotChecked=0, Total=650 [2020-07-17 22:09:00,883 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2020-07-17 22:09:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:09:30,314 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-17 22:09:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 22:09:30,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2020-07-17 22:09:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:09:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:09:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-07-17 22:09:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:09:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2020-07-17 22:09:30,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 29 transitions. [2020-07-17 22:09:30,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:09:30,633 INFO L225 Difference]: With dead ends: 28 [2020-07-17 22:09:30,633 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:09:30,635 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=69, Invalid=570, Unknown=11, NotChecked=0, Total=650 [2020-07-17 22:09:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:09:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:09:30,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:09:30,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:09:30,635 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:09:30,636 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:09:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:09:30,636 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:09:30,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:09:30,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:09:30,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:09:30,637 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:09:30,637 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:09:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:09:30,637 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:09:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:09:30,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:09:30,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:09:30,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:09:30,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:09:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:09:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:09:30,638 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2020-07-17 22:09:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:09:30,639 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:09:30,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:09:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:09:30,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:09:30,840 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:09:30,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:09:30,878 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:09:30,878 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:09:30,878 INFO L268 CegarLoopResult]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-07-17 22:09:30,878 INFO L268 CegarLoopResult]: For program point hanoiEXIT(lines 16 21) no Hoare annotation was computed. [2020-07-17 22:09:30,878 INFO L271 CegarLoopResult]: At program point hanoiENTRY(lines 16 21) the Hoare annotation is: true [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point hanoiFINAL(lines 16 21) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (= hanoi_~n |hanoi_#in~n|) [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:09:30,879 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L268 CegarLoopResult]: For program point L30(lines 30 34) no Hoare annotation was computed. [2020-07-17 22:09:30,879 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2020-07-17 22:09:30,880 INFO L264 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (<= main_~n~0 31) [2020-07-17 22:09:30,880 INFO L268 CegarLoopResult]: For program point L29-1(line 29) no Hoare annotation was computed. [2020-07-17 22:09:30,880 INFO L268 CegarLoopResult]: For program point L26(lines 26 28) no Hoare annotation was computed. [2020-07-17 22:09:30,880 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 24 35) no Hoare annotation was computed. [2020-07-17 22:09:30,880 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 24 35) no Hoare annotation was computed. [2020-07-17 22:09:30,883 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:09:30,883 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: hanoiFINAL has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:09:30,884 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: hanoiEXIT has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:09:30,885 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:09:30,886 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:09:30,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:09:30 BoogieIcfgContainer [2020-07-17 22:09:30,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:09:30,891 INFO L168 Benchmark]: Toolchain (without parser) took 65380.95 ms. Allocated memory was 142.6 MB in the beginning and 295.2 MB in the end (delta: 152.6 MB). Free memory was 100.8 MB in the beginning and 153.5 MB in the end (delta: -52.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:09:30,891 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 142.6 MB. Free memory is still 118.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:09:30,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.88 ms. Allocated memory is still 142.6 MB. Free memory was 100.4 MB in the beginning and 90.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:09:30,893 INFO L168 Benchmark]: Boogie Preprocessor took 29.37 ms. Allocated memory is still 142.6 MB. Free memory was 90.5 MB in the beginning and 89.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:09:30,894 INFO L168 Benchmark]: RCFGBuilder took 394.01 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.1 MB in the beginning and 163.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:09:30,895 INFO L168 Benchmark]: TraceAbstraction took 64731.19 ms. Allocated memory was 199.8 MB in the beginning and 295.2 MB in the end (delta: 95.4 MB). Free memory was 163.1 MB in the beginning and 153.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:09:30,898 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.50 ms. Allocated memory is still 142.6 MB. Free memory is still 118.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 218.88 ms. Allocated memory is still 142.6 MB. Free memory was 100.4 MB in the beginning and 90.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.37 ms. Allocated memory is still 142.6 MB. Free memory was 90.5 MB in the beginning and 89.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 394.01 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.1 MB in the beginning and 163.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64731.19 ms. Allocated memory was 199.8 MB in the beginning and 295.2 MB in the end (delta: 95.4 MB). Free memory was 163.1 MB in the beginning and 153.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 105.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 64.6s, OverallIterations: 4, TraceHistogramMax: 5, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 68 SDtfs, 19 SDslu, 364 SDs, 0 SdLazy, 296 SolverSat, 7 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 29.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 11 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 18 QuantifiedInterpolants, 27252 SizeOfPredicates, 11 NumberOfNonLiveVariables, 203 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 96/140 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...