./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/recHanoi03-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/recHanoi03-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:13:57,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:13:57,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:13:57,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:13:57,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:13:57,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:13:57,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:13:57,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:13:57,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:13:57,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:13:57,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:13:57,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:13:57,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:13:57,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:13:57,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:13:57,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:13:57,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:13:57,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:13:57,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:13:57,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:13:57,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:13:57,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:13:57,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:13:57,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:13:57,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:13:57,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:13:57,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:13:57,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:13:57,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:13:57,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:13:57,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:13:57,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:13:57,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:13:57,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:13:57,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:13:57,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:13:57,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:13:57,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:13:57,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:13:57,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:13:57,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:13:57,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:13:57,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:13:57,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:13:57,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:13:57,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:13:57,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:13:57,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:13:57,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:13:57,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:13:57,700 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:13:57,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:13:57,701 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:13:57,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:13:57,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:13:57,702 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:13:57,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:13:57,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:13:57,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:13:57,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:13:57,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:57,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:13:57,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:13:57,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:13:57,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:13:57,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:13:57,704 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:13:57,704 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:13:57,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:13:57,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 [2022-02-20 18:13:57,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:13:57,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:13:57,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:13:57,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:13:57,933 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:13:57,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/recHanoi03-2.c [2022-02-20 18:13:57,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb044a5b/b9f2f1699f9e400d9a231abc25dfa7d4/FLAG2ba360f6f [2022-02-20 18:13:58,377 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:13:58,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2022-02-20 18:13:58,386 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb044a5b/b9f2f1699f9e400d9a231abc25dfa7d4/FLAG2ba360f6f [2022-02-20 18:13:58,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb044a5b/b9f2f1699f9e400d9a231abc25dfa7d4 [2022-02-20 18:13:58,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:13:58,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:13:58,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:58,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:13:58,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:13:58,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb26854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:58, skipping insertion in model container [2022-02-20 18:13:58,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:13:58" (1/1) ... [2022-02-20 18:13:58,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:13:58,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:13:58,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c[769,782] [2022-02-20 18:13:58,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:59,007 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:13:59,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c[769,782] [2022-02-20 18:13:59,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:13:59,026 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:13:59,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59 WrapperNode [2022-02-20 18:13:59,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:13:59,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:59,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:13:59,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:13:59,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,037 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,051 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-20 18:13:59,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:13:59,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:13:59,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:13:59,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:13:59,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:13:59,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:13:59,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:13:59,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:13:59,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (1/1) ... [2022-02-20 18:13:59,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:13:59,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:13:59,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:13:59,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:13:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:13:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2022-02-20 18:13:59,139 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2022-02-20 18:13:59,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:13:59,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:13:59,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:13:59,179 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:13:59,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:13:59,321 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:13:59,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:13:59,326 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:13:59,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:59 BoogieIcfgContainer [2022-02-20 18:13:59,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:13:59,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:13:59,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:13:59,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:13:59,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:13:58" (1/3) ... [2022-02-20 18:13:59,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d793365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:59, skipping insertion in model container [2022-02-20 18:13:59,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:13:59" (2/3) ... [2022-02-20 18:13:59,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d793365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:13:59, skipping insertion in model container [2022-02-20 18:13:59,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:13:59" (3/3) ... [2022-02-20 18:13:59,345 INFO L111 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2022-02-20 18:13:59,348 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:13:59,363 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:13:59,421 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:13:59,426 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:13:59,429 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:13:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:13:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 18:13:59,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:13:59,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:13:59,445 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:13:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:13:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2087939196, now seen corresponding path program 1 times [2022-02-20 18:13:59,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:13:59,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454651426] [2022-02-20 18:13:59,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:13:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:13:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:13:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:13:59,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} ~n := #in~n; {28#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:13:59,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:13:59,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:13:59,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {20#true} #32#return; {26#(and (= |ULTIMATE.start_main_#t~ret6#1| 1) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 18:13:59,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {20#true} is VALID [2022-02-20 18:13:59,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {20#true} is VALID [2022-02-20 18:13:59,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {20#true} is VALID [2022-02-20 18:13:59,747 INFO L272 TraceCheckUtils]: 3: Hoare triple {20#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {20#true} is VALID [2022-02-20 18:13:59,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#true} ~n := #in~n; {28#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:13:59,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:13:59,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:13:59,751 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {20#true} #32#return; {26#(and (= |ULTIMATE.start_main_#t~ret6#1| 1) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 18:13:59,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#(and (= |ULTIMATE.start_main_#t~ret6#1| 1) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {27#(and (= (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 0) (<= |ULTIMATE.start_main_~n~0#1| 1))} is VALID [2022-02-20 18:13:59,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#(and (= (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 0) (<= |ULTIMATE.start_main_~n~0#1| 1))} assume !(main_~result~0#1 >= main_~n~0#1); {21#false} is VALID [2022-02-20 18:13:59,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 18:13:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:13:59,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:13:59,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454651426] [2022-02-20 18:13:59,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454651426] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:13:59,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:13:59,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 18:13:59,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842321137] [2022-02-20 18:13:59,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:13:59,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:13:59,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:13:59,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:13:59,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:13:59,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:13:59,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:13:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:13:59,804 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:13:59,979 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 18:13:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:13:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 18:13:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:13:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 18:13:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:13:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-02-20 18:13:59,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-02-20 18:14:00,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:14:00,018 INFO L225 Difference]: With dead ends: 29 [2022-02-20 18:14:00,019 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 18:14:00,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:14:00,023 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:14:00,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 54 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:14:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 18:14:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 18:14:00,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:14:00,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:14:00,043 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:14:00,044 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:14:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:00,046 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 18:14:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 18:14:00,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:14:00,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:14:00,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states. [2022-02-20 18:14:00,047 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states. [2022-02-20 18:14:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:00,049 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 18:14:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 18:14:00,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:14:00,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:14:00,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:14:00,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:14:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:14:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 18:14:00,053 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-02-20 18:14:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:14:00,053 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 18:14:00,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:14:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 18:14:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 18:14:00,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:14:00,054 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:14:00,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:14:00,055 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:14:00,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:14:00,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2053638732, now seen corresponding path program 1 times [2022-02-20 18:14:00,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:14:00,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975965647] [2022-02-20 18:14:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:14:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:14:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:14:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:00,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} ~n := #in~n; {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {134#(= hanoi_~n |hanoi_#in~n|)} #30#return; {139#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:00,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} ~n := #in~n; {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,205 INFO L272 TraceCheckUtils]: 2: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {120#true} is VALID [2022-02-20 18:14:00,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {120#true} ~n := #in~n; {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,206 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,209 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {134#(= hanoi_~n |hanoi_#in~n|)} #30#return; {139#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:00,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {139#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2022-02-20 18:14:00,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2022-02-20 18:14:00,211 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {120#true} #32#return; {132#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:00,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {120#true} is VALID [2022-02-20 18:14:00,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {120#true} is VALID [2022-02-20 18:14:00,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {120#true} is VALID [2022-02-20 18:14:00,212 INFO L272 TraceCheckUtils]: 3: Hoare triple {120#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {120#true} is VALID [2022-02-20 18:14:00,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {120#true} ~n := #in~n; {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {120#true} is VALID [2022-02-20 18:14:00,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#true} ~n := #in~n; {134#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:00,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {141#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {134#(= hanoi_~n |hanoi_#in~n|)} #30#return; {139#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:00,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {139#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2022-02-20 18:14:00,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} assume true; {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} is VALID [2022-02-20 18:14:00,218 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {140#(<= (+ |hanoi_#in~n| 1) |hanoi_#res|)} {120#true} #32#return; {132#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:00,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {132#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {133#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:14:00,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {133#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= main_~n~0#1); {121#false} is VALID [2022-02-20 18:14:00,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-02-20 18:14:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:14:00,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:14:00,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975965647] [2022-02-20 18:14:00,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975965647] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:14:00,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766749839] [2022-02-20 18:14:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:14:00,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:14:00,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:14:00,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:14:00,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:14:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:00,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 18:14:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:00,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:14:00,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {120#true} is VALID [2022-02-20 18:14:00,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {120#true} is VALID [2022-02-20 18:14:00,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {120#true} is VALID [2022-02-20 18:14:00,963 INFO L272 TraceCheckUtils]: 3: Hoare triple {120#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {120#true} is VALID [2022-02-20 18:14:00,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {120#true} ~n := #in~n; {157#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:00,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {157#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:00,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {157#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {120#true} is VALID [2022-02-20 18:14:00,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#true} ~n := #in~n; {157#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:00,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {157#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:00,969 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {157#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {177#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:00,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {177#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {181#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:00,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {181#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} assume true; {181#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:00,971 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {181#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} {120#true} #32#return; {188#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 (div (+ (- 1) |ULTIMATE.start_main_#t~ret6#1|) 2)))} is VALID [2022-02-20 18:14:00,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {188#(and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 (div (+ (- 1) |ULTIMATE.start_main_#t~ret6#1|) 2)))} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {192#(and (<= 1 (div (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 2)) (<= |ULTIMATE.start_main_~n~0#1| 2))} is VALID [2022-02-20 18:14:00,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {192#(and (<= 1 (div (+ (- 1) |ULTIMATE.start_main_~result~0#1|) 2)) (<= |ULTIMATE.start_main_~n~0#1| 2))} assume !(main_~result~0#1 >= main_~n~0#1); {121#false} is VALID [2022-02-20 18:14:00,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-02-20 18:14:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:14:00,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:14:02,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-02-20 18:14:02,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {202#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= main_~n~0#1); {121#false} is VALID [2022-02-20 18:14:02,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {206#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {202#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:14:02,106 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {213#(<= |hanoi_#in~n| |hanoi_#res|)} {120#true} #32#return; {206#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:02,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#(<= |hanoi_#in~n| |hanoi_#res|)} assume true; {213#(<= |hanoi_#in~n| |hanoi_#res|)} is VALID [2022-02-20 18:14:02,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#(<= |hanoi_#in~n| (+ (* 2 |hanoi_#t~ret4|) 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {213#(<= |hanoi_#in~n| |hanoi_#res|)} is VALID [2022-02-20 18:14:02,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {224#(or (<= (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2)) 1) (< 2 hanoi_~n))} #30#return; {220#(<= |hanoi_#in~n| (+ (* 2 |hanoi_#t~ret4|) 1))} is VALID [2022-02-20 18:14:02,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#(or (< 1 hanoi_~n) (<= |hanoi_#in~n| 1))} assume 1 == ~n;#res := 1; {170#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#true} ~n := #in~n; {234#(or (< 1 hanoi_~n) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {224#(or (<= (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2)) 1) (< 2 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {120#true} is VALID [2022-02-20 18:14:02,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {224#(or (<= (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2)) 1) (< 2 hanoi_~n))} assume !(1 == ~n); {224#(or (<= (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2)) 1) (< 2 hanoi_~n))} is VALID [2022-02-20 18:14:02,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {120#true} ~n := #in~n; {224#(or (<= (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2)) 1) (< 2 hanoi_~n))} is VALID [2022-02-20 18:14:02,111 INFO L272 TraceCheckUtils]: 3: Hoare triple {120#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {120#true} is VALID [2022-02-20 18:14:02,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {120#true} is VALID [2022-02-20 18:14:02,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {120#true} is VALID [2022-02-20 18:14:02,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {120#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {120#true} is VALID [2022-02-20 18:14:02,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:14:02,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766749839] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:14:02,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:14:02,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2022-02-20 18:14:02,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352708671] [2022-02-20 18:14:02,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:14:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 17 [2022-02-20 18:14:02,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:14:02,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 18:14:02,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:14:02,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 18:14:02,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:14:02,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 18:14:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:14:02,154 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 18:14:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:02,463 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-02-20 18:14:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 18:14:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 17 [2022-02-20 18:14:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:14:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 18:14:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-02-20 18:14:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 18:14:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-02-20 18:14:02,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-02-20 18:14:02,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:14:02,505 INFO L225 Difference]: With dead ends: 28 [2022-02-20 18:14:02,505 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 18:14:02,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-02-20 18:14:02,507 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:14:02,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 77 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:14:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 18:14:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 18:14:02,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:14:02,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:14:02,515 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:14:02,516 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:14:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:02,522 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 18:14:02,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 18:14:02,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:14:02,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:14:02,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 22 states. [2022-02-20 18:14:02,523 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 22 states. [2022-02-20 18:14:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:02,525 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 18:14:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 18:14:02,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:14:02,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:14:02,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:14:02,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:14:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:14:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-20 18:14:02,527 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-02-20 18:14:02,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:14:02,527 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-20 18:14:02,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 14 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-20 18:14:02,527 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 18:14:02,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 18:14:02,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:14:02,528 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:14:02,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:14:02,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:14:02,731 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:14:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:14:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash -491101836, now seen corresponding path program 2 times [2022-02-20 18:14:02,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:14:02,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388594446] [2022-02-20 18:14:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:14:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:14:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:02,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:14:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:02,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:02,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:02,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:02,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,933 INFO L272 TraceCheckUtils]: 2: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,935 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:02,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} assume true; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,937 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:02,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,938 INFO L272 TraceCheckUtils]: 2: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,939 INFO L272 TraceCheckUtils]: 5: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,943 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:02,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} assume true; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,945 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:02,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:02,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} assume true; {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:02,946 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {405#(<= (+ |hanoi_#in~n| 10) (* 2 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:02,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,947 INFO L272 TraceCheckUtils]: 2: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,948 INFO L272 TraceCheckUtils]: 5: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,949 INFO L272 TraceCheckUtils]: 8: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,960 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:02,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} assume true; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,962 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:02,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:02,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} assume true; {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:02,963 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {405#(<= (+ |hanoi_#in~n| 10) (* 2 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:02,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {405#(<= (+ |hanoi_#in~n| 10) (* 2 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} is VALID [2022-02-20 18:14:02,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} assume true; {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} is VALID [2022-02-20 18:14:02,965 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} {362#true} #32#return; {386#(<= (+ |ULTIMATE.start_main_~n~0#1| 11) |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:02,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {362#true} is VALID [2022-02-20 18:14:02,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {362#true} is VALID [2022-02-20 18:14:02,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {362#true} is VALID [2022-02-20 18:14:02,966 INFO L272 TraceCheckUtils]: 3: Hoare triple {362#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {362#true} is VALID [2022-02-20 18:14:02,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,967 INFO L272 TraceCheckUtils]: 9: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,968 INFO L272 TraceCheckUtils]: 12: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:02,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {362#true} ~n := #in~n; {388#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:02,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {388#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:02,969 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {425#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:02,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {423#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} assume true; {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:02,971 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {424#(<= (+ |hanoi_#in~n| 10) (* |hanoi_#res| 4))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:02,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {417#(<= (+ 9 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:02,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} assume true; {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:02,973 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {418#(<= (+ |hanoi_#in~n| 11) (* |hanoi_#res| 2))} {388#(= hanoi_~n |hanoi_#in~n|)} #30#return; {405#(<= (+ |hanoi_#in~n| 10) (* 2 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:02,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {405#(<= (+ |hanoi_#in~n| 10) (* 2 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} is VALID [2022-02-20 18:14:02,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} assume true; {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} is VALID [2022-02-20 18:14:02,974 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {406#(<= (+ |hanoi_#in~n| 11) |hanoi_#res|)} {362#true} #32#return; {386#(<= (+ |ULTIMATE.start_main_~n~0#1| 11) |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:02,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {386#(<= (+ |ULTIMATE.start_main_~n~0#1| 11) |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {387#(<= (+ |ULTIMATE.start_main_~n~0#1| 11) |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:14:02,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {387#(<= (+ |ULTIMATE.start_main_~n~0#1| 11) |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= main_~n~0#1); {363#false} is VALID [2022-02-20 18:14:02,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 18:14:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:14:02,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:14:02,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388594446] [2022-02-20 18:14:02,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388594446] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:14:02,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843415231] [2022-02-20 18:14:02,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:14:02,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:14:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:14:02,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:14:02,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:14:03,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:14:03,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:14:03,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 18:14:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:03,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:14:04,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {362#true} is VALID [2022-02-20 18:14:04,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {362#true} is VALID [2022-02-20 18:14:04,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {362#true} is VALID [2022-02-20 18:14:04,819 INFO L272 TraceCheckUtils]: 3: Hoare triple {362#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {362#true} is VALID [2022-02-20 18:14:04,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#true} ~n := #in~n; {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,820 INFO L272 TraceCheckUtils]: 6: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:04,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#true} ~n := #in~n; {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,821 INFO L272 TraceCheckUtils]: 9: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:04,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#true} ~n := #in~n; {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:04,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {362#true} ~n := #in~n; {441#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:04,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {441#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:04,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:04,824 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {441#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {479#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:04,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:04,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} assume true; {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:04,827 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} {441#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {490#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} is VALID [2022-02-20 18:14:04,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {490#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:14:04,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} assume true; {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:14:04,829 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} {441#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {501#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (+ (- 3) |hanoi_#t~ret4|) 2) 2)))} is VALID [2022-02-20 18:14:04,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {501#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (+ (- 3) |hanoi_#t~ret4|) 2) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {505#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} is VALID [2022-02-20 18:14:04,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {505#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} assume true; {505#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} is VALID [2022-02-20 18:14:04,832 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {505#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} {362#true} #32#return; {512#(and (<= 1 (div (div (div (+ |ULTIMATE.start_main_#t~ret6#1| (- 7)) 2) 2) 2)) (<= |ULTIMATE.start_main_~n~0#1| 4))} is VALID [2022-02-20 18:14:04,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {512#(and (<= 1 (div (div (div (+ |ULTIMATE.start_main_#t~ret6#1| (- 7)) 2) 2) 2)) (<= |ULTIMATE.start_main_~n~0#1| 4))} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {516#(and (<= |ULTIMATE.start_main_~n~0#1| 4) (<= 1 (div (div (div (+ (- 7) |ULTIMATE.start_main_~result~0#1|) 2) 2) 2)))} is VALID [2022-02-20 18:14:04,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {516#(and (<= |ULTIMATE.start_main_~n~0#1| 4) (<= 1 (div (div (div (+ (- 7) |ULTIMATE.start_main_~result~0#1|) 2) 2) 2)))} assume !(main_~result~0#1 >= main_~n~0#1); {363#false} is VALID [2022-02-20 18:14:04,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 18:14:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:14:04,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:14:12,127 INFO L290 TraceCheckUtils]: 28: Hoare triple {363#false} assume !false; {363#false} is VALID [2022-02-20 18:14:12,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {526#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= main_~n~0#1); {363#false} is VALID [2022-02-20 18:14:12,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {530#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {526#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:14:12,131 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {537#(<= |hanoi_#in~n| |hanoi_#res|)} {362#true} #32#return; {530#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:12,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {537#(<= |hanoi_#in~n| |hanoi_#res|)} assume true; {537#(<= |hanoi_#in~n| |hanoi_#res|)} is VALID [2022-02-20 18:14:12,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {544#(<= |hanoi_#in~n| (+ (* 2 |hanoi_#t~ret4|) 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {537#(<= |hanoi_#in~n| |hanoi_#res|)} is VALID [2022-02-20 18:14:12,134 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} {548#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 4 hanoi_~n))} #30#return; {544#(<= |hanoi_#in~n| (+ (* 2 |hanoi_#t~ret4|) 1))} is VALID [2022-02-20 18:14:12,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} assume true; {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:14:12,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {490#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {494#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:14:12,141 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} {561#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} #30#return; {490#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} is VALID [2022-02-20 18:14:12,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} assume true; {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:12,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {479#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {483#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:12,143 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {574#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} #30#return; {479#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:12,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:12,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {584#(or (< 1 hanoi_~n) (<= |hanoi_#in~n| 1))} assume 1 == ~n;#res := 1; {472#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:12,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {362#true} ~n := #in~n; {584#(or (< 1 hanoi_~n) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:12,144 INFO L272 TraceCheckUtils]: 12: Hoare triple {574#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:12,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {574#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} assume !(1 == ~n); {574#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:12,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#true} ~n := #in~n; {574#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:12,145 INFO L272 TraceCheckUtils]: 9: Hoare triple {561#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:12,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {561#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} assume !(1 == ~n); {561#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} is VALID [2022-02-20 18:14:12,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#true} ~n := #in~n; {561#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} is VALID [2022-02-20 18:14:12,146 INFO L272 TraceCheckUtils]: 6: Hoare triple {548#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 4 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {362#true} is VALID [2022-02-20 18:14:12,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {548#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 4 hanoi_~n))} assume !(1 == ~n); {548#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 4 hanoi_~n))} is VALID [2022-02-20 18:14:12,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#true} ~n := #in~n; {548#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 4 hanoi_~n))} is VALID [2022-02-20 18:14:12,148 INFO L272 TraceCheckUtils]: 3: Hoare triple {362#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {362#true} is VALID [2022-02-20 18:14:12,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {362#true} is VALID [2022-02-20 18:14:12,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {362#true} is VALID [2022-02-20 18:14:12,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {362#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {362#true} is VALID [2022-02-20 18:14:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:14:12,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843415231] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:14:12,151 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:14:12,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 15] total 30 [2022-02-20 18:14:12,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040887586] [2022-02-20 18:14:12,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:14:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) Word has length 29 [2022-02-20 18:14:12,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:14:12,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 18:14:12,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:14:12,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-20 18:14:12,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:14:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-20 18:14:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2022-02-20 18:14:12,214 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 18:14:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:13,117 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-02-20 18:14:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 18:14:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) Word has length 29 [2022-02-20 18:14:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:14:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 18:14:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-02-20 18:14:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 18:14:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 40 transitions. [2022-02-20 18:14:13,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 40 transitions. [2022-02-20 18:14:13,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:14:13,160 INFO L225 Difference]: With dead ends: 37 [2022-02-20 18:14:13,160 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 18:14:13,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1394, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 18:14:13,161 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 18:14:13,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 150 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 18:14:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 18:14:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 18:14:13,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:14:13,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:14:13,165 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:14:13,165 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:14:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:13,167 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 18:14:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-20 18:14:13,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:14:13,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:14:13,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) Second operand 31 states. [2022-02-20 18:14:13,168 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) Second operand 31 states. [2022-02-20 18:14:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:14:13,169 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 18:14:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-20 18:14:13,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:14:13,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:14:13,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:14:13,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:14:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:14:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-02-20 18:14:13,171 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2022-02-20 18:14:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:14:13,171 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-02-20 18:14:13,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2022-02-20 18:14:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-02-20 18:14:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 18:14:13,172 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:14:13,172 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:14:13,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:14:13,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 18:14:13,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:14:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:14:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash 278928068, now seen corresponding path program 3 times [2022-02-20 18:14:13,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:14:13,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748892318] [2022-02-20 18:14:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:14:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:14:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 18:14:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:14:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,769 INFO L272 TraceCheckUtils]: 2: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,771 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,773 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,774 INFO L272 TraceCheckUtils]: 2: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,776 INFO L272 TraceCheckUtils]: 5: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,778 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,780 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} assume true; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,784 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,786 INFO L272 TraceCheckUtils]: 2: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,787 INFO L272 TraceCheckUtils]: 5: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,790 INFO L272 TraceCheckUtils]: 8: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,792 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} assume true; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,795 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} assume true; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,797 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} is VALID [2022-02-20 18:14:13,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,798 INFO L272 TraceCheckUtils]: 2: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,798 INFO L272 TraceCheckUtils]: 5: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,800 INFO L272 TraceCheckUtils]: 8: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,801 INFO L272 TraceCheckUtils]: 11: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,804 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} assume true; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,806 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} assume true; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,807 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} is VALID [2022-02-20 18:14:13,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} assume true; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,809 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:13,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,812 INFO L272 TraceCheckUtils]: 2: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,812 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,813 INFO L272 TraceCheckUtils]: 5: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,814 INFO L272 TraceCheckUtils]: 8: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,815 INFO L272 TraceCheckUtils]: 11: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,816 INFO L272 TraceCheckUtils]: 14: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,818 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,819 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} assume true; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,821 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} assume true; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,827 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} is VALID [2022-02-20 18:14:13,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} assume true; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,829 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:13,829 INFO L290 TraceCheckUtils]: 31: Hoare triple {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:13,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} assume true; {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:13,831 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {851#(<= (+ 119 |hanoi_#in~n|) (* 2 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,831 INFO L272 TraceCheckUtils]: 2: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,832 INFO L272 TraceCheckUtils]: 5: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,833 INFO L272 TraceCheckUtils]: 11: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,834 INFO L272 TraceCheckUtils]: 14: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,834 INFO L272 TraceCheckUtils]: 17: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,836 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,838 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} assume true; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,839 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} assume true; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,841 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} is VALID [2022-02-20 18:14:13,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} assume true; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,842 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:13,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:13,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} assume true; {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:13,844 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {851#(<= (+ 119 |hanoi_#in~n|) (* 2 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {851#(<= (+ 119 |hanoi_#in~n|) (* 2 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} is VALID [2022-02-20 18:14:13,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} assume true; {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} is VALID [2022-02-20 18:14:13,845 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} {772#true} #32#return; {814#(<= (+ |ULTIMATE.start_main_~n~0#1| 120) |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:13,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-02-20 18:14:13,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {772#true} is VALID [2022-02-20 18:14:13,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {772#true} is VALID [2022-02-20 18:14:13,855 INFO L272 TraceCheckUtils]: 3: Hoare triple {772#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {772#true} is VALID [2022-02-20 18:14:13,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,856 INFO L272 TraceCheckUtils]: 9: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,857 INFO L272 TraceCheckUtils]: 15: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,858 INFO L272 TraceCheckUtils]: 18: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume !(1 == ~n); {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,859 INFO L272 TraceCheckUtils]: 21: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:13,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {772#true} ~n := #in~n; {816#(= hanoi_~n |hanoi_#in~n|)} is VALID [2022-02-20 18:14:13,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {816#(= hanoi_~n |hanoi_#in~n|)} assume 1 == ~n;#res := 1; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} assume true; {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:13,864 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {943#(and (<= 1 |hanoi_#res|) (<= |hanoi_#res| 1) (= |hanoi_#in~n| 1))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:13,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {941#(and (= (+ (- 1) |hanoi_#t~ret4|) 0) (<= |hanoi_#in~n| 2))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} assume true; {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} is VALID [2022-02-20 18:14:13,866 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {942#(<= (+ 94 |hanoi_#in~n|) (* |hanoi_#res| 32))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {935#(<= (+ |hanoi_#in~n| 93) (* 32 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} assume true; {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} is VALID [2022-02-20 18:14:13,867 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {936#(<= (+ 109 |hanoi_#in~n|) (* |hanoi_#res| 16))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {923#(<= (+ 108 |hanoi_#in~n|) (* 16 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} assume true; {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} is VALID [2022-02-20 18:14:13,868 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {924#(<= (+ 116 |hanoi_#in~n|) (* |hanoi_#res| 8))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} is VALID [2022-02-20 18:14:13,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {905#(<= (+ 115 |hanoi_#in~n|) (* |hanoi_#t~ret4| 8))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} assume true; {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} is VALID [2022-02-20 18:14:13,870 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {906#(<= (+ 119 |hanoi_#in~n|) (* |hanoi_#res| 4))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} is VALID [2022-02-20 18:14:13,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {881#(<= (+ 118 |hanoi_#in~n|) (* |hanoi_#t~ret4| 4))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:13,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} assume true; {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} is VALID [2022-02-20 18:14:13,871 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {882#(<= (+ |hanoi_#in~n| 120) (* |hanoi_#res| 2))} {816#(= hanoi_~n |hanoi_#in~n|)} #30#return; {851#(<= (+ 119 |hanoi_#in~n|) (* 2 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:13,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {851#(<= (+ 119 |hanoi_#in~n|) (* 2 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} is VALID [2022-02-20 18:14:13,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} assume true; {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} is VALID [2022-02-20 18:14:13,872 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {852#(<= (+ |hanoi_#in~n| 120) |hanoi_#res|)} {772#true} #32#return; {814#(<= (+ |ULTIMATE.start_main_~n~0#1| 120) |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:14:13,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {814#(<= (+ |ULTIMATE.start_main_~n~0#1| 120) |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {815#(<= (+ |ULTIMATE.start_main_~n~0#1| 120) |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:14:13,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {815#(<= (+ |ULTIMATE.start_main_~n~0#1| 120) |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= main_~n~0#1); {773#false} is VALID [2022-02-20 18:14:13,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-02-20 18:14:13,874 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-20 18:14:13,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:14:13,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748892318] [2022-02-20 18:14:13,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748892318] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:14:13,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393882409] [2022-02-20 18:14:13,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:14:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:14:13,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:14:13,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:14:13,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:14:13,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-02-20 18:14:13,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:14:13,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 18:14:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:14:13,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:14:19,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-02-20 18:14:19,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {772#true} is VALID [2022-02-20 18:14:19,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {772#true} is VALID [2022-02-20 18:14:19,727 INFO L272 TraceCheckUtils]: 3: Hoare triple {772#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {772#true} is VALID [2022-02-20 18:14:19,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,728 INFO L272 TraceCheckUtils]: 6: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:19,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,728 INFO L272 TraceCheckUtils]: 9: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:19,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,729 INFO L272 TraceCheckUtils]: 12: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:19,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,730 INFO L272 TraceCheckUtils]: 15: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:19,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,730 INFO L272 TraceCheckUtils]: 18: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:19,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume !(1 == ~n); {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,737 INFO L272 TraceCheckUtils]: 21: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:14:19,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {772#true} ~n := #in~n; {959#(<= |hanoi_#in~n| hanoi_~n)} is VALID [2022-02-20 18:14:19,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {959#(<= |hanoi_#in~n| hanoi_~n)} assume 1 == ~n;#res := 1; {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:19,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:14:19,739 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {959#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {1024#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:14:19,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {1024#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:19,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} assume true; {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:14:19,740 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} {959#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {1035#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} is VALID [2022-02-20 18:14:19,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {1035#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:14:19,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} assume true; {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:14:19,742 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} {959#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {1046#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (+ (- 3) |hanoi_#t~ret4|) 2) 2)))} is VALID [2022-02-20 18:14:19,743 INFO L290 TraceCheckUtils]: 32: Hoare triple {1046#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (+ (- 3) |hanoi_#t~ret4|) 2) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,743 INFO L290 TraceCheckUtils]: 33: Hoare triple {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} assume true; {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,744 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} {959#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {1057#(and (<= 1 (div (div (div (+ (- 7) |hanoi_#t~ret4|) 2) 2) 2)) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:14:19,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {1057#(and (<= 1 (div (div (div (+ (- 7) |hanoi_#t~ret4|) 2) 2) 2)) (<= |hanoi_#in~n| 5))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:14:19,746 INFO L290 TraceCheckUtils]: 36: Hoare triple {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} assume true; {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:14:19,747 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} {959#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {1068#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (+ (- 15) |hanoi_#t~ret4|) 2) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {1068#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (+ (- 15) |hanoi_#t~ret4|) 2) 2) 2) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} assume true; {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,749 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} {959#(<= |hanoi_#in~n| hanoi_~n)} #30#return; {1079#(and (<= |hanoi_#in~n| 7) (<= 1 (div (div (div (div (div (+ (- 31) |hanoi_#t~ret4|) 2) 2) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,750 INFO L290 TraceCheckUtils]: 41: Hoare triple {1079#(and (<= |hanoi_#in~n| 7) (<= 1 (div (div (div (div (div (+ (- 31) |hanoi_#t~ret4|) 2) 2) 2) 2) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1083#(and (<= 1 (div (div (div (div (div (div (+ (- 63) |hanoi_#res|) 2) 2) 2) 2) 2) 2)) (<= |hanoi_#in~n| 7))} is VALID [2022-02-20 18:14:19,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {1083#(and (<= 1 (div (div (div (div (div (div (+ (- 63) |hanoi_#res|) 2) 2) 2) 2) 2) 2)) (<= |hanoi_#in~n| 7))} assume true; {1083#(and (<= 1 (div (div (div (div (div (div (+ (- 63) |hanoi_#res|) 2) 2) 2) 2) 2) 2)) (<= |hanoi_#in~n| 7))} is VALID [2022-02-20 18:14:19,751 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1083#(and (<= 1 (div (div (div (div (div (div (+ (- 63) |hanoi_#res|) 2) 2) 2) 2) 2) 2)) (<= |hanoi_#in~n| 7))} {772#true} #32#return; {1090#(and (<= |ULTIMATE.start_main_~n~0#1| 7) (<= 1 (div (div (div (div (div (div (+ (- 63) |ULTIMATE.start_main_#t~ret6#1|) 2) 2) 2) 2) 2) 2)))} is VALID [2022-02-20 18:14:19,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {1090#(and (<= |ULTIMATE.start_main_~n~0#1| 7) (<= 1 (div (div (div (div (div (div (+ (- 63) |ULTIMATE.start_main_#t~ret6#1|) 2) 2) 2) 2) 2) 2)))} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {1094#(and (<= 1 (div (div (div (div (div (div (+ (- 63) |ULTIMATE.start_main_~result~0#1|) 2) 2) 2) 2) 2) 2)) (<= |ULTIMATE.start_main_~n~0#1| 7))} is VALID [2022-02-20 18:14:19,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {1094#(and (<= 1 (div (div (div (div (div (div (+ (- 63) |ULTIMATE.start_main_~result~0#1|) 2) 2) 2) 2) 2) 2)) (<= |ULTIMATE.start_main_~n~0#1| 7))} assume !(main_~result~0#1 >= main_~n~0#1); {773#false} is VALID [2022-02-20 18:14:19,752 INFO L290 TraceCheckUtils]: 46: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-02-20 18:14:19,752 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-20 18:14:19,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:15:02,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-02-20 18:15:02,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {1104#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~result~0#1|)} assume !(main_~result~0#1 >= main_~n~0#1); {773#false} is VALID [2022-02-20 18:15:02,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {1108#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_#t~ret6#1|)} assume -2147483648 <= main_#t~ret6#1 && main_#t~ret6#1 <= 2147483647;main_~result~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1; {1104#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~result~0#1|)} is VALID [2022-02-20 18:15:02,521 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {1115#(<= |hanoi_#in~n| |hanoi_#res|)} {772#true} #32#return; {1108#(<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_#t~ret6#1|)} is VALID [2022-02-20 18:15:02,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {1115#(<= |hanoi_#in~n| |hanoi_#res|)} assume true; {1115#(<= |hanoi_#in~n| |hanoi_#res|)} is VALID [2022-02-20 18:15:02,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {1122#(<= |hanoi_#in~n| (+ (* 2 |hanoi_#t~ret4|) 1))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1115#(<= |hanoi_#in~n| |hanoi_#res|)} is VALID [2022-02-20 18:15:02,524 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} {1126#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 7 hanoi_~n))} #30#return; {1122#(<= |hanoi_#in~n| (+ (* 2 |hanoi_#t~ret4|) 1))} is VALID [2022-02-20 18:15:02,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} assume true; {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} is VALID [2022-02-20 18:15:02,526 INFO L290 TraceCheckUtils]: 38: Hoare triple {1068#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (+ (- 15) |hanoi_#t~ret4|) 2) 2) 2) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1072#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (div (+ |hanoi_#res| (- 31)) 2) 2) 2) 2) 2)))} is VALID [2022-02-20 18:15:02,528 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} {1139#(or (<= |hanoi_#in~n| 6) (< 6 hanoi_~n))} #30#return; {1068#(and (<= |hanoi_#in~n| 6) (<= 1 (div (div (div (div (+ (- 15) |hanoi_#t~ret4|) 2) 2) 2) 2)))} is VALID [2022-02-20 18:15:02,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} assume true; {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:15:02,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {1057#(and (<= 1 (div (div (div (+ (- 7) |hanoi_#t~ret4|) 2) 2) 2)) (<= |hanoi_#in~n| 5))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1061#(and (<= 1 (div (div (div (div (+ |hanoi_#res| (- 15)) 2) 2) 2) 2)) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:15:02,531 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} {1152#(or (< 5 hanoi_~n) (<= |hanoi_#in~n| 5))} #30#return; {1057#(and (<= 1 (div (div (div (+ (- 7) |hanoi_#t~ret4|) 2) 2) 2)) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:15:02,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} assume true; {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} is VALID [2022-02-20 18:15:02,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {1046#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (+ (- 3) |hanoi_#t~ret4|) 2) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1050#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (div (+ |hanoi_#res| (- 7)) 2) 2) 2)))} is VALID [2022-02-20 18:15:02,533 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} {1165#(or (<= |hanoi_#in~n| 4) (< 4 hanoi_~n))} #30#return; {1046#(and (<= |hanoi_#in~n| 4) (<= 1 (div (div (+ (- 3) |hanoi_#t~ret4|) 2) 2)))} is VALID [2022-02-20 18:15:02,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} assume true; {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:15:02,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {1035#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1039#(and (<= |hanoi_#in~n| 3) (<= 1 (div (div (+ |hanoi_#res| (- 3)) 2) 2)))} is VALID [2022-02-20 18:15:02,535 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} {1178#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} #30#return; {1035#(and (<= |hanoi_#in~n| 3) (<= 1 (div (+ (- 1) |hanoi_#t~ret4|) 2)))} is VALID [2022-02-20 18:15:02,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} assume true; {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:15:02,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {1024#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + 2 * #t~ret4;havoc #t~ret4; {1028#(and (<= 1 (div (+ (- 1) |hanoi_#res|) 2)) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:15:02,537 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} {1191#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} #30#return; {1024#(and (<= |hanoi_#in~n| 2) (<= 1 |hanoi_#t~ret4|))} is VALID [2022-02-20 18:15:02,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} assume true; {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:15:02,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {1201#(or (< 1 hanoi_~n) (<= |hanoi_#in~n| 1))} assume 1 == ~n;#res := 1; {1017#(and (<= 1 |hanoi_#res|) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:15:02,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {772#true} ~n := #in~n; {1201#(or (< 1 hanoi_~n) (<= |hanoi_#in~n| 1))} is VALID [2022-02-20 18:15:02,538 INFO L272 TraceCheckUtils]: 21: Hoare triple {1191#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:15:02,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {1191#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} assume !(1 == ~n); {1191#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:15:02,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {772#true} ~n := #in~n; {1191#(or (< 2 hanoi_~n) (<= |hanoi_#in~n| 2))} is VALID [2022-02-20 18:15:02,539 INFO L272 TraceCheckUtils]: 18: Hoare triple {1178#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:15:02,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} assume !(1 == ~n); {1178#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} is VALID [2022-02-20 18:15:02,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#true} ~n := #in~n; {1178#(or (<= |hanoi_#in~n| 3) (< 3 hanoi_~n))} is VALID [2022-02-20 18:15:02,539 INFO L272 TraceCheckUtils]: 15: Hoare triple {1165#(or (<= |hanoi_#in~n| 4) (< 4 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:15:02,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {1165#(or (<= |hanoi_#in~n| 4) (< 4 hanoi_~n))} assume !(1 == ~n); {1165#(or (<= |hanoi_#in~n| 4) (< 4 hanoi_~n))} is VALID [2022-02-20 18:15:02,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#true} ~n := #in~n; {1165#(or (<= |hanoi_#in~n| 4) (< 4 hanoi_~n))} is VALID [2022-02-20 18:15:02,542 INFO L272 TraceCheckUtils]: 12: Hoare triple {1152#(or (< 5 hanoi_~n) (<= |hanoi_#in~n| 5))} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:15:02,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {1152#(or (< 5 hanoi_~n) (<= |hanoi_#in~n| 5))} assume !(1 == ~n); {1152#(or (< 5 hanoi_~n) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:15:02,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {772#true} ~n := #in~n; {1152#(or (< 5 hanoi_~n) (<= |hanoi_#in~n| 5))} is VALID [2022-02-20 18:15:02,543 INFO L272 TraceCheckUtils]: 9: Hoare triple {1139#(or (<= |hanoi_#in~n| 6) (< 6 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:15:02,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1139#(or (<= |hanoi_#in~n| 6) (< 6 hanoi_~n))} assume !(1 == ~n); {1139#(or (<= |hanoi_#in~n| 6) (< 6 hanoi_~n))} is VALID [2022-02-20 18:15:02,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#true} ~n := #in~n; {1139#(or (<= |hanoi_#in~n| 6) (< 6 hanoi_~n))} is VALID [2022-02-20 18:15:02,545 INFO L272 TraceCheckUtils]: 6: Hoare triple {1126#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 7 hanoi_~n))} call #t~ret4 := hanoi(~n - 1); {772#true} is VALID [2022-02-20 18:15:02,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {1126#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 7 hanoi_~n))} assume !(1 == ~n); {1126#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 7 hanoi_~n))} is VALID [2022-02-20 18:15:02,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#true} ~n := #in~n; {1126#(or (<= (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) (div (+ (* (- 1) |hanoi_#in~n|) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2))) 1) (- 2)) 1) (< 7 hanoi_~n))} is VALID [2022-02-20 18:15:02,548 INFO L272 TraceCheckUtils]: 3: Hoare triple {772#true} call main_#t~ret6#1 := hanoi(main_~n~0#1); {772#true} is VALID [2022-02-20 18:15:02,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume !(main_~n~0#1 < 1 || main_~n~0#1 > 31); {772#true} is VALID [2022-02-20 18:15:02,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~n~0#1, main_~result~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~n~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {772#true} is VALID [2022-02-20 18:15:02,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-02-20 18:15:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 18:15:02,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393882409] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:15:02,549 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:15:02,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 24] total 45 [2022-02-20 18:15:02,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523611482] [2022-02-20 18:15:02,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:15:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.288888888888889) internal successors, (58), 29 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) Word has length 47