/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/recHanoi01.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.25-8fc6572
[2020-07-10 18:36:17,953 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-10 18:36:17,955 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 18:36:17,972 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 18:36:17,972 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 18:36:17,974 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 18:36:17,975 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 18:36:17,985 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 18:36:17,988 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 18:36:17,990 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 18:36:17,992 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 18:36:17,994 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 18:36:17,994 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 18:36:17,996 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 18:36:17,998 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 18:36:17,999 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 18:36:18,000 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 18:36:18,001 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 18:36:18,002 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 18:36:18,007 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 18:36:18,011 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 18:36:18,014 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 18:36:18,015 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 18:36:18,016 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 18:36:18,018 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 18:36:18,018 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 18:36:18,018 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 18:36:18,022 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 18:36:18,023 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 18:36:18,023 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 18:36:18,024 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 18:36:18,024 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 18:36:18,025 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 18:36:18,026 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 18:36:18,027 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 18:36:18,027 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 18:36:18,027 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 18:36:18,028 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 18:36:18,028 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 18:36:18,029 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 18:36:18,030 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 18:36:18,031 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-10 18:36:18,058 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-10 18:36:18,058 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 18:36:18,061 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 18:36:18,062 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-10 18:36:18,062 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-10 18:36:18,062 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-10 18:36:18,062 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-10 18:36:18,062 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 18:36:18,062 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 18:36:18,063 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 18:36:18,063 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-10 18:36:18,063 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-10 18:36:18,063 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-10 18:36:18,063 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-10 18:36:18,064 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 18:36:18,064 INFO  L138        SettingsManager]:  * Size of a code block=SingleStatement
[2020-07-10 18:36:18,064 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-10 18:36:18,066 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-10 18:36:18,066 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 18:36:18,067 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 18:36:18,067 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-10 18:36:18,067 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 18:36:18,067 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
[2020-07-10 18:36:18,366 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 18:36:18,387 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 18:36:18,390 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 18:36:18,392 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-10 18:36:18,392 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-10 18:36:18,393 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi01.c
[2020-07-10 18:36:18,464 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28253c63b/30e2360dc7814beca30553c41d3f26e8/FLAG65dcd0e93
[2020-07-10 18:36:18,884 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-10 18:36:18,884 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi01.c
[2020-07-10 18:36:18,891 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28253c63b/30e2360dc7814beca30553c41d3f26e8/FLAG65dcd0e93
[2020-07-10 18:36:19,278 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28253c63b/30e2360dc7814beca30553c41d3f26e8
[2020-07-10 18:36:19,287 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 18:36:19,289 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 18:36:19,290 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 18:36:19,290 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 18:36:19,295 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 18:36:19,296 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,299 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798f75a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19, skipping insertion in model container
[2020-07-10 18:36:19,300 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,308 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-10 18:36:19,329 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-10 18:36:19,524 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-10 18:36:19,529 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-10 18:36:19,547 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-10 18:36:19,562 INFO  L208         MainTranslator]: Completed translation
[2020-07-10 18:36:19,562 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19 WrapperNode
[2020-07-10 18:36:19,562 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 18:36:19,563 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 18:36:19,563 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 18:36:19,563 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 18:36:19,575 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,575 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,579 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,579 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,584 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,586 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,587 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (1/1) ...
[2020-07-10 18:36:19,589 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 18:36:19,589 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 18:36:19,589 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 18:36:19,590 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-10 18:36:19,590 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (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-10 18:36:19,740 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 18:36:19,746 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 18:36:19,746 INFO  L138     BoogieDeclarations]: Found implementation of procedure hanoi
[2020-07-10 18:36:19,746 INFO  L138     BoogieDeclarations]: Found implementation of procedure applyHanoi
[2020-07-10 18:36:19,746 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 18:36:19,746 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 18:36:19,746 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 18:36:19,746 INFO  L130     BoogieDeclarations]: Found specification of procedure hanoi
[2020-07-10 18:36:19,747 INFO  L130     BoogieDeclarations]: Found specification of procedure applyHanoi
[2020-07-10 18:36:19,747 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-10 18:36:19,747 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 18:36:19,747 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 18:36:20,092 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 18:36:20,092 INFO  L295             CfgBuilder]: Removed 0 assume(true) statements.
[2020-07-10 18:36:20,097 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:20 BoogieIcfgContainer
[2020-07-10 18:36:20,098 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 18:36:20,099 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 18:36:20,099 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 18:36:20,102 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-10 18:36:20,102 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 06:36:19" (1/3) ...
[2020-07-10 18:36:20,103 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8734e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:20, skipping insertion in model container
[2020-07-10 18:36:20,103 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 06:36:19" (2/3) ...
[2020-07-10 18:36:20,104 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8734e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 06:36:20, skipping insertion in model container
[2020-07-10 18:36:20,104 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 06:36:20" (3/3) ...
[2020-07-10 18:36:20,105 INFO  L109   eAbstractionObserver]: Analyzing ICFG recHanoi01.c
[2020-07-10 18:36:20,114 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-10 18:36:20,121 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 18:36:20,134 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 18:36:20,154 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-10 18:36:20,154 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-10 18:36:20,154 INFO  L377      AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2020-07-10 18:36:20,154 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 18:36:20,154 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 18:36:20,155 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-10 18:36:20,155 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 18:36:20,155 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 18:36:20,167 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states.
[2020-07-10 18:36:20,177 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2020-07-10 18:36:20,178 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 18:36:20,179 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 18:36:20,179 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 18:36:20,184 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 18:36:20,184 INFO  L82        PathProgramCache]: Analyzing trace with hash -1892500808, now seen corresponding path program 1 times
[2020-07-10 18:36:20,190 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 18:36:20,191 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100283452]
[2020-07-10 18:36:20,191 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 18:36:20,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:20,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:20,425 INFO  L280        TraceCheckUtils]: 0: Hoare triple {66#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {48#true} is VALID
[2020-07-10 18:36:20,425 INFO  L280        TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-10 18:36:20,426 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #60#return; {48#true} is VALID
[2020-07-10 18:36:20,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:20,481 INFO  L280        TraceCheckUtils]: 0: Hoare triple {66#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,482 INFO  L280        TraceCheckUtils]: 1: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} ~from := #in~from; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,483 INFO  L280        TraceCheckUtils]: 2: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} ~to := #in~to; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,484 INFO  L280        TraceCheckUtils]: 3: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} ~via := #in~via; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,485 INFO  L280        TraceCheckUtils]: 4: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} assume 0 == ~n; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,486 INFO  L280        TraceCheckUtils]: 5: Hoare triple {68#(= 0 |applyHanoi_#in~n|)} assume true; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,489 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {68#(= 0 |applyHanoi_#in~n|)} {53#(<= 1 main_~n~0)} #64#return; {49#false} is VALID
[2020-07-10 18:36:20,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:20,498 INFO  L280        TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID
[2020-07-10 18:36:20,498 INFO  L280        TraceCheckUtils]: 1: Hoare triple {48#true} assume 1 == ~n; {48#true} is VALID
[2020-07-10 18:36:20,499 INFO  L280        TraceCheckUtils]: 2: Hoare triple {48#true} #res := 1; {48#true} is VALID
[2020-07-10 18:36:20,499 INFO  L280        TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-10 18:36:20,500 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {48#true} {49#false} #66#return; {49#false} is VALID
[2020-07-10 18:36:20,501 INFO  L263        TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {66#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:20,501 INFO  L280        TraceCheckUtils]: 1: Hoare triple {66#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {48#true} is VALID
[2020-07-10 18:36:20,502 INFO  L280        TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-10 18:36:20,503 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #60#return; {48#true} is VALID
[2020-07-10 18:36:20,503 INFO  L263        TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID
[2020-07-10 18:36:20,503 INFO  L280        TraceCheckUtils]: 5: Hoare triple {48#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {48#true} is VALID
[2020-07-10 18:36:20,504 INFO  L280        TraceCheckUtils]: 6: Hoare triple {48#true} ~n~0 := #t~nondet2; {48#true} is VALID
[2020-07-10 18:36:20,504 INFO  L280        TraceCheckUtils]: 7: Hoare triple {48#true} havoc #t~nondet2; {48#true} is VALID
[2020-07-10 18:36:20,506 INFO  L280        TraceCheckUtils]: 8: Hoare triple {48#true} assume !(~n~0 < 1 || ~n~0 > 31); {53#(<= 1 main_~n~0)} is VALID
[2020-07-10 18:36:20,507 INFO  L280        TraceCheckUtils]: 9: Hoare triple {53#(<= 1 main_~n~0)} ~counter~0 := 0; {53#(<= 1 main_~n~0)} is VALID
[2020-07-10 18:36:20,509 INFO  L263        TraceCheckUtils]: 10: Hoare triple {53#(<= 1 main_~n~0)} call applyHanoi(~n~0, 1, 3, 2); {66#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:20,510 INFO  L280        TraceCheckUtils]: 11: Hoare triple {66#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,510 INFO  L280        TraceCheckUtils]: 12: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} ~from := #in~from; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,511 INFO  L280        TraceCheckUtils]: 13: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} ~to := #in~to; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,512 INFO  L280        TraceCheckUtils]: 14: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} ~via := #in~via; {67#(= applyHanoi_~n |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,513 INFO  L280        TraceCheckUtils]: 15: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} assume 0 == ~n; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,514 INFO  L280        TraceCheckUtils]: 16: Hoare triple {68#(= 0 |applyHanoi_#in~n|)} assume true; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-10 18:36:20,516 INFO  L275        TraceCheckUtils]: 17: Hoare quadruple {68#(= 0 |applyHanoi_#in~n|)} {53#(<= 1 main_~n~0)} #64#return; {49#false} is VALID
[2020-07-10 18:36:20,517 INFO  L263        TraceCheckUtils]: 18: Hoare triple {49#false} call #t~ret3 := hanoi(~n~0); {48#true} is VALID
[2020-07-10 18:36:20,517 INFO  L280        TraceCheckUtils]: 19: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID
[2020-07-10 18:36:20,518 INFO  L280        TraceCheckUtils]: 20: Hoare triple {48#true} assume 1 == ~n; {48#true} is VALID
[2020-07-10 18:36:20,518 INFO  L280        TraceCheckUtils]: 21: Hoare triple {48#true} #res := 1; {48#true} is VALID
[2020-07-10 18:36:20,519 INFO  L280        TraceCheckUtils]: 22: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-10 18:36:20,519 INFO  L275        TraceCheckUtils]: 23: Hoare quadruple {48#true} {49#false} #66#return; {49#false} is VALID
[2020-07-10 18:36:20,519 INFO  L280        TraceCheckUtils]: 24: Hoare triple {49#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {49#false} is VALID
[2020-07-10 18:36:20,520 INFO  L280        TraceCheckUtils]: 25: Hoare triple {49#false} ~result~0 := #t~ret3; {49#false} is VALID
[2020-07-10 18:36:20,520 INFO  L280        TraceCheckUtils]: 26: Hoare triple {49#false} havoc #t~ret3; {49#false} is VALID
[2020-07-10 18:36:20,521 INFO  L280        TraceCheckUtils]: 27: Hoare triple {49#false} assume !(~result~0 == ~counter~0); {49#false} is VALID
[2020-07-10 18:36:20,521 INFO  L280        TraceCheckUtils]: 28: Hoare triple {49#false} assume !false; {49#false} is VALID
[2020-07-10 18:36:20,526 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-10 18:36:20,527 INFO  L185   leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-10 18:36:20,529 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100283452]
[2020-07-10 18:36:20,531 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 18:36:20,531 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-07-10 18:36:20,532 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115389686]
[2020-07-10 18:36:20,538 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 29
[2020-07-10 18:36:20,541 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-10 18:36:20,544 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states.
[2020-07-10 18:36:20,619 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-10 18:36:20,619 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-07-10 18:36:20,619 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-10 18:36:20,628 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-10 18:36:20,629 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-07-10 18:36:20,632 INFO  L87              Difference]: Start difference. First operand 45 states. Second operand 6 states.
[2020-07-10 18:36:21,239 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 18:36:21,240 INFO  L93              Difference]: Finished difference Result 70 states and 80 transitions.
[2020-07-10 18:36:21,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-07-10 18:36:21,241 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 29
[2020-07-10 18:36:21,242 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 18:36:21,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-10 18:36:21,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions.
[2020-07-10 18:36:21,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-10 18:36:21,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions.
[2020-07-10 18:36:21,284 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions.
[2020-07-10 18:36:21,390 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 18:36:21,412 INFO  L225             Difference]: With dead ends: 70
[2020-07-10 18:36:21,412 INFO  L226             Difference]: Without dead ends: 41
[2020-07-10 18:36:21,423 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2020-07-10 18:36:21,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2020-07-10 18:36:21,511 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2020-07-10 18:36:21,512 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 18:36:21,512 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states.
[2020-07-10 18:36:21,513 INFO  L74              IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states.
[2020-07-10 18:36:21,513 INFO  L87              Difference]: Start difference. First operand 41 states. Second operand 41 states.
[2020-07-10 18:36:21,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 18:36:21,520 INFO  L93              Difference]: Finished difference Result 41 states and 46 transitions.
[2020-07-10 18:36:21,520 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2020-07-10 18:36:21,521 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 18:36:21,521 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 18:36:21,522 INFO  L74              IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states.
[2020-07-10 18:36:21,522 INFO  L87              Difference]: Start difference. First operand 41 states. Second operand 41 states.
[2020-07-10 18:36:21,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 18:36:21,527 INFO  L93              Difference]: Finished difference Result 41 states and 46 transitions.
[2020-07-10 18:36:21,527 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2020-07-10 18:36:21,528 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 18:36:21,528 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 18:36:21,529 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-10 18:36:21,529 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 18:36:21,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-07-10 18:36:21,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions.
[2020-07-10 18:36:21,535 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29
[2020-07-10 18:36:21,535 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-10 18:36:21,535 INFO  L479      AbstractCegarLoop]: Abstraction has 41 states and 46 transitions.
[2020-07-10 18:36:21,535 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-07-10 18:36:21,536 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 46 transitions.
[2020-07-10 18:36:21,596 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 18:36:21,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2020-07-10 18:36:21,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2020-07-10 18:36:21,599 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 18:36:21,599 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 18:36:21,599 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 18:36:21,600 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 18:36:21,600 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 18:36:21,600 INFO  L82        PathProgramCache]: Analyzing trace with hash -165736076, now seen corresponding path program 1 times
[2020-07-10 18:36:21,601 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 18:36:21,601 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [293788873]
[2020-07-10 18:36:21,601 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 18:36:21,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:21,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:21,781 INFO  L280        TraceCheckUtils]: 0: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {381#true} is VALID
[2020-07-10 18:36:21,781 INFO  L280        TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID
[2020-07-10 18:36:21,782 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #60#return; {381#true} is VALID
[2020-07-10 18:36:21,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:21,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:21,974 INFO  L280        TraceCheckUtils]: 0: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:21,975 INFO  L280        TraceCheckUtils]: 1: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:21,976 INFO  L280        TraceCheckUtils]: 2: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:21,981 INFO  L280        TraceCheckUtils]: 3: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:21,982 INFO  L280        TraceCheckUtils]: 4: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume 0 == ~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:21,982 INFO  L280        TraceCheckUtils]: 5: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:21,985 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {421#(= ~counter~0 |old(~counter~0)|)} {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} #54#return; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:21,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:22,005 INFO  L280        TraceCheckUtils]: 0: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,007 INFO  L280        TraceCheckUtils]: 1: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,008 INFO  L280        TraceCheckUtils]: 2: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,009 INFO  L280        TraceCheckUtils]: 3: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,010 INFO  L280        TraceCheckUtils]: 4: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume 0 == ~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,011 INFO  L280        TraceCheckUtils]: 5: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,013 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {421#(= ~counter~0 |old(~counter~0)|)} {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} #56#return; {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} is VALID
[2020-07-10 18:36:22,015 INFO  L280        TraceCheckUtils]: 0: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,016 INFO  L280        TraceCheckUtils]: 1: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,017 INFO  L280        TraceCheckUtils]: 2: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,018 INFO  L280        TraceCheckUtils]: 3: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,019 INFO  L280        TraceCheckUtils]: 4: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume !(0 == ~n); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,019 INFO  L280        TraceCheckUtils]: 5: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} #t~post1 := ~counter~0; {422#(= |old(~counter~0)| |applyHanoi_#t~post1|)} is VALID
[2020-07-10 18:36:22,020 INFO  L280        TraceCheckUtils]: 6: Hoare triple {422#(= |old(~counter~0)| |applyHanoi_#t~post1|)} ~counter~0 := 1 + #t~post1; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:22,022 INFO  L280        TraceCheckUtils]: 7: Hoare triple {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} havoc #t~post1; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:22,023 INFO  L263        TraceCheckUtils]: 8: Hoare triple {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} call applyHanoi(~n - 1, ~from, ~via, ~to); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,025 INFO  L280        TraceCheckUtils]: 9: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,026 INFO  L280        TraceCheckUtils]: 10: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,027 INFO  L280        TraceCheckUtils]: 11: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,029 INFO  L280        TraceCheckUtils]: 12: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,030 INFO  L280        TraceCheckUtils]: 13: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume 0 == ~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,042 INFO  L280        TraceCheckUtils]: 14: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,044 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {421#(= ~counter~0 |old(~counter~0)|)} {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} #54#return; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:22,046 INFO  L263        TraceCheckUtils]: 16: Hoare triple {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} call applyHanoi(~n - 1, ~via, ~to, ~from); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,046 INFO  L280        TraceCheckUtils]: 17: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,047 INFO  L280        TraceCheckUtils]: 18: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,048 INFO  L280        TraceCheckUtils]: 19: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,048 INFO  L280        TraceCheckUtils]: 20: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,049 INFO  L280        TraceCheckUtils]: 21: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume 0 == ~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,050 INFO  L280        TraceCheckUtils]: 22: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,052 INFO  L275        TraceCheckUtils]: 23: Hoare quadruple {421#(= ~counter~0 |old(~counter~0)|)} {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} #56#return; {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} is VALID
[2020-07-10 18:36:22,053 INFO  L280        TraceCheckUtils]: 24: Hoare triple {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} assume true; {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} is VALID
[2020-07-10 18:36:22,054 INFO  L275        TraceCheckUtils]: 25: Hoare quadruple {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} {386#(and (<= 0 ~counter~0) (<= ~counter~0 0))} #64#return; {413#(= ~counter~0 1)} is VALID
[2020-07-10 18:36:22,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 18:36:22,082 INFO  L280        TraceCheckUtils]: 0: Hoare triple {381#true} ~n := #in~n; {381#true} is VALID
[2020-07-10 18:36:22,082 INFO  L280        TraceCheckUtils]: 1: Hoare triple {381#true} assume 1 == ~n; {381#true} is VALID
[2020-07-10 18:36:22,083 INFO  L280        TraceCheckUtils]: 2: Hoare triple {381#true} #res := 1; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-10 18:36:22,084 INFO  L280        TraceCheckUtils]: 3: Hoare triple {439#(= 1 |hanoi_#res|)} assume true; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-10 18:36:22,085 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {439#(= 1 |hanoi_#res|)} {413#(= ~counter~0 1)} #66#return; {419#(= ~counter~0 |main_#t~ret3|)} is VALID
[2020-07-10 18:36:22,086 INFO  L263        TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,086 INFO  L280        TraceCheckUtils]: 1: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {381#true} is VALID
[2020-07-10 18:36:22,086 INFO  L280        TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID
[2020-07-10 18:36:22,087 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #60#return; {381#true} is VALID
[2020-07-10 18:36:22,087 INFO  L263        TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret4 := main(); {381#true} is VALID
[2020-07-10 18:36:22,087 INFO  L280        TraceCheckUtils]: 5: Hoare triple {381#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {381#true} is VALID
[2020-07-10 18:36:22,088 INFO  L280        TraceCheckUtils]: 6: Hoare triple {381#true} ~n~0 := #t~nondet2; {381#true} is VALID
[2020-07-10 18:36:22,088 INFO  L280        TraceCheckUtils]: 7: Hoare triple {381#true} havoc #t~nondet2; {381#true} is VALID
[2020-07-10 18:36:22,088 INFO  L280        TraceCheckUtils]: 8: Hoare triple {381#true} assume !(~n~0 < 1 || ~n~0 > 31); {381#true} is VALID
[2020-07-10 18:36:22,089 INFO  L280        TraceCheckUtils]: 9: Hoare triple {381#true} ~counter~0 := 0; {386#(and (<= 0 ~counter~0) (<= ~counter~0 0))} is VALID
[2020-07-10 18:36:22,090 INFO  L263        TraceCheckUtils]: 10: Hoare triple {386#(and (<= 0 ~counter~0) (<= ~counter~0 0))} call applyHanoi(~n~0, 1, 3, 2); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,091 INFO  L280        TraceCheckUtils]: 11: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,092 INFO  L280        TraceCheckUtils]: 12: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,092 INFO  L280        TraceCheckUtils]: 13: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,093 INFO  L280        TraceCheckUtils]: 14: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,094 INFO  L280        TraceCheckUtils]: 15: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume !(0 == ~n); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,094 INFO  L280        TraceCheckUtils]: 16: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} #t~post1 := ~counter~0; {422#(= |old(~counter~0)| |applyHanoi_#t~post1|)} is VALID
[2020-07-10 18:36:22,095 INFO  L280        TraceCheckUtils]: 17: Hoare triple {422#(= |old(~counter~0)| |applyHanoi_#t~post1|)} ~counter~0 := 1 + #t~post1; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:22,096 INFO  L280        TraceCheckUtils]: 18: Hoare triple {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} havoc #t~post1; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:22,098 INFO  L263        TraceCheckUtils]: 19: Hoare triple {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} call applyHanoi(~n - 1, ~from, ~via, ~to); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,098 INFO  L280        TraceCheckUtils]: 20: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,099 INFO  L280        TraceCheckUtils]: 21: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,099 INFO  L280        TraceCheckUtils]: 22: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,100 INFO  L280        TraceCheckUtils]: 23: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,101 INFO  L280        TraceCheckUtils]: 24: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume 0 == ~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,101 INFO  L280        TraceCheckUtils]: 25: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,103 INFO  L275        TraceCheckUtils]: 26: Hoare quadruple {421#(= ~counter~0 |old(~counter~0)|)} {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} #54#return; {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} is VALID
[2020-07-10 18:36:22,104 INFO  L263        TraceCheckUtils]: 27: Hoare triple {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} call applyHanoi(~n - 1, ~via, ~to, ~from); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,105 INFO  L280        TraceCheckUtils]: 28: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~n := #in~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,106 INFO  L280        TraceCheckUtils]: 29: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~from := #in~from; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,106 INFO  L280        TraceCheckUtils]: 30: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~to := #in~to; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,107 INFO  L280        TraceCheckUtils]: 31: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~via := #in~via; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,108 INFO  L280        TraceCheckUtils]: 32: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume 0 == ~n; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,108 INFO  L280        TraceCheckUtils]: 33: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-10 18:36:22,110 INFO  L275        TraceCheckUtils]: 34: Hoare quadruple {421#(= ~counter~0 |old(~counter~0)|)} {423#(and (<= ~counter~0 (+ |old(~counter~0)| 1)) (<= (+ |old(~counter~0)| 1) ~counter~0))} #56#return; {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} is VALID
[2020-07-10 18:36:22,111 INFO  L280        TraceCheckUtils]: 35: Hoare triple {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} assume true; {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} is VALID
[2020-07-10 18:36:22,113 INFO  L275        TraceCheckUtils]: 36: Hoare quadruple {438#(and (or (< 0 ~counter~0) (<= (+ |old(~counter~0)| 1) ~counter~0)) (or (<= ~counter~0 1) (<= ~counter~0 (+ |old(~counter~0)| 1))))} {386#(and (<= 0 ~counter~0) (<= ~counter~0 0))} #64#return; {413#(= ~counter~0 1)} is VALID
[2020-07-10 18:36:22,113 INFO  L263        TraceCheckUtils]: 37: Hoare triple {413#(= ~counter~0 1)} call #t~ret3 := hanoi(~n~0); {381#true} is VALID
[2020-07-10 18:36:22,113 INFO  L280        TraceCheckUtils]: 38: Hoare triple {381#true} ~n := #in~n; {381#true} is VALID
[2020-07-10 18:36:22,114 INFO  L280        TraceCheckUtils]: 39: Hoare triple {381#true} assume 1 == ~n; {381#true} is VALID
[2020-07-10 18:36:22,114 INFO  L280        TraceCheckUtils]: 40: Hoare triple {381#true} #res := 1; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-10 18:36:22,115 INFO  L280        TraceCheckUtils]: 41: Hoare triple {439#(= 1 |hanoi_#res|)} assume true; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-10 18:36:22,116 INFO  L275        TraceCheckUtils]: 42: Hoare quadruple {439#(= 1 |hanoi_#res|)} {413#(= ~counter~0 1)} #66#return; {419#(= ~counter~0 |main_#t~ret3|)} is VALID
[2020-07-10 18:36:22,117 INFO  L280        TraceCheckUtils]: 43: Hoare triple {419#(= ~counter~0 |main_#t~ret3|)} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {419#(= ~counter~0 |main_#t~ret3|)} is VALID
[2020-07-10 18:36:22,118 INFO  L280        TraceCheckUtils]: 44: Hoare triple {419#(= ~counter~0 |main_#t~ret3|)} ~result~0 := #t~ret3; {420#(= ~counter~0 main_~result~0)} is VALID
[2020-07-10 18:36:22,118 INFO  L280        TraceCheckUtils]: 45: Hoare triple {420#(= ~counter~0 main_~result~0)} havoc #t~ret3; {420#(= ~counter~0 main_~result~0)} is VALID
[2020-07-10 18:36:22,119 INFO  L280        TraceCheckUtils]: 46: Hoare triple {420#(= ~counter~0 main_~result~0)} assume !(~result~0 == ~counter~0); {382#false} is VALID
[2020-07-10 18:36:22,123 INFO  L280        TraceCheckUtils]: 47: Hoare triple {382#false} assume !false; {382#false} is VALID
[2020-07-10 18:36:22,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2020-07-10 18:36:22,126 INFO  L185   leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-10 18:36:22,127 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [293788873]
[2020-07-10 18:36:22,127 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 18:36:22,127 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-10 18:36:22,127 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191528737]
[2020-07-10 18:36:22,128 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 48
[2020-07-10 18:36:22,128 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-10 18:36:22,128 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-10 18:36:22,176 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-10 18:36:22,176 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-10 18:36:22,177 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-10 18:36:22,177 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-10 18:36:22,177 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2020-07-10 18:36:22,177 INFO  L87              Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 11 states.
[2020-07-10 18:36:23,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 18:36:23,744 INFO  L93              Difference]: Finished difference Result 93 states and 110 transitions.
[2020-07-10 18:36:23,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2020-07-10 18:36:23,744 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 48
[2020-07-10 18:36:23,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 18:36:23,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-10 18:36:23,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions.
[2020-07-10 18:36:23,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-10 18:36:23,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions.
[2020-07-10 18:36:23,769 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 110 transitions.
[2020-07-10 18:36:23,932 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 18:36:23,943 INFO  L225             Difference]: With dead ends: 93
[2020-07-10 18:36:23,945 INFO  L226             Difference]: Without dead ends: 85
[2020-07-10 18:36:23,949 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552
[2020-07-10 18:36:23,949 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2020-07-10 18:36:24,088 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75.
[2020-07-10 18:36:24,088 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 18:36:24,089 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 75 states.
[2020-07-10 18:36:24,089 INFO  L74              IsIncluded]: Start isIncluded. First operand 85 states. Second operand 75 states.
[2020-07-10 18:36:24,089 INFO  L87              Difference]: Start difference. First operand 85 states. Second operand 75 states.
[2020-07-10 18:36:24,096 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 18:36:24,097 INFO  L93              Difference]: Finished difference Result 85 states and 102 transitions.
[2020-07-10 18:36:24,097 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions.
[2020-07-10 18:36:24,098 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 18:36:24,098 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 18:36:24,099 INFO  L74              IsIncluded]: Start isIncluded. First operand 75 states. Second operand 85 states.
[2020-07-10 18:36:24,099 INFO  L87              Difference]: Start difference. First operand 75 states. Second operand 85 states.
[2020-07-10 18:36:24,106 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 18:36:24,106 INFO  L93              Difference]: Finished difference Result 85 states and 102 transitions.
[2020-07-10 18:36:24,106 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions.
[2020-07-10 18:36:24,108 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 18:36:24,108 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 18:36:24,108 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-10 18:36:24,108 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 18:36:24,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2020-07-10 18:36:24,113 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions.
[2020-07-10 18:36:24,113 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 48
[2020-07-10 18:36:24,114 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-10 18:36:24,114 INFO  L479      AbstractCegarLoop]: Abstraction has 75 states and 92 transitions.
[2020-07-10 18:36:24,114 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-10 18:36:24,114 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 92 transitions.
[2020-07-10 18:36:24,230 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 18:36:24,230 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions.
[2020-07-10 18:36:24,233 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2020-07-10 18:36:24,234 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 18:36:24,234 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 18:36:24,234 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-10 18:36:24,234 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 18:36:24,235 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 18:36:24,235 INFO  L82        PathProgramCache]: Analyzing trace with hash 492898986, now seen corresponding path program 1 times
[2020-07-10 18:36:24,235 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 18:36:24,235 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457499025]
[2020-07-10 18:36:24,235 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 18:36:24,259 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-10 18:36:24,259 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.NullPointerException
	at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442)
	at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277)
	at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.<init>(AcceleratedInterpolation.java:184)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:75)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:127)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2020-07-10 18:36:24,264 INFO  L168              Benchmark]: Toolchain (without parser) took 4974.88 ms. Allocated memory was 139.5 MB in the beginning and 274.2 MB in the end (delta: 134.7 MB). Free memory was 103.6 MB in the beginning and 133.4 MB in the end (delta: -29.8 MB). Peak memory consumption was 104.9 MB. Max. memory is 7.1 GB.
[2020-07-10 18:36:24,265 INFO  L168              Benchmark]: CDTParser took 0.99 ms. Allocated memory is still 139.5 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-10 18:36:24,266 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 272.31 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 93.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB.
[2020-07-10 18:36:24,266 INFO  L168              Benchmark]: Boogie Preprocessor took 25.94 ms. Allocated memory is still 139.5 MB. Free memory was 93.0 MB in the beginning and 91.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB.
[2020-07-10 18:36:24,267 INFO  L168              Benchmark]: RCFGBuilder took 508.58 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 161.8 MB in the end (delta: -70.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB.
[2020-07-10 18:36:24,268 INFO  L168              Benchmark]: TraceAbstraction took 4162.86 ms. Allocated memory was 203.9 MB in the beginning and 274.2 MB in the end (delta: 70.3 MB). Free memory was 161.8 MB in the beginning and 133.4 MB in the end (delta: 28.3 MB). Peak memory consumption was 98.6 MB. Max. memory is 7.1 GB.
[2020-07-10 18:36:24,272 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.99 ms. Allocated memory is still 139.5 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 272.31 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 93.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 25.94 ms. Allocated memory is still 139.5 MB. Free memory was 93.0 MB in the beginning and 91.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 508.58 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 91.3 MB in the beginning and 161.8 MB in the end (delta: -70.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 4162.86 ms. Allocated memory was 203.9 MB in the beginning and 274.2 MB in the end (delta: 70.3 MB). Free memory was 161.8 MB in the beginning and 133.4 MB in the end (delta: 28.3 MB). Peak memory consumption was 98.6 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - ExceptionOrErrorResult: NullPointerException: null
    de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Received shutdown request...