/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-dev-4f750a8 [2020-12-22 06:58:16,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 06:58:16,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 06:58:16,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 06:58:16,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 06:58:16,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 06:58:16,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 06:58:16,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 06:58:16,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 06:58:16,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 06:58:16,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 06:58:16,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 06:58:16,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 06:58:16,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 06:58:16,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 06:58:16,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 06:58:16,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 06:58:16,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 06:58:16,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 06:58:16,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 06:58:16,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 06:58:16,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 06:58:16,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 06:58:16,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 06:58:16,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 06:58:16,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 06:58:16,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 06:58:16,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 06:58:16,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 06:58:16,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 06:58:16,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 06:58:16,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 06:58:16,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 06:58:16,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 06:58:16,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 06:58:16,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 06:58:16,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 06:58:16,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 06:58:16,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 06:58:16,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 06:58:16,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 06:58:16,884 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 06:58:16,930 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 06:58:16,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 06:58:16,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 06:58:16,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 06:58:16,936 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 06:58:16,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 06:58:16,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 06:58:16,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 06:58:16,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 06:58:16,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 06:58:16,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 06:58:16,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 06:58:16,938 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 06:58:16,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 06:58:16,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 06:58:16,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 06:58:16,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 06:58:16,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 06:58:16,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 06:58:16,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 06:58:16,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 06:58:16,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 06:58:16,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 06:58:16,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 06:58:16,941 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 06:58:16,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 06:58:17,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 06:58:17,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 06:58:17,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 06:58:17,343 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 06:58:17,344 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 06:58:17,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2020-12-22 06:58:17,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0617493/7534d260c0704626afda8a70fddbed17/FLAGefd9c87bc [2020-12-22 06:58:18,122 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 06:58:18,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2020-12-22 06:58:18,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0617493/7534d260c0704626afda8a70fddbed17/FLAGefd9c87bc [2020-12-22 06:58:18,482 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0617493/7534d260c0704626afda8a70fddbed17 [2020-12-22 06:58:18,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 06:58:18,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 06:58:18,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 06:58:18,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 06:58:18,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 06:58:18,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@541ec934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18, skipping insertion in model container [2020-12-22 06:58:18,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 06:58:18,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 06:58:18,679 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2020-12-22 06:58:18,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 06:58:18,694 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 06:58:18,712 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2020-12-22 06:58:18,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 06:58:18,730 INFO L208 MainTranslator]: Completed translation [2020-12-22 06:58:18,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18 WrapperNode [2020-12-22 06:58:18,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 06:58:18,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 06:58:18,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 06:58:18,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 06:58:18,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 06:58:18,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 06:58:18,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 06:58:18,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 06:58:18,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... [2020-12-22 06:58:18,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 06:58:18,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 06:58:18,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 06:58:18,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 06:58:18,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 06:58:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-12-22 06:58:18,907 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-12-22 06:58:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 06:58:18,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 06:58:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 06:58:18,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 06:58:19,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 06:58:19,180 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-22 06:58:19,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:58:19 BoogieIcfgContainer [2020-12-22 06:58:19,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 06:58:19,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 06:58:19,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 06:58:19,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 06:58:19,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 06:58:18" (1/3) ... [2020-12-22 06:58:19,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421122a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 06:58:19, skipping insertion in model container [2020-12-22 06:58:19,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:18" (2/3) ... [2020-12-22 06:58:19,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421122a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 06:58:19, skipping insertion in model container [2020-12-22 06:58:19,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:58:19" (3/3) ... [2020-12-22 06:58:19,216 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-12-22 06:58:19,227 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 06:58:19,232 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 06:58:19,254 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 06:58:19,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 06:58:19,300 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 06:58:19,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 06:58:19,301 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 06:58:19,301 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 06:58:19,301 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 06:58:19,301 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 06:58:19,301 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 06:58:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-12-22 06:58:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 06:58:19,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:19,329 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:19,329 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:19,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:19,336 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2020-12-22 06:58:19,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:19,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593497401] [2020-12-22 06:58:19,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:19,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 06:58:19,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593497401] [2020-12-22 06:58:19,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 06:58:19,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 06:58:19,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915706124] [2020-12-22 06:58:19,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 06:58:19,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:19,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 06:58:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 06:58:19,790 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2020-12-22 06:58:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:19,998 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-12-22 06:58:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 06:58:20,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-22 06:58:20,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:20,011 INFO L225 Difference]: With dead ends: 31 [2020-12-22 06:58:20,011 INFO L226 Difference]: Without dead ends: 18 [2020-12-22 06:58:20,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 06:58:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-12-22 06:58:20,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-12-22 06:58:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-22 06:58:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-22 06:58:20,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-12-22 06:58:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:20,060 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-22 06:58:20,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 06:58:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-22 06:58:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 06:58:20,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:20,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:20,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 06:58:20,063 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:20,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2020-12-22 06:58:20,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:20,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698181355] [2020-12-22 06:58:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 06:58:20,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698181355] [2020-12-22 06:58:20,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 06:58:20,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 06:58:20,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589263019] [2020-12-22 06:58:20,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 06:58:20,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 06:58:20,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 06:58:20,141 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-12-22 06:58:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:20,224 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-12-22 06:58:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 06:58:20,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-22 06:58:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:20,227 INFO L225 Difference]: With dead ends: 24 [2020-12-22 06:58:20,227 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 06:58:20,228 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 [2020-12-22 06:58:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 06:58:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-12-22 06:58:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-22 06:58:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-22 06:58:20,235 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-12-22 06:58:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:20,235 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-22 06:58:20,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 06:58:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-22 06:58:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 06:58:20,237 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:20,237 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:20,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 06:58:20,237 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:20,238 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2020-12-22 06:58:20,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:20,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976374650] [2020-12-22 06:58:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-22 06:58:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 06:58:20,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976374650] [2020-12-22 06:58:20,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970610100] [2020-12-22 06:58:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:20,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 06:58:20,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 06:58:20,766 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:20,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-22 06:58:20,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564482857] [2020-12-22 06:58:20,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 06:58:20,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:20,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 06:58:20,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-22 06:58:20,770 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-12-22 06:58:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:20,981 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-12-22 06:58:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 06:58:20,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-22 06:58:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:20,984 INFO L225 Difference]: With dead ends: 35 [2020-12-22 06:58:20,984 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 06:58:20,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-22 06:58:20,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 06:58:20,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-22 06:58:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-22 06:58:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-12-22 06:58:20,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-12-22 06:58:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:20,993 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-12-22 06:58:20,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 06:58:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-12-22 06:58:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 06:58:20,995 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:20,995 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:21,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-22 06:58:21,209 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:21,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:21,210 INFO L82 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2020-12-22 06:58:21,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:21,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172101621] [2020-12-22 06:58:21,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:21,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:21,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:21,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:21,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 06:58:21,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172101621] [2020-12-22 06:58:21,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745713322] [2020-12-22 06:58:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:21,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 06:58:21,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 06:58:21,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:21,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-12-22 06:58:21,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835288232] [2020-12-22 06:58:21,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 06:58:21,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 06:58:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-22 06:58:21,597 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 8 states. [2020-12-22 06:58:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:21,746 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-12-22 06:58:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 06:58:21,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-22 06:58:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:21,749 INFO L225 Difference]: With dead ends: 38 [2020-12-22 06:58:21,749 INFO L226 Difference]: Without dead ends: 34 [2020-12-22 06:58:21,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-22 06:58:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-22 06:58:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-12-22 06:58:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-22 06:58:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-12-22 06:58:21,761 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-12-22 06:58:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:21,762 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-12-22 06:58:21,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 06:58:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-12-22 06:58:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 06:58:21,764 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:21,764 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:21,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:21,978 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2020-12-22 06:58:21,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:21,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776601427] [2020-12-22 06:58:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:22,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:22,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:22,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:22,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:22,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-22 06:58:22,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776601427] [2020-12-22 06:58:22,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793090712] [2020-12-22 06:58:22,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:22,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 06:58:22,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:22,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 06:58:22,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 06:58:22,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:22,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-12-22 06:58:22,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463734771] [2020-12-22 06:58:22,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 06:58:22,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:22,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 06:58:22,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-12-22 06:58:22,398 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 13 states. [2020-12-22 06:58:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:22,739 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2020-12-22 06:58:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 06:58:22,741 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-12-22 06:58:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:22,743 INFO L225 Difference]: With dead ends: 68 [2020-12-22 06:58:22,743 INFO L226 Difference]: Without dead ends: 35 [2020-12-22 06:58:22,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-12-22 06:58:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-12-22 06:58:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-12-22 06:58:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-12-22 06:58:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2020-12-22 06:58:22,753 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2020-12-22 06:58:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:22,754 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2020-12-22 06:58:22,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 06:58:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2020-12-22 06:58:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-22 06:58:22,757 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:22,757 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:22,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:22,971 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1673648870, now seen corresponding path program 3 times [2020-12-22 06:58:22,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:22,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385749352] [2020-12-22 06:58:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-12-22 06:58:23,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385749352] [2020-12-22 06:58:23,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940158699] [2020-12-22 06:58:23,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:23,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-12-22 06:58:23,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:23,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 06:58:23,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-12-22 06:58:23,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:23,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2020-12-22 06:58:23,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651587930] [2020-12-22 06:58:23,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 06:58:23,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:23,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 06:58:23,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-12-22 06:58:23,480 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 13 states. [2020-12-22 06:58:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:23,666 INFO L93 Difference]: Finished difference Result 84 states and 123 transitions. [2020-12-22 06:58:23,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 06:58:23,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2020-12-22 06:58:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:23,672 INFO L225 Difference]: With dead ends: 84 [2020-12-22 06:58:23,672 INFO L226 Difference]: Without dead ends: 47 [2020-12-22 06:58:23,674 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 [2020-12-22 06:58:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-22 06:58:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2020-12-22 06:58:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-22 06:58:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2020-12-22 06:58:23,687 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 65 [2020-12-22 06:58:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:23,687 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2020-12-22 06:58:23,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 06:58:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2020-12-22 06:58:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-12-22 06:58:23,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:23,692 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:23,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:23,898 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:23,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1511331526, now seen corresponding path program 4 times [2020-12-22 06:58:23,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:23,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141277459] [2020-12-22 06:58:23,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:23,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-12-22 06:58:24,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141277459] [2020-12-22 06:58:24,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673114704] [2020-12-22 06:58:24,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:24,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 06:58:24,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:24,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-22 06:58:24,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 418 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2020-12-22 06:58:24,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:24,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2020-12-22 06:58:24,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85574983] [2020-12-22 06:58:24,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-22 06:58:24,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:24,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-22 06:58:24,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2020-12-22 06:58:24,690 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand 20 states. [2020-12-22 06:58:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:25,115 INFO L93 Difference]: Finished difference Result 108 states and 169 transitions. [2020-12-22 06:58:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 06:58:25,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 147 [2020-12-22 06:58:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:25,117 INFO L225 Difference]: With dead ends: 108 [2020-12-22 06:58:25,117 INFO L226 Difference]: Without dead ends: 65 [2020-12-22 06:58:25,119 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 [2020-12-22 06:58:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-22 06:58:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2020-12-22 06:58:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-22 06:58:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-12-22 06:58:25,130 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 147 [2020-12-22 06:58:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:25,131 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-12-22 06:58:25,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-22 06:58:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-12-22 06:58:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-12-22 06:58:25,135 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:25,135 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:25,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-22 06:58:25,347 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:25,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1766942948, now seen corresponding path program 5 times [2020-12-22 06:58:25,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:25,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506485823] [2020-12-22 06:58:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-12-22 06:58:25,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506485823] [2020-12-22 06:58:25,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26814769] [2020-12-22 06:58:25,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:25,967 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-12-22 06:58:25,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:25,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-22 06:58:25,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-12-22 06:58:26,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:26,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2020-12-22 06:58:26,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818846167] [2020-12-22 06:58:26,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-22 06:58:26,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-22 06:58:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-12-22 06:58:26,191 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 16 states. [2020-12-22 06:58:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:26,431 INFO L93 Difference]: Finished difference Result 177 states and 251 transitions. [2020-12-22 06:58:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 06:58:26,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 174 [2020-12-22 06:58:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:26,436 INFO L225 Difference]: With dead ends: 177 [2020-12-22 06:58:26,436 INFO L226 Difference]: Without dead ends: 173 [2020-12-22 06:58:26,437 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 [2020-12-22 06:58:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-22 06:58:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2020-12-22 06:58:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-22 06:58:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2020-12-22 06:58:26,466 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 174 [2020-12-22 06:58:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:26,466 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2020-12-22 06:58:26,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-22 06:58:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2020-12-22 06:58:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2020-12-22 06:58:26,473 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:26,473 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:26,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:26,687 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:26,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 88549517, now seen corresponding path program 6 times [2020-12-22 06:58:26,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:26,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833648201] [2020-12-22 06:58:26,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:26,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:26,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:26,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1307 proven. 1260 refuted. 0 times theorem prover too weak. 3472 trivial. 0 not checked. [2020-12-22 06:58:27,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833648201] [2020-12-22 06:58:27,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689704773] [2020-12-22 06:58:27,808 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:27,925 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-12-22 06:58:27,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:27,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 06:58:27,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 346 proven. 1004 refuted. 0 times theorem prover too weak. 4689 trivial. 0 not checked. [2020-12-22 06:58:28,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:28,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10] total 25 [2020-12-22 06:58:28,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046016606] [2020-12-22 06:58:28,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-22 06:58:28,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:28,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-22 06:58:28,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2020-12-22 06:58:28,296 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand 25 states. [2020-12-22 06:58:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:29,008 INFO L93 Difference]: Finished difference Result 272 states and 444 transitions. [2020-12-22 06:58:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-22 06:58:29,008 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 324 [2020-12-22 06:58:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:29,011 INFO L225 Difference]: With dead ends: 272 [2020-12-22 06:58:29,011 INFO L226 Difference]: Without dead ends: 114 [2020-12-22 06:58:29,014 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 [2020-12-22 06:58:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-22 06:58:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2020-12-22 06:58:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-12-22 06:58:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2020-12-22 06:58:29,029 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 324 [2020-12-22 06:58:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:29,030 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2020-12-22 06:58:29,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-22 06:58:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2020-12-22 06:58:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2020-12-22 06:58:29,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:29,042 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:29,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:29,257 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:29,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:29,257 INFO L82 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 7 times [2020-12-22 06:58:29,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:29,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888502391] [2020-12-22 06:58:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:29,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:29,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:29,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-22 06:58:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:30,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2020-12-22 06:58:31,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888502391] [2020-12-22 06:58:31,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521652205] [2020-12-22 06:58:31,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2020-12-22 06:58:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:31,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 1204 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-22 06:58:31,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2020-12-22 06:58:32,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:32,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 31 [2020-12-22 06:58:32,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821171451] [2020-12-22 06:58:32,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-22 06:58:32,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:32,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-22 06:58:32,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2020-12-22 06:58:32,375 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand 31 states. [2020-12-22 06:58:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:33,432 INFO L93 Difference]: Finished difference Result 213 states and 358 transitions. [2020-12-22 06:58:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-12-22 06:58:33,433 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 528 [2020-12-22 06:58:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:33,437 INFO L225 Difference]: With dead ends: 213 [2020-12-22 06:58:33,438 INFO L226 Difference]: Without dead ends: 127 [2020-12-22 06:58:33,440 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 [2020-12-22 06:58:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-12-22 06:58:33,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2020-12-22 06:58:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-12-22 06:58:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2020-12-22 06:58:33,456 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2020-12-22 06:58:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:33,458 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2020-12-22 06:58:33,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-22 06:58:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2020-12-22 06:58:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2020-12-22 06:58:33,468 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:33,468 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:33,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 06:58:33,682 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:33,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:33,683 INFO L82 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 8 times [2020-12-22 06:58:33,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:33,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365752508] [2020-12-22 06:58:33,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 06:58:33,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 06:58:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 06:58:33,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 06:58:34,119 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 06:58:34,119 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 06:58:34,120 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 06:58:34,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 06:58:34 BoogieIcfgContainer [2020-12-22 06:58:34,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 06:58:34,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 06:58:34,346 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 06:58:34,346 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 06:58:34,346 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:58:19" (3/4) ... [2020-12-22 06:58:34,348 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 06:58:34,549 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive/Fibonacci05.c-witness.graphml [2020-12-22 06:58:34,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 06:58:34,551 INFO L168 Benchmark]: Toolchain (without parser) took 16060.08 ms. Allocated memory was 154.1 MB in the beginning and 585.1 MB in the end (delta: 431.0 MB). Free memory was 129.4 MB in the beginning and 523.5 MB in the end (delta: -394.2 MB). Peak memory consumption was 37.3 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,552 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 154.1 MB. Free memory is still 126.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 06:58:34,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.22 ms. Allocated memory is still 154.1 MB. Free memory was 129.1 MB in the beginning and 119.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 154.1 MB. Free memory was 119.8 MB in the beginning and 118.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,554 INFO L168 Benchmark]: Boogie Preprocessor took 22.18 ms. Allocated memory is still 154.1 MB. Free memory was 118.5 MB in the beginning and 117.6 MB in the end (delta: 976.9 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,554 INFO L168 Benchmark]: RCFGBuilder took 389.57 ms. Allocated memory is still 154.1 MB. Free memory was 117.6 MB in the beginning and 105.7 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,555 INFO L168 Benchmark]: TraceAbstraction took 15142.82 ms. Allocated memory was 154.1 MB in the beginning and 585.1 MB in the end (delta: 431.0 MB). Free memory was 137.0 MB in the beginning and 542.5 MB in the end (delta: -405.5 MB). Peak memory consumption was 294.2 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,555 INFO L168 Benchmark]: Witness Printer took 203.85 ms. Allocated memory is still 585.1 MB. Free memory was 542.5 MB in the beginning and 523.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2020-12-22 06:58:34,557 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.18 ms. Allocated memory is still 154.1 MB. Free memory is still 126.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 236.22 ms. Allocated memory is still 154.1 MB. Free memory was 129.1 MB in the beginning and 119.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 36.80 ms. Allocated memory is still 154.1 MB. Free memory was 119.8 MB in the beginning and 118.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 22.18 ms. Allocated memory is still 154.1 MB. Free memory was 118.5 MB in the beginning and 117.6 MB in the end (delta: 976.9 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 389.57 ms. Allocated memory is still 154.1 MB. Free memory was 117.6 MB in the beginning and 105.7 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15142.82 ms. Allocated memory was 154.1 MB in the beginning and 585.1 MB in the end (delta: 431.0 MB). Free memory was 137.0 MB in the beginning and 542.5 MB in the end (delta: -405.5 MB). Peak memory consumption was 294.2 MB. Max. memory is 8.0 GB. * Witness Printer took 203.85 ms. Allocated memory is still 585.1 MB. Free memory was 542.5 MB in the beginning and 523.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 18.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.8s, OverallIterations: 11, TraceHistogramMax: 77, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 194 SDtfs, 701 SDslu, 676 SDs, 0 SdLazy, 1737 SolverSat, 827 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1914 GetRequests, 1710 SyntacticMatches, 2 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 2.5s 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s 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...