/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:15:15,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:15:15,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:15:15,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:15:15,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:15:15,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:15:15,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:15:15,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:15:15,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:15:15,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:15:15,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:15:15,431 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:15:15,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:15:15,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:15:15,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:15:15,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:15:15,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:15:15,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:15:15,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:15:15,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:15:15,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:15:15,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:15:15,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:15:15,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:15:15,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:15:15,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:15:15,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:15:15,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:15:15,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:15:15,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:15:15,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:15:15,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:15:15,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:15:15,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:15:15,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:15:15,505 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:15:15,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:15:15,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:15:15,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:15:15,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:15:15,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:15:15,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:15:15,567 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:15:15,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:15:15,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:15:15,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:15:15,572 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:15:15,573 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:15:15,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:15:15,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:15:15,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:15:15,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:15:15,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:15:15,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:15:15,575 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:15:15,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:15:15,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:15:15,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:15:15,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:15:15,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:15:15,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:15:15,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:15:15,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:15:15,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:15:15,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:15:15,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:15:15,578 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:15:15,578 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-bitabs/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 [2021-01-06 19:15:16,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:15:16,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:15:16,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:15:16,055 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:15:16,056 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:15:16,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-01-06 19:15:16,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/de7c88509/f6c7a79d30114b13999b39c03912a881/FLAGeb0ca02b0 [2021-01-06 19:15:16,813 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:15:16,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-01-06 19:15:16,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/de7c88509/f6c7a79d30114b13999b39c03912a881/FLAGeb0ca02b0 [2021-01-06 19:15:17,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/de7c88509/f6c7a79d30114b13999b39c03912a881 [2021-01-06 19:15:17,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:15:17,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:15:17,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:15:17,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:15:17,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:15:17,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a50dc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17, skipping insertion in model container [2021-01-06 19:15:17,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:15:17,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:15:17,387 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-01-06 19:15:17,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:15:17,402 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:15:17,419 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-01-06 19:15:17,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:15:17,438 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:15:17,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17 WrapperNode [2021-01-06 19:15:17,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:15:17,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:15:17,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:15:17,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:15:17,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:15:17,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:15:17,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:15:17,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:15:17,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... [2021-01-06 19:15:17,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:15:17,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:15:17,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:15:17,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:15:17,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:15:17,601 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-01-06 19:15:17,602 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-01-06 19:15:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:15:17,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:15:17,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:15:17,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:15:18,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:15:18,022 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-01-06 19:15:18,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:15:18 BoogieIcfgContainer [2021-01-06 19:15:18,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:15:18,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:15:18,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:15:18,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:15:18,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:15:17" (1/3) ... [2021-01-06 19:15:18,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce9a9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:15:18, skipping insertion in model container [2021-01-06 19:15:18,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:15:17" (2/3) ... [2021-01-06 19:15:18,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce9a9da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:15:18, skipping insertion in model container [2021-01-06 19:15:18,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:15:18" (3/3) ... [2021-01-06 19:15:18,039 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-01-06 19:15:18,046 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:15:18,051 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:15:18,071 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:15:18,117 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:15:18,117 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:15:18,117 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:15:18,117 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:15:18,117 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:15:18,118 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:15:18,118 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:15:18,118 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:15:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2021-01-06 19:15:18,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 19:15:18,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:18,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:18,150 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-01-06 19:15:18,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:18,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801533600] [2021-01-06 19:15:18,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:15:18,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801533600] [2021-01-06 19:15:18,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:15:18,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:15:18,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579934759] [2021-01-06 19:15:18,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:15:18,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:15:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:15:18,490 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2021-01-06 19:15:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:18,624 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-01-06 19:15:18,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:15:18,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-06 19:15:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:18,636 INFO L225 Difference]: With dead ends: 31 [2021-01-06 19:15:18,637 INFO L226 Difference]: Without dead ends: 18 [2021-01-06 19:15:18,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:15:18,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-01-06 19:15:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-01-06 19:15:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-01-06 19:15:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-01-06 19:15:18,683 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-01-06 19:15:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:18,684 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-01-06 19:15:18,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:15:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-01-06 19:15:18,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 19:15:18,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:18,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:18,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:15:18,686 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:18,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-01-06 19:15:18,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:18,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202482927] [2021-01-06 19:15:18,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:15:18,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202482927] [2021-01-06 19:15:18,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:15:18,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:15:18,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003455564] [2021-01-06 19:15:18,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:15:18,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:15:18,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:15:18,802 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2021-01-06 19:15:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:18,874 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-01-06 19:15:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:15:18,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-01-06 19:15:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:18,876 INFO L225 Difference]: With dead ends: 24 [2021-01-06 19:15:18,876 INFO L226 Difference]: Without dead ends: 20 [2021-01-06 19:15:18,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:15:18,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-01-06 19:15:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-01-06 19:15:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-01-06 19:15:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-01-06 19:15:18,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-01-06 19:15:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:18,885 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-01-06 19:15:18,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:15:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-01-06 19:15:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 19:15:18,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:18,887 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:18,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:15:18,888 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:18,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:18,888 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-01-06 19:15:18,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:18,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066259700] [2021-01-06 19:15:18,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-01-06 19:15:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:18,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:15:18,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066259700] [2021-01-06 19:15:18,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211205147] [2021-01-06 19:15:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:19,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:15:19,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:15:19,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:19,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-01-06 19:15:19,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294502454] [2021-01-06 19:15:19,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:15:19,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:19,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:15:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:15:19,188 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2021-01-06 19:15:19,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:19,291 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-01-06 19:15:19,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:15:19,292 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2021-01-06 19:15:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:19,294 INFO L225 Difference]: With dead ends: 35 [2021-01-06 19:15:19,294 INFO L226 Difference]: Without dead ends: 20 [2021-01-06 19:15:19,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:15:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-01-06 19:15:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-01-06 19:15:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-01-06 19:15:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-01-06 19:15:19,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-01-06 19:15:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:19,303 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-01-06 19:15:19,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:15:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-01-06 19:15:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 19:15:19,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:19,305 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:19,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 19:15:19,521 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:19,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2021-01-06 19:15:19,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:19,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136985582] [2021-01-06 19:15:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:19,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:19,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:19,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:15:19,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136985582] [2021-01-06 19:15:19,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440978683] [2021-01-06 19:15:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:19,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 19:15:19,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:15:19,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:19,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-01-06 19:15:19,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792484448] [2021-01-06 19:15:19,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 19:15:19,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 19:15:19,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:15:19,857 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 8 states. [2021-01-06 19:15:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:19,950 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-01-06 19:15:19,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:15:19,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2021-01-06 19:15:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:19,953 INFO L225 Difference]: With dead ends: 38 [2021-01-06 19:15:19,953 INFO L226 Difference]: Without dead ends: 34 [2021-01-06 19:15:19,954 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:15:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-01-06 19:15:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-01-06 19:15:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-01-06 19:15:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-01-06 19:15:19,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-01-06 19:15:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:19,967 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-01-06 19:15:19,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 19:15:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-01-06 19:15:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 19:15:19,969 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:19,970 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:20,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:20,184 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:20,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:20,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2021-01-06 19:15:20,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:20,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143827825] [2021-01-06 19:15:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:20,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:15:20,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143827825] [2021-01-06 19:15:20,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843953215] [2021-01-06 19:15:20,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:20,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 19:15:20,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:15:20,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 19:15:20,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-01-06 19:15:20,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:20,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-01-06 19:15:20,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854208769] [2021-01-06 19:15:20,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:15:20,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:15:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:15:20,480 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 13 states. [2021-01-06 19:15:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:20,648 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-01-06 19:15:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:15:20,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2021-01-06 19:15:20,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:20,650 INFO L225 Difference]: With dead ends: 68 [2021-01-06 19:15:20,650 INFO L226 Difference]: Without dead ends: 35 [2021-01-06 19:15:20,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:15:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-01-06 19:15:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-01-06 19:15:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2021-01-06 19:15:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-01-06 19:15:20,660 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2021-01-06 19:15:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:20,661 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-01-06 19:15:20,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:15:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-01-06 19:15:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:15:20,663 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:20,663 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:20,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:20,870 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:20,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1673648870, now seen corresponding path program 3 times [2021-01-06 19:15:20,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:20,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141200380] [2021-01-06 19:15:20,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:20,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-01-06 19:15:21,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141200380] [2021-01-06 19:15:21,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208197772] [2021-01-06 19:15:21,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:21,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-01-06 19:15:21,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:15:21,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 19:15:21,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-01-06 19:15:21,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:21,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2021-01-06 19:15:21,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785632997] [2021-01-06 19:15:21,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:15:21,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:15:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:15:21,405 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 13 states. [2021-01-06 19:15:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:21,549 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2021-01-06 19:15:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 19:15:21,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2021-01-06 19:15:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:21,553 INFO L225 Difference]: With dead ends: 84 [2021-01-06 19:15:21,553 INFO L226 Difference]: Without dead ends: 47 [2021-01-06 19:15:21,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:15:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-01-06 19:15:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2021-01-06 19:15:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-06 19:15:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2021-01-06 19:15:21,565 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2021-01-06 19:15:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:21,565 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2021-01-06 19:15:21,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:15:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2021-01-06 19:15:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:15:21,572 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:21,572 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:21,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:21,786 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:21,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 4 times [2021-01-06 19:15:21,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:21,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912221543] [2021-01-06 19:15:21,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:21,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2021-01-06 19:15:22,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912221543] [2021-01-06 19:15:22,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271589670] [2021-01-06 19:15:22,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:22,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 19:15:22,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:15:22,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2021-01-06 19:15:22,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 418 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2021-01-06 19:15:22,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:22,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2021-01-06 19:15:22,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146587278] [2021-01-06 19:15:22,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-01-06 19:15:22,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:22,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-01-06 19:15:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-01-06 19:15:22,727 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 20 states. [2021-01-06 19:15:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:23,168 INFO L93 Difference]: Finished difference Result 108 states and 169 transitions. [2021-01-06 19:15:23,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 19:15:23,169 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 147 [2021-01-06 19:15:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:23,171 INFO L225 Difference]: With dead ends: 108 [2021-01-06 19:15:23,172 INFO L226 Difference]: Without dead ends: 65 [2021-01-06 19:15:23,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=900, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 19:15:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-06 19:15:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2021-01-06 19:15:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2021-01-06 19:15:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2021-01-06 19:15:23,186 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 147 [2021-01-06 19:15:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:23,187 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2021-01-06 19:15:23,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-01-06 19:15:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2021-01-06 19:15:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-01-06 19:15:23,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:23,190 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:23,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 19:15:23,405 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1766942948, now seen corresponding path program 5 times [2021-01-06 19:15:23,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:23,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137196302] [2021-01-06 19:15:23,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:15:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-01-06 19:15:23,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137196302] [2021-01-06 19:15:23,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198053330] [2021-01-06 19:15:23,901 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:24,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2021-01-06 19:15:24,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:15:24,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 19:15:24,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2021-01-06 19:15:24,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:24,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2021-01-06 19:15:24,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125668866] [2021-01-06 19:15:24,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 19:15:24,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 19:15:24,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-01-06 19:15:24,246 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 16 states. [2021-01-06 19:15:24,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:24,467 INFO L93 Difference]: Finished difference Result 177 states and 251 transitions. [2021-01-06 19:15:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:15:24,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 174 [2021-01-06 19:15:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:24,472 INFO L225 Difference]: With dead ends: 177 [2021-01-06 19:15:24,472 INFO L226 Difference]: Without dead ends: 173 [2021-01-06 19:15:24,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:15:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-01-06 19:15:24,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2021-01-06 19:15:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-01-06 19:15:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2021-01-06 19:15:24,499 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 174 [2021-01-06 19:15:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:24,504 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2021-01-06 19:15:24,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 19:15:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2021-01-06 19:15:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2021-01-06 19:15:24,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:24,510 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:24,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:24,724 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:24,725 INFO L82 PathProgramCache]: Analyzing trace with hash 88549517, now seen corresponding path program 6 times [2021-01-06 19:15:24,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:24,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263212022] [2021-01-06 19:15:24,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:24,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:24,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:15:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-01-06 19:15:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:15:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1307 proven. 1260 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2021-01-06 19:15:25,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263212022] [2021-01-06 19:15:25,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620534440] [2021-01-06 19:15:25,858 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:25,989 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2021-01-06 19:15:25,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 19:15:25,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:15:25,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 346 proven. 1004 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2021-01-06 19:15:26,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:26,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 25 [2021-01-06 19:15:26,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102998965] [2021-01-06 19:15:26,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-06 19:15:26,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-06 19:15:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2021-01-06 19:15:26,429 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 25 states. [2021-01-06 19:15:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:27,301 INFO L93 Difference]: Finished difference Result 272 states and 444 transitions. [2021-01-06 19:15:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 19:15:27,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 324 [2021-01-06 19:15:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:27,306 INFO L225 Difference]: With dead ends: 272 [2021-01-06 19:15:27,306 INFO L226 Difference]: Without dead ends: 114 [2021-01-06 19:15:27,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=419, Invalid=1473, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:15:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-01-06 19:15:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2021-01-06 19:15:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-06 19:15:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2021-01-06 19:15:27,335 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 324 [2021-01-06 19:15:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:27,340 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2021-01-06 19:15:27,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-06 19:15:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2021-01-06 19:15:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-01-06 19:15:27,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:27,357 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:27,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:27,573 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 7 times [2021-01-06 19:15:27,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:27,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63830794] [2021-01-06 19:15:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:27,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-01-06 19:15:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:15:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-01-06 19:15:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-01-06 19:15:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:28,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-01-06 19:15:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-01-06 19:15:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-01-06 19:15:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-01-06 19:15:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-01-06 19:15:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-01-06 19:15:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-01-06 19:15:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-01-06 19:15:29,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63830794] [2021-01-06 19:15:29,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123230008] [2021-01-06 19:15:29,796 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:15:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:15:30,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 30 conjunts are in the unsatisfiable core [2021-01-06 19:15:30,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:15:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2021-01-06 19:15:30,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:15:30,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 31 [2021-01-06 19:15:30,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718859991] [2021-01-06 19:15:30,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-06 19:15:30,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:15:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-06 19:15:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2021-01-06 19:15:30,832 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand 31 states. [2021-01-06 19:15:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:15:31,969 INFO L93 Difference]: Finished difference Result 213 states and 358 transitions. [2021-01-06 19:15:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-01-06 19:15:31,970 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 528 [2021-01-06 19:15:31,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:15:31,973 INFO L225 Difference]: With dead ends: 213 [2021-01-06 19:15:31,973 INFO L226 Difference]: Without dead ends: 127 [2021-01-06 19:15:31,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=670, Invalid=2636, Unknown=0, NotChecked=0, Total=3306 [2021-01-06 19:15:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-01-06 19:15:31,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2021-01-06 19:15:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2021-01-06 19:15:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-01-06 19:15:31,995 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-01-06 19:15:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:15:31,996 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-01-06 19:15:31,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-06 19:15:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-01-06 19:15:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-01-06 19:15:32,014 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:15:32,014 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:15:32,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 19:15:32,229 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:15:32,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:15:32,230 INFO L82 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 8 times [2021-01-06 19:15:32,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:15:32,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119534570] [2021-01-06 19:15:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:15:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:15:32,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:15:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:15:32,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:15:32,575 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:15:32,575 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:15:32,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:15:32,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:15:32 BoogieIcfgContainer [2021-01-06 19:15:32,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:15:32,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:15:32,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:15:32,819 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:15:32,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:15:18" (3/4) ... [2021-01-06 19:15:32,822 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:15:33,023 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive/Fibonacci05.c-witness.graphml [2021-01-06 19:15:33,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:15:33,025 INFO L168 Benchmark]: Toolchain (without parser) took 15833.04 ms. Allocated memory was 160.4 MB in the beginning and 497.0 MB in the end (delta: 336.6 MB). Free memory was 134.7 MB in the beginning and 447.3 MB in the end (delta: -312.6 MB). Peak memory consumption was 25.3 MB. Max. memory is 8.0 GB. [2021-01-06 19:15:33,026 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 160.4 MB. Free memory is still 143.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:15:33,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.31 ms. Allocated memory is still 160.4 MB. Free memory was 134.4 MB in the beginning and 125.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:15:33,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.97 ms. Allocated memory is still 160.4 MB. Free memory was 125.2 MB in the beginning and 123.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:15:33,027 INFO L168 Benchmark]: Boogie Preprocessor took 21.77 ms. Allocated memory is still 160.4 MB. Free memory was 123.8 MB in the beginning and 122.9 MB in the end (delta: 894.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:15:33,027 INFO L168 Benchmark]: RCFGBuilder took 525.07 ms. Allocated memory is still 160.4 MB. Free memory was 122.9 MB in the beginning and 138.3 MB in the end (delta: -15.4 MB). Peak memory consumption was 12.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:15:33,028 INFO L168 Benchmark]: TraceAbstraction took 14789.90 ms. Allocated memory was 160.4 MB in the beginning and 497.0 MB in the end (delta: 336.6 MB). Free memory was 138.2 MB in the beginning and 466.7 MB in the end (delta: -328.6 MB). Peak memory consumption was 296.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:15:33,028 INFO L168 Benchmark]: Witness Printer took 205.04 ms. Allocated memory is still 497.0 MB. Free memory was 466.7 MB in the beginning and 447.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2021-01-06 19:15:33,031 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 160.4 MB. Free memory is still 143.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 245.31 ms. Allocated memory is still 160.4 MB. Free memory was 134.4 MB in the beginning and 125.2 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 36.97 ms. Allocated memory is still 160.4 MB. Free memory was 125.2 MB in the beginning and 123.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 21.77 ms. Allocated memory is still 160.4 MB. Free memory was 123.8 MB in the beginning and 122.9 MB in the end (delta: 894.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * RCFGBuilder took 525.07 ms. Allocated memory is still 160.4 MB. Free memory was 122.9 MB in the beginning and 138.3 MB in the end (delta: -15.4 MB). Peak memory consumption was 12.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 14789.90 ms. Allocated memory was 160.4 MB in the beginning and 497.0 MB in the end (delta: 336.6 MB). Free memory was 138.2 MB in the beginning and 466.7 MB in the end (delta: -328.6 MB). Peak memory consumption was 296.4 MB. Max. memory is 8.0 GB. * Witness Printer took 205.04 ms. Allocated memory is still 497.0 MB. Free memory was 466.7 MB in the beginning and 447.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.4s, OverallIterations: 11, TraceHistogramMax: 77, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 194 SDtfs, 701 SDslu, 676 SDs, 0 SdLazy, 1735 SolverSat, 821 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1914 GetRequests, 1710 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 62 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 3125 NumberOfCodeBlocks, 2903 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 2647 ConstructedInterpolants, 0 QuantifiedInterpolants, 1364103 SizeOfPredicates, 44 NumberOfNonLiveVariables, 2651 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 41012/51034 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...