/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/recHanoi02-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 00:34:45,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 00:34:45,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 00:34:45,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 00:34:45,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 00:34:45,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 00:34:45,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 00:34:45,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 00:34:45,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 00:34:45,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 00:34:45,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 00:34:45,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 00:34:45,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 00:34:45,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 00:34:45,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 00:34:45,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 00:34:45,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 00:34:45,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 00:34:45,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 00:34:45,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 00:34:45,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 00:34:45,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 00:34:45,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 00:34:45,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 00:34:45,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 00:34:45,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 00:34:45,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 00:34:45,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 00:34:45,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 00:34:45,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 00:34:45,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 00:34:45,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 00:34:45,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 00:34:45,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 00:34:45,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 00:34:45,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 00:34:45,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 00:34:45,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 00:34:45,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 00:34:45,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 00:34:45,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 00:34:45,663 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 00:34:45,674 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 00:34:45,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 00:34:45,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 00:34:45,677 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 00:34:45,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 00:34:45,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 00:34:45,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 00:34:45,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 00:34:45,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 00:34:45,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 00:34:45,679 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 00:34:45,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 00:34:45,680 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 00:34:45,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 00:34:45,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 00:34:45,682 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 00:34:45,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 00:34:45,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 00:34:45,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 00:34:45,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 00:34:45,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 00:34:45,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 00:34:45,684 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 00:34:45,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 00:34:46,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 00:34:46,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 00:34:46,006 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 00:34:46,006 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 00:34:46,007 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi02-2.c [2020-07-11 00:34:46,070 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4748fe6e2/1f040bc636c543fc90a469c2dab53fd7/FLAG2d85d39f5 [2020-07-11 00:34:46,531 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 00:34:46,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi02-2.c [2020-07-11 00:34:46,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4748fe6e2/1f040bc636c543fc90a469c2dab53fd7/FLAG2d85d39f5 [2020-07-11 00:34:46,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4748fe6e2/1f040bc636c543fc90a469c2dab53fd7 [2020-07-11 00:34:46,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 00:34:46,967 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 00:34:46,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 00:34:46,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 00:34:46,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 00:34:46,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:34:46" (1/1) ... [2020-07-11 00:34:46,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b184564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:46, skipping insertion in model container [2020-07-11 00:34:46,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 12:34:46" (1/1) ... [2020-07-11 00:34:46,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 00:34:47,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 00:34:47,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:34:47,189 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 00:34:47,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 00:34:47,222 INFO L208 MainTranslator]: Completed translation [2020-07-11 00:34:47,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47 WrapperNode [2020-07-11 00:34:47,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 00:34:47,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 00:34:47,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 00:34:47,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 00:34:47,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (1/1) ... [2020-07-11 00:34:47,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 00:34:47,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 00:34:47,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 00:34:47,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 00:34:47,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (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-11 00:34:47,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 00:34:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 00:34:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2020-07-11 00:34:47,417 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 00:34:47,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 00:34:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 00:34:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2020-07-11 00:34:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 00:34:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 00:34:47,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 00:34:47,669 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 00:34:47,669 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-11 00:34:47,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:34:47 BoogieIcfgContainer [2020-07-11 00:34:47,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 00:34:47,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 00:34:47,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 00:34:47,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 00:34:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 12:34:46" (1/3) ... [2020-07-11 00:34:47,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5689b9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:34:47, skipping insertion in model container [2020-07-11 00:34:47,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 12:34:47" (2/3) ... [2020-07-11 00:34:47,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5689b9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 12:34:47, skipping insertion in model container [2020-07-11 00:34:47,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 12:34:47" (3/3) ... [2020-07-11 00:34:47,683 INFO L109 eAbstractionObserver]: Analyzing ICFG recHanoi02-2.c [2020-07-11 00:34:47,694 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 00:34:47,701 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 00:34:47,721 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 00:34:47,752 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 00:34:47,752 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 00:34:47,753 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 00:34:47,753 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 00:34:47,753 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 00:34:47,753 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 00:34:47,754 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 00:34:47,754 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 00:34:47,773 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-11 00:34:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-11 00:34:47,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:47,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:47,788 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:47,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash 607163649, now seen corresponding path program 1 times [2020-07-11 00:34:47,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:47,805 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120470220] [2020-07-11 00:34:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:34:48,039 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:34:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,080 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~n := #in~n; {33#true} is VALID [2020-07-11 00:34:48,081 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 1 == ~n; {33#true} is VALID [2020-07-11 00:34:48,083 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 1; {44#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,084 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 1 |hanoi_#res|)} assume true; {44#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,087 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 1 |hanoi_#res|)} {33#true} #43#return; {42#(<= 1 |main_#t~ret2|)} is VALID [2020-07-11 00:34:48,087 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-11 00:34:48,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-11 00:34:48,088 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-11 00:34:48,089 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-11 00:34:48,089 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-11 00:34:48,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~n~0 := #t~nondet1; {33#true} is VALID [2020-07-11 00:34:48,090 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-11 00:34:48,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(~n~0 < 1 || ~n~0 > 31); {33#true} is VALID [2020-07-11 00:34:48,091 INFO L263 TraceCheckUtils]: 8: Hoare triple {33#true} call #t~ret2 := hanoi(~n~0); {33#true} is VALID [2020-07-11 00:34:48,091 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} ~n := #in~n; {33#true} is VALID [2020-07-11 00:34:48,092 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} assume 1 == ~n; {33#true} is VALID [2020-07-11 00:34:48,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#true} #res := 1; {44#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {44#(= 1 |hanoi_#res|)} assume true; {44#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,097 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {44#(= 1 |hanoi_#res|)} {33#true} #43#return; {42#(<= 1 |main_#t~ret2|)} is VALID [2020-07-11 00:34:48,098 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= 1 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= 1 |main_#t~ret2|)} is VALID [2020-07-11 00:34:48,099 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#(<= 1 |main_#t~ret2|)} ~result~0 := #t~ret2; {43#(<= 1 main_~result~0)} is VALID [2020-07-11 00:34:48,101 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= 1 main_~result~0)} havoc #t~ret2; {43#(<= 1 main_~result~0)} is VALID [2020-07-11 00:34:48,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {43#(<= 1 main_~result~0)} assume !(~result~0 >= 0); {34#false} is VALID [2020-07-11 00:34:48,103 INFO L280 TraceCheckUtils]: 18: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-11 00:34:48,107 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-11 00:34:48,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120470220] [2020-07-11 00:34:48,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 00:34:48,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 00:34:48,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793752776] [2020-07-11 00:34:48,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-11 00:34:48,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:48,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 00:34:48,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:48,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 00:34:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 00:34:48,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 00:34:48,195 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-11 00:34:48,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:48,452 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-11 00:34:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 00:34:48,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-11 00:34:48,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:34:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-11 00:34:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 00:34:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-11 00:34:48,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-11 00:34:48,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:48,561 INFO L225 Difference]: With dead ends: 45 [2020-07-11 00:34:48,561 INFO L226 Difference]: Without dead ends: 26 [2020-07-11 00:34:48,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-11 00:34:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-11 00:34:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-11 00:34:48,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:48,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-11 00:34:48,625 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-11 00:34:48,626 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-11 00:34:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:48,632 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-11 00:34:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-11 00:34:48,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:48,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:48,633 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-11 00:34:48,634 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-11 00:34:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:48,638 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2020-07-11 00:34:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-11 00:34:48,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:48,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:48,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:48,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:48,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-11 00:34:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-11 00:34:48,657 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2020-07-11 00:34:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:48,658 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-11 00:34:48,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 00:34:48,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2020-07-11 00:34:48,698 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-11 00:34:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-11 00:34:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 00:34:48,699 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:48,700 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:48,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 00:34:48,700 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1887435767, now seen corresponding path program 1 times [2020-07-11 00:34:48,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:48,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1844482665] [2020-07-11 00:34:48,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,799 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#true} assume true; {243#true} is VALID [2020-07-11 00:34:48,799 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {243#true} {243#true} #39#return; {243#true} is VALID [2020-07-11 00:34:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:48,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#true} ~n := #in~n; {243#true} is VALID [2020-07-11 00:34:48,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#true} assume 1 == ~n; {243#true} is VALID [2020-07-11 00:34:48,875 INFO L280 TraceCheckUtils]: 2: Hoare triple {243#true} #res := 1; {269#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,876 INFO L280 TraceCheckUtils]: 3: Hoare triple {269#(= 1 |hanoi_#res|)} assume true; {269#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,877 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {269#(= 1 |hanoi_#res|)} {243#true} #37#return; {267#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:48,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {243#true} ~n := #in~n; {243#true} is VALID [2020-07-11 00:34:48,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#true} assume !(1 == ~n); {243#true} is VALID [2020-07-11 00:34:48,879 INFO L263 TraceCheckUtils]: 2: Hoare triple {243#true} call #t~ret0 := hanoi(~n - 1); {243#true} is VALID [2020-07-11 00:34:48,879 INFO L280 TraceCheckUtils]: 3: Hoare triple {243#true} ~n := #in~n; {243#true} is VALID [2020-07-11 00:34:48,879 INFO L280 TraceCheckUtils]: 4: Hoare triple {243#true} assume 1 == ~n; {243#true} is VALID [2020-07-11 00:34:48,880 INFO L280 TraceCheckUtils]: 5: Hoare triple {243#true} #res := 1; {269#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {269#(= 1 |hanoi_#res|)} assume true; {269#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,883 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {269#(= 1 |hanoi_#res|)} {243#true} #37#return; {267#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:48,883 INFO L280 TraceCheckUtils]: 8: Hoare triple {267#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {267#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:48,885 INFO L280 TraceCheckUtils]: 9: Hoare triple {267#(= 1 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {268#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,886 INFO L280 TraceCheckUtils]: 10: Hoare triple {268#(<= 3 |hanoi_#res|)} havoc #t~ret0; {268#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,886 INFO L280 TraceCheckUtils]: 11: Hoare triple {268#(<= 3 |hanoi_#res|)} assume true; {268#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,888 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {268#(<= 3 |hanoi_#res|)} {243#true} #43#return; {260#(<= 3 |main_#t~ret2|)} is VALID [2020-07-11 00:34:48,889 INFO L263 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2020-07-11 00:34:48,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {243#true} assume true; {243#true} is VALID [2020-07-11 00:34:48,889 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {243#true} {243#true} #39#return; {243#true} is VALID [2020-07-11 00:34:48,890 INFO L263 TraceCheckUtils]: 3: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2020-07-11 00:34:48,890 INFO L280 TraceCheckUtils]: 4: Hoare triple {243#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {243#true} is VALID [2020-07-11 00:34:48,890 INFO L280 TraceCheckUtils]: 5: Hoare triple {243#true} ~n~0 := #t~nondet1; {243#true} is VALID [2020-07-11 00:34:48,891 INFO L280 TraceCheckUtils]: 6: Hoare triple {243#true} havoc #t~nondet1; {243#true} is VALID [2020-07-11 00:34:48,891 INFO L280 TraceCheckUtils]: 7: Hoare triple {243#true} assume !(~n~0 < 1 || ~n~0 > 31); {243#true} is VALID [2020-07-11 00:34:48,891 INFO L263 TraceCheckUtils]: 8: Hoare triple {243#true} call #t~ret2 := hanoi(~n~0); {243#true} is VALID [2020-07-11 00:34:48,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {243#true} ~n := #in~n; {243#true} is VALID [2020-07-11 00:34:48,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {243#true} assume !(1 == ~n); {243#true} is VALID [2020-07-11 00:34:48,892 INFO L263 TraceCheckUtils]: 11: Hoare triple {243#true} call #t~ret0 := hanoi(~n - 1); {243#true} is VALID [2020-07-11 00:34:48,892 INFO L280 TraceCheckUtils]: 12: Hoare triple {243#true} ~n := #in~n; {243#true} is VALID [2020-07-11 00:34:48,893 INFO L280 TraceCheckUtils]: 13: Hoare triple {243#true} assume 1 == ~n; {243#true} is VALID [2020-07-11 00:34:48,894 INFO L280 TraceCheckUtils]: 14: Hoare triple {243#true} #res := 1; {269#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,894 INFO L280 TraceCheckUtils]: 15: Hoare triple {269#(= 1 |hanoi_#res|)} assume true; {269#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,896 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {269#(= 1 |hanoi_#res|)} {243#true} #37#return; {267#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:48,896 INFO L280 TraceCheckUtils]: 17: Hoare triple {267#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {267#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:48,898 INFO L280 TraceCheckUtils]: 18: Hoare triple {267#(= 1 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {268#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {268#(<= 3 |hanoi_#res|)} havoc #t~ret0; {268#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {268#(<= 3 |hanoi_#res|)} assume true; {268#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:48,901 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {268#(<= 3 |hanoi_#res|)} {243#true} #43#return; {260#(<= 3 |main_#t~ret2|)} is VALID [2020-07-11 00:34:48,902 INFO L280 TraceCheckUtils]: 22: Hoare triple {260#(<= 3 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {260#(<= 3 |main_#t~ret2|)} is VALID [2020-07-11 00:34:48,903 INFO L280 TraceCheckUtils]: 23: Hoare triple {260#(<= 3 |main_#t~ret2|)} ~result~0 := #t~ret2; {261#(<= 3 main_~result~0)} is VALID [2020-07-11 00:34:48,904 INFO L280 TraceCheckUtils]: 24: Hoare triple {261#(<= 3 main_~result~0)} havoc #t~ret2; {261#(<= 3 main_~result~0)} is VALID [2020-07-11 00:34:48,905 INFO L280 TraceCheckUtils]: 25: Hoare triple {261#(<= 3 main_~result~0)} assume !(~result~0 >= 0); {244#false} is VALID [2020-07-11 00:34:48,905 INFO L280 TraceCheckUtils]: 26: Hoare triple {244#false} assume !false; {244#false} is VALID [2020-07-11 00:34:48,907 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-11 00:34:48,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1844482665] [2020-07-11 00:34:48,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:48,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 00:34:48,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302716853] [2020-07-11 00:34:48,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-11 00:34:48,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:48,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 00:34:48,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:48,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 00:34:48,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:48,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 00:34:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-11 00:34:48,945 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2020-07-11 00:34:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:49,172 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-07-11 00:34:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 00:34:49,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-07-11 00:34:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-11 00:34:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 00:34:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-11 00:34:49,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2020-07-11 00:34:49,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:49,230 INFO L225 Difference]: With dead ends: 37 [2020-07-11 00:34:49,230 INFO L226 Difference]: Without dead ends: 31 [2020-07-11 00:34:49,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:34:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-11 00:34:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-11 00:34:49,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:49,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-11 00:34:49,262 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-11 00:34:49,262 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-11 00:34:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:49,265 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-11 00:34:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-11 00:34:49,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:49,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:49,267 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-11 00:34:49,267 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-11 00:34:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:49,270 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-11 00:34:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-11 00:34:49,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:49,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:49,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:49,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-11 00:34:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2020-07-11 00:34:49,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2020-07-11 00:34:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:49,275 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2020-07-11 00:34:49,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 00:34:49,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2020-07-11 00:34:49,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-11 00:34:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 00:34:49,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 00:34:49,317 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 00:34:49,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 00:34:49,318 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 00:34:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 00:34:49,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1929059777, now seen corresponding path program 2 times [2020-07-11 00:34:49,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 00:34:49,319 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1546626795] [2020-07-11 00:34:49,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 00:34:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:49,384 INFO L280 TraceCheckUtils]: 0: Hoare triple {474#true} assume true; {474#true} is VALID [2020-07-11 00:34:49,385 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {474#true} {474#true} #39#return; {474#true} is VALID [2020-07-11 00:34:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 00:34:49,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {474#true} assume 1 == ~n; {474#true} is VALID [2020-07-11 00:34:49,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {474#true} #res := 1; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {523#(= 1 |hanoi_#res|)} assume true; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,536 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {523#(= 1 |hanoi_#res|)} {474#true} #37#return; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {474#true} assume !(1 == ~n); {474#true} is VALID [2020-07-11 00:34:49,538 INFO L263 TraceCheckUtils]: 2: Hoare triple {474#true} call #t~ret0 := hanoi(~n - 1); {474#true} is VALID [2020-07-11 00:34:49,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,538 INFO L280 TraceCheckUtils]: 4: Hoare triple {474#true} assume 1 == ~n; {474#true} is VALID [2020-07-11 00:34:49,539 INFO L280 TraceCheckUtils]: 5: Hoare triple {474#true} #res := 1; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,540 INFO L280 TraceCheckUtils]: 6: Hoare triple {523#(= 1 |hanoi_#res|)} assume true; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,542 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {523#(= 1 |hanoi_#res|)} {474#true} #37#return; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {521#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#(= 1 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,545 INFO L280 TraceCheckUtils]: 10: Hoare triple {522#(<= 3 |hanoi_#res|)} havoc #t~ret0; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {522#(<= 3 |hanoi_#res|)} assume true; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,547 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {522#(<= 3 |hanoi_#res|)} {474#true} #37#return; {514#(<= 3 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {474#true} assume !(1 == ~n); {474#true} is VALID [2020-07-11 00:34:49,548 INFO L263 TraceCheckUtils]: 2: Hoare triple {474#true} call #t~ret0 := hanoi(~n - 1); {474#true} is VALID [2020-07-11 00:34:49,549 INFO L280 TraceCheckUtils]: 3: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,549 INFO L280 TraceCheckUtils]: 4: Hoare triple {474#true} assume !(1 == ~n); {474#true} is VALID [2020-07-11 00:34:49,549 INFO L263 TraceCheckUtils]: 5: Hoare triple {474#true} call #t~ret0 := hanoi(~n - 1); {474#true} is VALID [2020-07-11 00:34:49,550 INFO L280 TraceCheckUtils]: 6: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,550 INFO L280 TraceCheckUtils]: 7: Hoare triple {474#true} assume 1 == ~n; {474#true} is VALID [2020-07-11 00:34:49,551 INFO L280 TraceCheckUtils]: 8: Hoare triple {474#true} #res := 1; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,552 INFO L280 TraceCheckUtils]: 9: Hoare triple {523#(= 1 |hanoi_#res|)} assume true; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,553 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {523#(= 1 |hanoi_#res|)} {474#true} #37#return; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,555 INFO L280 TraceCheckUtils]: 12: Hoare triple {521#(= 1 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {522#(<= 3 |hanoi_#res|)} havoc #t~ret0; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {522#(<= 3 |hanoi_#res|)} assume true; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,558 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {522#(<= 3 |hanoi_#res|)} {474#true} #37#return; {514#(<= 3 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {514#(<= 3 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {514#(<= 3 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,560 INFO L280 TraceCheckUtils]: 17: Hoare triple {514#(<= 3 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {515#(<= 7 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,561 INFO L280 TraceCheckUtils]: 18: Hoare triple {515#(<= 7 |hanoi_#res|)} havoc #t~ret0; {515#(<= 7 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,562 INFO L280 TraceCheckUtils]: 19: Hoare triple {515#(<= 7 |hanoi_#res|)} assume true; {515#(<= 7 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,563 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {515#(<= 7 |hanoi_#res|)} {474#true} #43#return; {499#(<= 7 |main_#t~ret2|)} is VALID [2020-07-11 00:34:49,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2020-07-11 00:34:49,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2020-07-11 00:34:49,565 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #39#return; {474#true} is VALID [2020-07-11 00:34:49,566 INFO L263 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret3 := main(); {474#true} is VALID [2020-07-11 00:34:49,566 INFO L280 TraceCheckUtils]: 4: Hoare triple {474#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {474#true} is VALID [2020-07-11 00:34:49,566 INFO L280 TraceCheckUtils]: 5: Hoare triple {474#true} ~n~0 := #t~nondet1; {474#true} is VALID [2020-07-11 00:34:49,567 INFO L280 TraceCheckUtils]: 6: Hoare triple {474#true} havoc #t~nondet1; {474#true} is VALID [2020-07-11 00:34:49,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {474#true} assume !(~n~0 < 1 || ~n~0 > 31); {474#true} is VALID [2020-07-11 00:34:49,567 INFO L263 TraceCheckUtils]: 8: Hoare triple {474#true} call #t~ret2 := hanoi(~n~0); {474#true} is VALID [2020-07-11 00:34:49,568 INFO L280 TraceCheckUtils]: 9: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,568 INFO L280 TraceCheckUtils]: 10: Hoare triple {474#true} assume !(1 == ~n); {474#true} is VALID [2020-07-11 00:34:49,568 INFO L263 TraceCheckUtils]: 11: Hoare triple {474#true} call #t~ret0 := hanoi(~n - 1); {474#true} is VALID [2020-07-11 00:34:49,569 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,569 INFO L280 TraceCheckUtils]: 13: Hoare triple {474#true} assume !(1 == ~n); {474#true} is VALID [2020-07-11 00:34:49,569 INFO L263 TraceCheckUtils]: 14: Hoare triple {474#true} call #t~ret0 := hanoi(~n - 1); {474#true} is VALID [2020-07-11 00:34:49,569 INFO L280 TraceCheckUtils]: 15: Hoare triple {474#true} ~n := #in~n; {474#true} is VALID [2020-07-11 00:34:49,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {474#true} assume 1 == ~n; {474#true} is VALID [2020-07-11 00:34:49,571 INFO L280 TraceCheckUtils]: 17: Hoare triple {474#true} #res := 1; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,572 INFO L280 TraceCheckUtils]: 18: Hoare triple {523#(= 1 |hanoi_#res|)} assume true; {523#(= 1 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,573 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {523#(= 1 |hanoi_#res|)} {474#true} #37#return; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {521#(= 1 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {521#(= 1 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,575 INFO L280 TraceCheckUtils]: 21: Hoare triple {521#(= 1 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,575 INFO L280 TraceCheckUtils]: 22: Hoare triple {522#(<= 3 |hanoi_#res|)} havoc #t~ret0; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,576 INFO L280 TraceCheckUtils]: 23: Hoare triple {522#(<= 3 |hanoi_#res|)} assume true; {522#(<= 3 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,577 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {522#(<= 3 |hanoi_#res|)} {474#true} #37#return; {514#(<= 3 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,578 INFO L280 TraceCheckUtils]: 25: Hoare triple {514#(<= 3 |hanoi_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {514#(<= 3 |hanoi_#t~ret0|)} is VALID [2020-07-11 00:34:49,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {514#(<= 3 |hanoi_#t~ret0|)} #res := 1 + 2 * #t~ret0; {515#(<= 7 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,580 INFO L280 TraceCheckUtils]: 27: Hoare triple {515#(<= 7 |hanoi_#res|)} havoc #t~ret0; {515#(<= 7 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,581 INFO L280 TraceCheckUtils]: 28: Hoare triple {515#(<= 7 |hanoi_#res|)} assume true; {515#(<= 7 |hanoi_#res|)} is VALID [2020-07-11 00:34:49,582 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {515#(<= 7 |hanoi_#res|)} {474#true} #43#return; {499#(<= 7 |main_#t~ret2|)} is VALID [2020-07-11 00:34:49,583 INFO L280 TraceCheckUtils]: 30: Hoare triple {499#(<= 7 |main_#t~ret2|)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {499#(<= 7 |main_#t~ret2|)} is VALID [2020-07-11 00:34:49,584 INFO L280 TraceCheckUtils]: 31: Hoare triple {499#(<= 7 |main_#t~ret2|)} ~result~0 := #t~ret2; {500#(<= 7 main_~result~0)} is VALID [2020-07-11 00:34:49,584 INFO L280 TraceCheckUtils]: 32: Hoare triple {500#(<= 7 main_~result~0)} havoc #t~ret2; {500#(<= 7 main_~result~0)} is VALID [2020-07-11 00:34:49,585 INFO L280 TraceCheckUtils]: 33: Hoare triple {500#(<= 7 main_~result~0)} assume !(~result~0 >= 0); {475#false} is VALID [2020-07-11 00:34:49,586 INFO L280 TraceCheckUtils]: 34: Hoare triple {475#false} assume !false; {475#false} is VALID [2020-07-11 00:34:49,588 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-11 00:34:49,589 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1546626795] [2020-07-11 00:34:49,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 00:34:49,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 00:34:49,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054261847] [2020-07-11 00:34:49,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-07-11 00:34:49,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 00:34:49,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 00:34:49,651 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:49,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 00:34:49,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 00:34:49,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 00:34:49,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-11 00:34:49,653 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 9 states. [2020-07-11 00:34:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:49,938 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-11 00:34:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 00:34:49,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-07-11 00:34:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 00:34:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:34:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2020-07-11 00:34:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 00:34:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2020-07-11 00:34:49,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 32 transitions. [2020-07-11 00:34:49,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:49,986 INFO L225 Difference]: With dead ends: 31 [2020-07-11 00:34:49,987 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 00:34:49,988 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-11 00:34:49,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 00:34:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 00:34:49,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 00:34:49,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:49,989 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:49,989 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:49,989 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:49,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:49,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:49,990 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:49,990 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 00:34:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 00:34:49,990 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 00:34:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:49,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:49,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 00:34:49,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 00:34:49,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 00:34:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 00:34:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 00:34:49,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-07-11 00:34:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 00:34:49,992 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 00:34:49,992 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 00:34:49,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 00:34:49,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 00:34:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 00:34:49,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 00:34:49,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 00:34:49,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 00:34:50,187 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:50,188 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:50,188 INFO L264 CegarLoopResult]: At program point hanoiEXIT(lines 18 23) the Hoare annotation is: (or (<= 3 |hanoi_#res|) (= 1 |hanoi_#res|)) [2020-07-11 00:34:50,188 INFO L271 CegarLoopResult]: At program point hanoiENTRY(lines 18 23) the Hoare annotation is: true [2020-07-11 00:34:50,188 INFO L264 CegarLoopResult]: At program point hanoiFINAL(lines 18 23) the Hoare annotation is: (or (<= 3 |hanoi_#res|) (= 1 |hanoi_#res|)) [2020-07-11 00:34:50,189 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 00:34:50,189 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (or (<= 3 |hanoi_#t~ret0|) (= 1 |hanoi_#t~ret0|)) [2020-07-11 00:34:50,189 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-11 00:34:50,189 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (or (<= 3 |hanoi_#t~ret0|) (= 1 |hanoi_#t~ret0|)) [2020-07-11 00:34:50,189 INFO L271 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: true [2020-07-11 00:34:50,189 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (or (and (<= 3 |hanoi_#res|) (= 1 |hanoi_#t~ret0|)) (and (<= 7 |hanoi_#res|) (<= 3 |hanoi_#t~ret0|))) [2020-07-11 00:34:50,190 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 00:34:50,190 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 00:34:50,190 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 00:34:50,190 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 00:34:50,190 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-07-11 00:34:50,190 INFO L264 CegarLoopResult]: At program point L32(lines 32 36) the Hoare annotation is: (<= 1 main_~result~0) [2020-07-11 00:34:50,191 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) the Hoare annotation is: false [2020-07-11 00:34:50,191 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-07-11 00:34:50,191 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (<= 1 |main_#t~ret2|) [2020-07-11 00:34:50,191 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 37) the Hoare annotation is: true [2020-07-11 00:34:50,191 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-11 00:34:50,191 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (<= 1 |main_#t~ret2|) [2020-07-11 00:34:50,192 INFO L271 CegarLoopResult]: At program point L28(lines 28 30) the Hoare annotation is: true [2020-07-11 00:34:50,192 INFO L264 CegarLoopResult]: At program point L31-3(line 31) the Hoare annotation is: (and (<= 1 |main_#t~ret2|) (<= 1 main_~result~0)) [2020-07-11 00:34:50,192 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-07-11 00:34:50,192 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-07-11 00:34:50,192 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 37) the Hoare annotation is: true [2020-07-11 00:34:50,192 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 37) the Hoare annotation is: true [2020-07-11 00:34:50,193 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: false [2020-07-11 00:34:50,205 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 00:34:50,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 12:34:50 BoogieIcfgContainer [2020-07-11 00:34:50,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 00:34:50,224 INFO L168 Benchmark]: Toolchain (without parser) took 3254.69 ms. Allocated memory was 146.8 MB in the beginning and 242.7 MB in the end (delta: 95.9 MB). Free memory was 104.8 MB in the beginning and 129.7 MB in the end (delta: -24.9 MB). Peak memory consumption was 71.1 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:50,225 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 146.8 MB. Free memory was 123.5 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 00:34:50,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.57 ms. Allocated memory is still 146.8 MB. Free memory was 104.6 MB in the beginning and 95.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:50,232 INFO L168 Benchmark]: Boogie Preprocessor took 30.59 ms. Allocated memory is still 146.8 MB. Free memory was 95.0 MB in the beginning and 93.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:50,233 INFO L168 Benchmark]: RCFGBuilder took 419.45 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 93.6 MB in the beginning and 166.2 MB in the end (delta: -72.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:50,234 INFO L168 Benchmark]: TraceAbstraction took 2543.96 ms. Allocated memory was 203.9 MB in the beginning and 242.7 MB in the end (delta: 38.8 MB). Free memory was 166.2 MB in the beginning and 129.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. [2020-07-11 00:34:50,238 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.16 ms. Allocated memory is still 146.8 MB. Free memory was 123.5 MB in the beginning and 123.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.57 ms. Allocated memory is still 146.8 MB. Free memory was 104.6 MB in the beginning and 95.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.59 ms. Allocated memory is still 146.8 MB. Free memory was 95.0 MB in the beginning and 93.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 419.45 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 93.6 MB in the beginning and 166.2 MB in the end (delta: -72.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2543.96 ms. Allocated memory was 203.9 MB in the beginning and 242.7 MB in the end (delta: 38.8 MB). Free memory was 166.2 MB in the beginning and 129.7 MB in the end (delta: 36.4 MB). Peak memory consumption was 75.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 18]: Procedure Contract for hanoi Derived contract for procedure hanoi: 3 <= \result || 1 == \result - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 78 SDtfs, 9 SDslu, 339 SDs, 0 SdLazy, 92 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 30 LocationsWithAnnotation, 39 PreInvPairs, 68 NumberOfFragments, 80 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 30 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 4032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 12/20 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...