/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-46f3038-m
[2020-07-08 15:55:03,136 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-08 15:55:03,138 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-08 15:55:03,150 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-08 15:55:03,151 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-08 15:55:03,152 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-08 15:55:03,153 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-08 15:55:03,155 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-08 15:55:03,157 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-08 15:55:03,158 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-08 15:55:03,158 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-08 15:55:03,160 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-08 15:55:03,160 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-08 15:55:03,161 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-08 15:55:03,162 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-08 15:55:03,163 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-08 15:55:03,164 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-08 15:55:03,164 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-08 15:55:03,166 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-08 15:55:03,168 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-08 15:55:03,169 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-08 15:55:03,170 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-08 15:55:03,171 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-08 15:55:03,172 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-08 15:55:03,175 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-08 15:55:03,175 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-08 15:55:03,175 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-08 15:55:03,176 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-08 15:55:03,176 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-08 15:55:03,177 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-08 15:55:03,178 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-08 15:55:03,178 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-08 15:55:03,179 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-08 15:55:03,180 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-08 15:55:03,181 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-08 15:55:03,181 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-08 15:55:03,182 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-08 15:55:03,182 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-08 15:55:03,182 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-08 15:55:03,183 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-08 15:55:03,184 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-08 15:55:03,185 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-08 15:55:03,193 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-08 15:55:03,194 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-08 15:55:03,195 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-08 15:55:03,195 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-08 15:55:03,195 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-08 15:55:03,196 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-08 15:55:03,196 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-08 15:55:03,196 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-08 15:55:03,196 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-08 15:55:03,196 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-08 15:55:03,197 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-08 15:55:03,197 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-08 15:55:03,197 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-08 15:55:03,197 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-08 15:55:03,197 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-08 15:55:03,198 INFO  L138        SettingsManager]:  * Size of a code block=SingleStatement
[2020-07-08 15:55:03,198 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-08 15:55:03,198 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-08 15:55:03,198 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-08 15:55:03,199 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-08 15:55:03,199 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-08 15:55:03,199 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-08 15:55:03,199 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
[2020-07-08 15:55:03,481 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-08 15:55:03,499 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-08 15:55:03,502 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-08 15:55:03,504 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-08 15:55:03,505 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-08 15:55:03,506 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/recHanoi01.c
[2020-07-08 15:55:03,572 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf3424ec/8fe670e294e245d9833c625ec3678e4f/FLAG7e71bbeef
[2020-07-08 15:55:03,992 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-08 15:55:03,993 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/recHanoi01.c
[2020-07-08 15:55:03,999 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf3424ec/8fe670e294e245d9833c625ec3678e4f/FLAG7e71bbeef
[2020-07-08 15:55:04,415 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf3424ec/8fe670e294e245d9833c625ec3678e4f
[2020-07-08 15:55:04,426 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-08 15:55:04,428 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-08 15:55:04,431 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-08 15:55:04,431 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-08 15:55:04,435 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-08 15:55:04,436 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,440 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f59cc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04, skipping insertion in model container
[2020-07-08 15:55:04,441 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,450 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-08 15:55:04,471 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-08 15:55:04,654 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-08 15:55:04,659 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-08 15:55:04,679 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-08 15:55:04,694 INFO  L208         MainTranslator]: Completed translation
[2020-07-08 15:55:04,695 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04 WrapperNode
[2020-07-08 15:55:04,695 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-08 15:55:04,696 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-08 15:55:04,696 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-08 15:55:04,696 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-08 15:55:04,710 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,710 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,716 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,716 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,722 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,725 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,726 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (1/1) ...
[2020-07-08 15:55:04,727 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-08 15:55:04,728 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-08 15:55:04,728 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-08 15:55:04,728 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-08 15:55:04,729 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (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-08 15:55:04,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-08 15:55:04,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-08 15:55:04,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure hanoi
[2020-07-08 15:55:04,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure applyHanoi
[2020-07-08 15:55:04,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-08 15:55:04,873 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-08 15:55:04,874 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-08 15:55:04,874 INFO  L130     BoogieDeclarations]: Found specification of procedure hanoi
[2020-07-08 15:55:04,874 INFO  L130     BoogieDeclarations]: Found specification of procedure applyHanoi
[2020-07-08 15:55:04,874 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-08 15:55:04,874 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-08 15:55:04,874 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-08 15:55:05,190 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-08 15:55:05,190 INFO  L295             CfgBuilder]: Removed 0 assume(true) statements.
[2020-07-08 15:55:05,195 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:55:05 BoogieIcfgContainer
[2020-07-08 15:55:05,196 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-08 15:55:05,197 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-08 15:55:05,197 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-08 15:55:05,201 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-08 15:55:05,201 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 03:55:04" (1/3) ...
[2020-07-08 15:55:05,202 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5051d301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:55:05, skipping insertion in model container
[2020-07-08 15:55:05,202 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 03:55:04" (2/3) ...
[2020-07-08 15:55:05,203 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5051d301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 03:55:05, skipping insertion in model container
[2020-07-08 15:55:05,203 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 03:55:05" (3/3) ...
[2020-07-08 15:55:05,205 INFO  L109   eAbstractionObserver]: Analyzing ICFG recHanoi01.c
[2020-07-08 15:55:05,218 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-08 15:55:05,226 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-08 15:55:05,247 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-08 15:55:05,295 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-08 15:55:05,296 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-08 15:55:05,296 INFO  L377      AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2020-07-08 15:55:05,296 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-08 15:55:05,296 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-08 15:55:05,296 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-08 15:55:05,296 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-08 15:55:05,297 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-08 15:55:05,311 INFO  L276                IsEmpty]: Start isEmpty. Operand 45 states.
[2020-07-08 15:55:05,324 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2020-07-08 15:55:05,324 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 15:55:05,325 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-08 15:55:05,325 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 15:55:05,330 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 15:55:05,330 INFO  L82        PathProgramCache]: Analyzing trace with hash -1892500808, now seen corresponding path program 1 times
[2020-07-08 15:55:05,337 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-08 15:55:05,337 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1315403556]
[2020-07-08 15:55:05,338 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 15:55:05,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:05,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:05,609 INFO  L280        TraceCheckUtils]: 0: Hoare triple {66#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {48#true} is VALID
[2020-07-08 15:55:05,610 INFO  L280        TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-08 15:55:05,610 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #60#return; {48#true} is VALID
[2020-07-08 15:55:05,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:05,676 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-08 15:55:05,677 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-08 15:55:05,678 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-08 15:55:05,679 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-08 15:55:05,680 INFO  L280        TraceCheckUtils]: 4: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} assume 0 == ~n; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-08 15:55:05,681 INFO  L280        TraceCheckUtils]: 5: Hoare triple {68#(= 0 |applyHanoi_#in~n|)} assume true; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-08 15:55:05,684 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {68#(= 0 |applyHanoi_#in~n|)} {53#(<= 1 main_~n~0)} #64#return; {49#false} is VALID
[2020-07-08 15:55:05,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:05,697 INFO  L280        TraceCheckUtils]: 0: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID
[2020-07-08 15:55:05,698 INFO  L280        TraceCheckUtils]: 1: Hoare triple {48#true} assume 1 == ~n; {48#true} is VALID
[2020-07-08 15:55:05,698 INFO  L280        TraceCheckUtils]: 2: Hoare triple {48#true} #res := 1; {48#true} is VALID
[2020-07-08 15:55:05,699 INFO  L280        TraceCheckUtils]: 3: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-08 15:55:05,699 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {48#true} {49#false} #66#return; {49#false} is VALID
[2020-07-08 15:55:05,701 INFO  L263        TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {66#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:05,702 INFO  L280        TraceCheckUtils]: 1: Hoare triple {66#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {48#true} is VALID
[2020-07-08 15:55:05,702 INFO  L280        TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-08 15:55:05,703 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #60#return; {48#true} is VALID
[2020-07-08 15:55:05,703 INFO  L263        TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID
[2020-07-08 15:55:05,704 INFO  L280        TraceCheckUtils]: 5: Hoare triple {48#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {48#true} is VALID
[2020-07-08 15:55:05,704 INFO  L280        TraceCheckUtils]: 6: Hoare triple {48#true} ~n~0 := #t~nondet2; {48#true} is VALID
[2020-07-08 15:55:05,705 INFO  L280        TraceCheckUtils]: 7: Hoare triple {48#true} havoc #t~nondet2; {48#true} is VALID
[2020-07-08 15:55:05,706 INFO  L280        TraceCheckUtils]: 8: Hoare triple {48#true} assume !(~n~0 < 1 || ~n~0 > 31); {53#(<= 1 main_~n~0)} is VALID
[2020-07-08 15:55:05,707 INFO  L280        TraceCheckUtils]: 9: Hoare triple {53#(<= 1 main_~n~0)} ~counter~0 := 0; {53#(<= 1 main_~n~0)} is VALID
[2020-07-08 15:55:05,709 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-08 15:55:05,710 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-08 15:55:05,711 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-08 15:55:05,712 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-08 15:55:05,714 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-08 15:55:05,715 INFO  L280        TraceCheckUtils]: 15: Hoare triple {67#(= applyHanoi_~n |applyHanoi_#in~n|)} assume 0 == ~n; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-08 15:55:05,716 INFO  L280        TraceCheckUtils]: 16: Hoare triple {68#(= 0 |applyHanoi_#in~n|)} assume true; {68#(= 0 |applyHanoi_#in~n|)} is VALID
[2020-07-08 15:55:05,718 INFO  L275        TraceCheckUtils]: 17: Hoare quadruple {68#(= 0 |applyHanoi_#in~n|)} {53#(<= 1 main_~n~0)} #64#return; {49#false} is VALID
[2020-07-08 15:55:05,719 INFO  L263        TraceCheckUtils]: 18: Hoare triple {49#false} call #t~ret3 := hanoi(~n~0); {48#true} is VALID
[2020-07-08 15:55:05,719 INFO  L280        TraceCheckUtils]: 19: Hoare triple {48#true} ~n := #in~n; {48#true} is VALID
[2020-07-08 15:55:05,720 INFO  L280        TraceCheckUtils]: 20: Hoare triple {48#true} assume 1 == ~n; {48#true} is VALID
[2020-07-08 15:55:05,720 INFO  L280        TraceCheckUtils]: 21: Hoare triple {48#true} #res := 1; {48#true} is VALID
[2020-07-08 15:55:05,721 INFO  L280        TraceCheckUtils]: 22: Hoare triple {48#true} assume true; {48#true} is VALID
[2020-07-08 15:55:05,721 INFO  L275        TraceCheckUtils]: 23: Hoare quadruple {48#true} {49#false} #66#return; {49#false} is VALID
[2020-07-08 15:55:05,722 INFO  L280        TraceCheckUtils]: 24: Hoare triple {49#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {49#false} is VALID
[2020-07-08 15:55:05,722 INFO  L280        TraceCheckUtils]: 25: Hoare triple {49#false} ~result~0 := #t~ret3; {49#false} is VALID
[2020-07-08 15:55:05,722 INFO  L280        TraceCheckUtils]: 26: Hoare triple {49#false} havoc #t~ret3; {49#false} is VALID
[2020-07-08 15:55:05,723 INFO  L280        TraceCheckUtils]: 27: Hoare triple {49#false} assume !(~result~0 == ~counter~0); {49#false} is VALID
[2020-07-08 15:55:05,723 INFO  L280        TraceCheckUtils]: 28: Hoare triple {49#false} assume !false; {49#false} is VALID
[2020-07-08 15:55:05,729 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-08 15:55:05,730 INFO  L185   leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-08 15:55:05,732 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1315403556]
[2020-07-08 15:55:05,734 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 15:55:05,735 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-07-08 15:55:05,736 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652731988]
[2020-07-08 15:55:05,743 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 29
[2020-07-08 15:55:05,746 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 15:55:05,750 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states.
[2020-07-08 15:55:05,806 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-08 15:55:05,807 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-07-08 15:55:05,807 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-08 15:55:05,816 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-08 15:55:05,817 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-07-08 15:55:05,820 INFO  L87              Difference]: Start difference. First operand 45 states. Second operand 6 states.
[2020-07-08 15:55:06,437 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 15:55:06,438 INFO  L93              Difference]: Finished difference Result 70 states and 80 transitions.
[2020-07-08 15:55:06,439 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-07-08 15:55:06,439 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 29
[2020-07-08 15:55:06,439 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 15:55:06,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-08 15:55:06,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions.
[2020-07-08 15:55:06,455 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-08 15:55:06,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions.
[2020-07-08 15:55:06,462 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions.
[2020-07-08 15:55:06,597 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-08 15:55:06,624 INFO  L225             Difference]: With dead ends: 70
[2020-07-08 15:55:06,624 INFO  L226             Difference]: Without dead ends: 41
[2020-07-08 15:55:06,635 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-08 15:55:06,656 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2020-07-08 15:55:06,765 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2020-07-08 15:55:06,765 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 15:55:06,766 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states.
[2020-07-08 15:55:06,767 INFO  L74              IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states.
[2020-07-08 15:55:06,767 INFO  L87              Difference]: Start difference. First operand 41 states. Second operand 41 states.
[2020-07-08 15:55:06,779 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 15:55:06,782 INFO  L93              Difference]: Finished difference Result 41 states and 46 transitions.
[2020-07-08 15:55:06,783 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2020-07-08 15:55:06,784 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 15:55:06,785 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 15:55:06,785 INFO  L74              IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states.
[2020-07-08 15:55:06,785 INFO  L87              Difference]: Start difference. First operand 41 states. Second operand 41 states.
[2020-07-08 15:55:06,796 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 15:55:06,796 INFO  L93              Difference]: Finished difference Result 41 states and 46 transitions.
[2020-07-08 15:55:06,798 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2020-07-08 15:55:06,800 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 15:55:06,800 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 15:55:06,800 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 15:55:06,801 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 15:55:06,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2020-07-08 15:55:06,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions.
[2020-07-08 15:55:06,819 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29
[2020-07-08 15:55:06,820 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 15:55:06,820 INFO  L479      AbstractCegarLoop]: Abstraction has 41 states and 46 transitions.
[2020-07-08 15:55:06,820 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-07-08 15:55:06,823 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 46 transitions.
[2020-07-08 15:55:06,890 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-08 15:55:06,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions.
[2020-07-08 15:55:06,894 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2020-07-08 15:55:06,894 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 15:55:06,895 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-08 15:55:06,896 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-08 15:55:06,896 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 15:55:06,896 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 15:55:06,896 INFO  L82        PathProgramCache]: Analyzing trace with hash -165736076, now seen corresponding path program 1 times
[2020-07-08 15:55:06,897 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-08 15:55:06,897 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [556327020]
[2020-07-08 15:55:06,897 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 15:55:06,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:07,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:07,090 INFO  L280        TraceCheckUtils]: 0: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {381#true} is VALID
[2020-07-08 15:55:07,091 INFO  L280        TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID
[2020-07-08 15:55:07,091 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #60#return; {381#true} is VALID
[2020-07-08 15:55:07,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:07,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:07,253 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-08 15:55:07,254 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-08 15:55:07,255 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-08 15:55:07,256 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-08 15:55:07,257 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-08 15:55:07,258 INFO  L280        TraceCheckUtils]: 5: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,260 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-08 15:55:07,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:07,286 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-08 15:55:07,286 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-08 15:55:07,287 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-08 15:55:07,288 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-08 15:55:07,289 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-08 15:55:07,290 INFO  L280        TraceCheckUtils]: 5: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,292 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-08 15:55:07,297 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-08 15:55:07,300 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-08 15:55:07,301 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-08 15:55:07,302 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-08 15:55:07,305 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-08 15:55:07,305 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-08 15:55:07,306 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-08 15:55:07,307 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-08 15:55:07,309 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-08 15:55:07,311 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-08 15:55:07,312 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-08 15:55:07,313 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-08 15:55:07,314 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-08 15:55:07,316 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-08 15:55:07,317 INFO  L280        TraceCheckUtils]: 14: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,319 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-08 15:55:07,321 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-08 15:55:07,322 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-08 15:55:07,323 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-08 15:55:07,323 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-08 15:55:07,324 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-08 15:55:07,325 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-08 15:55:07,326 INFO  L280        TraceCheckUtils]: 22: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,328 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-08 15:55:07,329 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-08 15:55:07,331 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-08 15:55:07,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 15:55:07,374 INFO  L280        TraceCheckUtils]: 0: Hoare triple {381#true} ~n := #in~n; {381#true} is VALID
[2020-07-08 15:55:07,375 INFO  L280        TraceCheckUtils]: 1: Hoare triple {381#true} assume 1 == ~n; {381#true} is VALID
[2020-07-08 15:55:07,375 INFO  L280        TraceCheckUtils]: 2: Hoare triple {381#true} #res := 1; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-08 15:55:07,376 INFO  L280        TraceCheckUtils]: 3: Hoare triple {439#(= 1 |hanoi_#res|)} assume true; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-08 15:55:07,377 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-08 15:55:07,378 INFO  L263        TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,378 INFO  L280        TraceCheckUtils]: 1: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} ~counter~0 := 0; {381#true} is VALID
[2020-07-08 15:55:07,379 INFO  L280        TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID
[2020-07-08 15:55:07,379 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #60#return; {381#true} is VALID
[2020-07-08 15:55:07,379 INFO  L263        TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret4 := main(); {381#true} is VALID
[2020-07-08 15:55:07,380 INFO  L280        TraceCheckUtils]: 5: Hoare triple {381#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {381#true} is VALID
[2020-07-08 15:55:07,380 INFO  L280        TraceCheckUtils]: 6: Hoare triple {381#true} ~n~0 := #t~nondet2; {381#true} is VALID
[2020-07-08 15:55:07,380 INFO  L280        TraceCheckUtils]: 7: Hoare triple {381#true} havoc #t~nondet2; {381#true} is VALID
[2020-07-08 15:55:07,381 INFO  L280        TraceCheckUtils]: 8: Hoare triple {381#true} assume !(~n~0 < 1 || ~n~0 > 31); {381#true} is VALID
[2020-07-08 15:55:07,381 INFO  L280        TraceCheckUtils]: 9: Hoare triple {381#true} ~counter~0 := 0; {386#(and (<= 0 ~counter~0) (<= ~counter~0 0))} is VALID
[2020-07-08 15:55:07,383 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-08 15:55:07,383 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-08 15:55:07,384 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-08 15:55:07,385 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-08 15:55:07,386 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-08 15:55:07,386 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-08 15:55:07,387 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-08 15:55:07,388 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-08 15:55:07,389 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-08 15:55:07,390 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-08 15:55:07,391 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-08 15:55:07,392 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-08 15:55:07,392 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-08 15:55:07,393 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-08 15:55:07,394 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-08 15:55:07,395 INFO  L280        TraceCheckUtils]: 25: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,396 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-08 15:55:07,398 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-08 15:55:07,399 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-08 15:55:07,399 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-08 15:55:07,400 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-08 15:55:07,401 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-08 15:55:07,401 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-08 15:55:07,402 INFO  L280        TraceCheckUtils]: 33: Hoare triple {421#(= ~counter~0 |old(~counter~0)|)} assume true; {421#(= ~counter~0 |old(~counter~0)|)} is VALID
[2020-07-08 15:55:07,404 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-08 15:55:07,405 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-08 15:55:07,406 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-08 15:55:07,407 INFO  L263        TraceCheckUtils]: 37: Hoare triple {413#(= ~counter~0 1)} call #t~ret3 := hanoi(~n~0); {381#true} is VALID
[2020-07-08 15:55:07,407 INFO  L280        TraceCheckUtils]: 38: Hoare triple {381#true} ~n := #in~n; {381#true} is VALID
[2020-07-08 15:55:07,408 INFO  L280        TraceCheckUtils]: 39: Hoare triple {381#true} assume 1 == ~n; {381#true} is VALID
[2020-07-08 15:55:07,408 INFO  L280        TraceCheckUtils]: 40: Hoare triple {381#true} #res := 1; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-08 15:55:07,409 INFO  L280        TraceCheckUtils]: 41: Hoare triple {439#(= 1 |hanoi_#res|)} assume true; {439#(= 1 |hanoi_#res|)} is VALID
[2020-07-08 15:55:07,410 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-08 15:55:07,411 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-08 15:55:07,412 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-08 15:55:07,412 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-08 15:55:07,414 INFO  L280        TraceCheckUtils]: 46: Hoare triple {420#(= ~counter~0 main_~result~0)} assume !(~result~0 == ~counter~0); {382#false} is VALID
[2020-07-08 15:55:07,414 INFO  L280        TraceCheckUtils]: 47: Hoare triple {382#false} assume !false; {382#false} is VALID
[2020-07-08 15:55:07,418 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-08 15:55:07,419 INFO  L185   leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-08 15:55:07,419 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [556327020]
[2020-07-08 15:55:07,419 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 15:55:07,420 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-08 15:55:07,420 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600979101]
[2020-07-08 15:55:07,421 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 48
[2020-07-08 15:55:07,422 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 15:55:07,422 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-08 15:55:07,467 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-08 15:55:07,467 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-08 15:55:07,468 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-08 15:55:07,468 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-08 15:55:07,468 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2020-07-08 15:55:07,468 INFO  L87              Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 11 states.
[2020-07-08 15:55:09,054 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 15:55:09,054 INFO  L93              Difference]: Finished difference Result 93 states and 110 transitions.
[2020-07-08 15:55:09,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2020-07-08 15:55:09,055 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 48
[2020-07-08 15:55:09,055 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 15:55:09,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-08 15:55:09,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions.
[2020-07-08 15:55:09,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-08 15:55:09,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions.
[2020-07-08 15:55:09,068 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 110 transitions.
[2020-07-08 15:55:09,241 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-08 15:55:09,248 INFO  L225             Difference]: With dead ends: 93
[2020-07-08 15:55:09,248 INFO  L226             Difference]: Without dead ends: 85
[2020-07-08 15:55:09,251 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-08 15:55:09,252 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2020-07-08 15:55:09,404 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75.
[2020-07-08 15:55:09,405 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 15:55:09,405 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 75 states.
[2020-07-08 15:55:09,405 INFO  L74              IsIncluded]: Start isIncluded. First operand 85 states. Second operand 75 states.
[2020-07-08 15:55:09,406 INFO  L87              Difference]: Start difference. First operand 85 states. Second operand 75 states.
[2020-07-08 15:55:09,414 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 15:55:09,414 INFO  L93              Difference]: Finished difference Result 85 states and 102 transitions.
[2020-07-08 15:55:09,415 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions.
[2020-07-08 15:55:09,416 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 15:55:09,416 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 15:55:09,416 INFO  L74              IsIncluded]: Start isIncluded. First operand 75 states. Second operand 85 states.
[2020-07-08 15:55:09,417 INFO  L87              Difference]: Start difference. First operand 75 states. Second operand 85 states.
[2020-07-08 15:55:09,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 15:55:09,424 INFO  L93              Difference]: Finished difference Result 85 states and 102 transitions.
[2020-07-08 15:55:09,424 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions.
[2020-07-08 15:55:09,426 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 15:55:09,426 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 15:55:09,426 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 15:55:09,426 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 15:55:09,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2020-07-08 15:55:09,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions.
[2020-07-08 15:55:09,432 INFO  L78                 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 48
[2020-07-08 15:55:09,433 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 15:55:09,433 INFO  L479      AbstractCegarLoop]: Abstraction has 75 states and 92 transitions.
[2020-07-08 15:55:09,433 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-08 15:55:09,433 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 75 states and 92 transitions.
[2020-07-08 15:55:09,570 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-08 15:55:09,571 INFO  L276                IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions.
[2020-07-08 15:55:09,573 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2020-07-08 15:55:09,573 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 15:55:09,578 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-08 15:55:09,579 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-08 15:55:09,579 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 15:55:09,579 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 15:55:09,579 INFO  L82        PathProgramCache]: Analyzing trace with hash 492898986, now seen corresponding path program 1 times
[2020-07-08 15:55:09,580 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-08 15:55:09,580 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1481992120]
[2020-07-08 15:55:09,580 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 15:55:09,607 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-08 15:55:09,607 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-08 15:55:09,615 INFO  L168              Benchmark]: Toolchain (without parser) took 5185.14 ms. Allocated memory was 141.6 MB in the beginning and 280.0 MB in the end (delta: 138.4 MB). Free memory was 103.7 MB in the beginning and 147.7 MB in the end (delta: -44.0 MB). Peak memory consumption was 94.4 MB. Max. memory is 7.1 GB.
[2020-07-08 15:55:09,616 INFO  L168              Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-08 15:55:09,617 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 264.68 ms. Allocated memory is still 141.6 MB. Free memory was 103.3 MB in the beginning and 93.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB.
[2020-07-08 15:55:09,618 INFO  L168              Benchmark]: Boogie Preprocessor took 31.66 ms. Allocated memory is still 141.6 MB. Free memory was 93.3 MB in the beginning and 91.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB.
[2020-07-08 15:55:09,625 INFO  L168              Benchmark]: RCFGBuilder took 467.94 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 91.9 MB in the beginning and 160.2 MB in the end (delta: -68.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB.
[2020-07-08 15:55:09,626 INFO  L168              Benchmark]: TraceAbstraction took 4413.34 ms. Allocated memory was 202.4 MB in the beginning and 280.0 MB in the end (delta: 77.6 MB). Free memory was 160.2 MB in the beginning and 147.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 90.1 MB. Max. memory is 7.1 GB.
[2020-07-08 15:55:09,633 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - AssertionsEnabledResult: Assertions are enabled
    Assertions are enabled
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.21 ms. Allocated memory is still 141.6 MB. Free memory is still 121.9 MB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 264.68 ms. Allocated memory is still 141.6 MB. Free memory was 103.3 MB in the beginning and 93.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 31.66 ms. Allocated memory is still 141.6 MB. Free memory was 93.3 MB in the beginning and 91.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 467.94 ms. Allocated memory was 141.6 MB in the beginning and 202.4 MB in the end (delta: 60.8 MB). Free memory was 91.9 MB in the beginning and 160.2 MB in the end (delta: -68.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 4413.34 ms. Allocated memory was 202.4 MB in the beginning and 280.0 MB in the end (delta: 77.6 MB). Free memory was 160.2 MB in the beginning and 147.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 90.1 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...