/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 17:58:54,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 17:58:54,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 17:58:54,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 17:58:54,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 17:58:54,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 17:58:54,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 17:58:54,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 17:58:54,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 17:58:54,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 17:58:54,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 17:58:54,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 17:58:54,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 17:58:54,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 17:58:54,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 17:58:54,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 17:58:54,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 17:58:54,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 17:58:54,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 17:58:54,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 17:58:54,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 17:58:54,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 17:58:54,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 17:58:54,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 17:58:54,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 17:58:54,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 17:58:54,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 17:58:54,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 17:58:54,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 17:58:54,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 17:58:54,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 17:58:54,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 17:58:54,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 17:58:54,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 17:58:54,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 17:58:54,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 17:58:54,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 17:58:54,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 17:58:54,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 17:58:54,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 17:58:54,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 17:58:54,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-23 17:58:55,022 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 17:58:55,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 17:58:55,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 17:58:55,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 17:58:55,028 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 17:58:55,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 17:58:55,029 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 17:58:55,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 17:58:55,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 17:58:55,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 17:58:55,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 17:58:55,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 17:58:55,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 17:58:55,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 17:58:55,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 17:58:55,033 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 17:58:55,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 17:58:55,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 17:58:55,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 17:58:55,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 17:58:55,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 17:58:55,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 17:58:55,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 17:58:55,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 17:58:55,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 17:58:55,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 17:58:55,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 17:58:55,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 17:58:55,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 17:58:55,037 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-10-23 17:58:55,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 17:58:55,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 17:58:55,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 17:58:55,549 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 17:58:55,550 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 17:58:55,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-10-23 17:58:55,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b104bd8a/fddc8ea1b53a4d46a8323c7b5e475d45/FLAGb8e987114 [2020-10-23 17:58:56,294 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 17:58:56,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-10-23 17:58:56,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b104bd8a/fddc8ea1b53a4d46a8323c7b5e475d45/FLAGb8e987114 [2020-10-23 17:58:56,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b104bd8a/fddc8ea1b53a4d46a8323c7b5e475d45 [2020-10-23 17:58:56,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 17:58:56,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 17:58:56,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 17:58:56,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 17:58:56,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 17:58:56,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfc022e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56, skipping insertion in model container [2020-10-23 17:58:56,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 17:58:56,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 17:58:56,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 17:58:56,889 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 17:58:56,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 17:58:56,925 INFO L208 MainTranslator]: Completed translation [2020-10-23 17:58:56,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56 WrapperNode [2020-10-23 17:58:56,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 17:58:56,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 17:58:56,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 17:58:56,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 17:58:56,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (1/1) ... [2020-10-23 17:58:56,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 17:58:56,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 17:58:56,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 17:58:56,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 17:58:56,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (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-10-23 17:58:57,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 17:58:57,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 17:58:57,052 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 17:58:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-10-23 17:58:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 17:58:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 17:58:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 17:58:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 17:58:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 17:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 17:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-10-23 17:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 17:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 17:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 17:58:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 17:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 17:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 17:58:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 17:58:57,410 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 17:58:57,411 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 17:58:57,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:58:57 BoogieIcfgContainer [2020-10-23 17:58:57,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 17:58:57,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 17:58:57,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 17:58:57,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 17:58:57,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 05:58:56" (1/3) ... [2020-10-23 17:58:57,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517f2a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:58:57, skipping insertion in model container [2020-10-23 17:58:57,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:58:56" (2/3) ... [2020-10-23 17:58:57,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517f2a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:58:57, skipping insertion in model container [2020-10-23 17:58:57,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:58:57" (3/3) ... [2020-10-23 17:58:57,424 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-10-23 17:58:57,441 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 17:58:57,447 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 17:58:57,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 17:58:57,510 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 17:58:57,510 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 17:58:57,510 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 17:58:57,510 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 17:58:57,511 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 17:58:57,511 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 17:58:57,511 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 17:58:57,511 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 17:58:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-10-23 17:58:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-23 17:58:57,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:58:57,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:58:57,546 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:58:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:58:57,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2107265492, now seen corresponding path program 1 times [2020-10-23 17:58:57,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:58:57,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634112535] [2020-10-23 17:58:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:58:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:57,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:58:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:57,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:58:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 17:58:58,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634112535] [2020-10-23 17:58:58,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 17:58:58,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 17:58:58,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203069615] [2020-10-23 17:58:58,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 17:58:58,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:58:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 17:58:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 17:58:58,060 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 6 states. [2020-10-23 17:58:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:58:58,566 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-10-23 17:58:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 17:58:58,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-23 17:58:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:58:58,579 INFO L225 Difference]: With dead ends: 41 [2020-10-23 17:58:58,579 INFO L226 Difference]: Without dead ends: 23 [2020-10-23 17:58:58,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 17:58:58,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-23 17:58:58,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-23 17:58:58,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-23 17:58:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-23 17:58:58,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2020-10-23 17:58:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:58:58,636 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-23 17:58:58,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 17:58:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-10-23 17:58:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-23 17:58:58,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:58:58,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:58:58,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 17:58:58,640 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:58:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:58:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1001048603, now seen corresponding path program 1 times [2020-10-23 17:58:58,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:58:58,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575650076] [2020-10-23 17:58:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:58:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:58,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:58:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:58,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:58:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 17:58:58,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575650076] [2020-10-23 17:58:58,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 17:58:58,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 17:58:58,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435887027] [2020-10-23 17:58:58,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 17:58:58,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:58:58,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 17:58:58,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 17:58:58,762 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-10-23 17:58:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:58:59,047 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-10-23 17:58:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 17:58:59,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-23 17:58:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:58:59,050 INFO L225 Difference]: With dead ends: 30 [2020-10-23 17:58:59,050 INFO L226 Difference]: Without dead ends: 25 [2020-10-23 17:58:59,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-23 17:58:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-23 17:58:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-23 17:58:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-23 17:58:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-23 17:58:59,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2020-10-23 17:58:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:58:59,064 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-23 17:58:59,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 17:58:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-10-23 17:58:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-23 17:58:59,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:58:59,066 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:58:59,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 17:58:59,066 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:58:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:58:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash -768223736, now seen corresponding path program 1 times [2020-10-23 17:58:59,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:58:59,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646924452] [2020-10-23 17:58:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:58:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:59,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:58:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:59,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:58:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:59,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:58:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:59,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-23 17:58:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-23 17:58:59,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646924452] [2020-10-23 17:58:59,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697125362] [2020-10-23 17:58:59,285 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-10-23 17:58:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:58:59,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 17:58:59,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:58:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-23 17:58:59,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:58:59,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-10-23 17:58:59,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619475709] [2020-10-23 17:58:59,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 17:58:59,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:58:59,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 17:58:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 17:58:59,503 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-10-23 17:58:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:58:59,809 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-10-23 17:58:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 17:58:59,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-23 17:58:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:58:59,812 INFO L225 Difference]: With dead ends: 41 [2020-10-23 17:58:59,812 INFO L226 Difference]: Without dead ends: 25 [2020-10-23 17:58:59,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-10-23 17:58:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-23 17:58:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-23 17:58:59,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-23 17:58:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-10-23 17:58:59,822 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 28 [2020-10-23 17:58:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:58:59,823 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-23 17:58:59,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 17:58:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-10-23 17:58:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-23 17:58:59,837 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:58:59,837 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:00,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-23 17:59:00,052 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:00,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1973821333, now seen corresponding path program 1 times [2020-10-23 17:59:00,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:00,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421884024] [2020-10-23 17:59:00,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:00,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:59:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:00,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:59:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:00,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:00,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 17:59:00,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421884024] [2020-10-23 17:59:00,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965070751] [2020-10-23 17:59:00,221 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-10-23 17:59:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:00,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 17:59:00,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:59:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 17:59:00,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:59:00,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-10-23 17:59:00,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980609104] [2020-10-23 17:59:00,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 17:59:00,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:59:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 17:59:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-23 17:59:00,329 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2020-10-23 17:59:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:59:00,686 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-10-23 17:59:00,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 17:59:00,687 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-10-23 17:59:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:59:00,690 INFO L225 Difference]: With dead ends: 44 [2020-10-23 17:59:00,690 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 17:59:00,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-23 17:59:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 17:59:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 17:59:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 17:59:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-10-23 17:59:00,704 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 29 [2020-10-23 17:59:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:59:00,704 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-23 17:59:00,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 17:59:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2020-10-23 17:59:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-23 17:59:00,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:00,707 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:00,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 17:59:00,921 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1902544615, now seen corresponding path program 2 times [2020-10-23 17:59:00,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:00,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042174048] [2020-10-23 17:59:00,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:59:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:59:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-23 17:59:01,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042174048] [2020-10-23 17:59:01,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614072304] [2020-10-23 17:59:01,147 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-10-23 17:59:01,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 17:59:01,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 17:59:01,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-23 17:59:01,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:59:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-23 17:59:01,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:59:01,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-10-23 17:59:01,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779761334] [2020-10-23 17:59:01,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 17:59:01,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:59:01,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 17:59:01,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-23 17:59:01,332 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 13 states. [2020-10-23 17:59:02,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:59:02,293 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2020-10-23 17:59:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 17:59:02,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2020-10-23 17:59:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:59:02,299 INFO L225 Difference]: With dead ends: 74 [2020-10-23 17:59:02,299 INFO L226 Difference]: Without dead ends: 40 [2020-10-23 17:59:02,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2020-10-23 17:59:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-23 17:59:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-10-23 17:59:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-23 17:59:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-10-23 17:59:02,312 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 42 [2020-10-23 17:59:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:59:02,317 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-10-23 17:59:02,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 17:59:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-10-23 17:59:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-23 17:59:02,323 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:02,323 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:02,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 17:59:02,524 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash -217233873, now seen corresponding path program 3 times [2020-10-23 17:59:02,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:02,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470439948] [2020-10-23 17:59:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:59:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:59:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-23 17:59:02,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470439948] [2020-10-23 17:59:02,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091943835] [2020-10-23 17:59:02,810 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-10-23 17:59:02,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-23 17:59:02,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 17:59:02,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-23 17:59:02,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:59:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-10-23 17:59:03,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:59:03,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2020-10-23 17:59:03,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369302447] [2020-10-23 17:59:03,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 17:59:03,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:59:03,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 17:59:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-23 17:59:03,045 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 11 states. [2020-10-23 17:59:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:59:03,735 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2020-10-23 17:59:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 17:59:03,735 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2020-10-23 17:59:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:59:03,739 INFO L225 Difference]: With dead ends: 90 [2020-10-23 17:59:03,739 INFO L226 Difference]: Without dead ends: 52 [2020-10-23 17:59:03,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-10-23 17:59:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-23 17:59:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-10-23 17:59:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-23 17:59:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2020-10-23 17:59:03,756 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 70 [2020-10-23 17:59:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:59:03,757 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-10-23 17:59:03,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 17:59:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2020-10-23 17:59:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-10-23 17:59:03,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:03,763 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:03,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 17:59:03,972 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:03,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:03,974 INFO L82 PathProgramCache]: Analyzing trace with hash 704043195, now seen corresponding path program 4 times [2020-10-23 17:59:03,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:03,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708846450] [2020-10-23 17:59:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:59:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:59:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 17:59:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 17:59:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-10-23 17:59:04,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708846450] [2020-10-23 17:59:04,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997496992] [2020-10-23 17:59:04,547 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-10-23 17:59:04,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-23 17:59:04,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 17:59:04,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-23 17:59:04,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:59:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 418 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2020-10-23 17:59:04,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:59:04,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 17 [2020-10-23 17:59:04,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341225678] [2020-10-23 17:59:04,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-23 17:59:04,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:59:04,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-23 17:59:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-10-23 17:59:04,988 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 17 states. [2020-10-23 17:59:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:59:06,558 INFO L93 Difference]: Finished difference Result 114 states and 175 transitions. [2020-10-23 17:59:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-23 17:59:06,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 152 [2020-10-23 17:59:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:59:06,561 INFO L225 Difference]: With dead ends: 114 [2020-10-23 17:59:06,561 INFO L226 Difference]: Without dead ends: 70 [2020-10-23 17:59:06,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2020-10-23 17:59:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-23 17:59:06,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-10-23 17:59:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-23 17:59:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2020-10-23 17:59:06,586 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 152 [2020-10-23 17:59:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:59:06,590 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2020-10-23 17:59:06,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-23 17:59:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-10-23 17:59:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-10-23 17:59:06,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:06,600 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:06,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-23 17:59:06,801 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:06,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1914022046, now seen corresponding path program 5 times [2020-10-23 17:59:06,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:06,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128296608] [2020-10-23 17:59:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:06,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:59:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:06,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:59:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 17:59:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 17:59:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 17:59:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-10-23 17:59:07,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128296608] [2020-10-23 17:59:07,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589291732] [2020-10-23 17:59:07,651 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-10-23 17:59:07,771 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-10-23 17:59:07,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 17:59:07,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-23 17:59:07,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:59:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2020-10-23 17:59:07,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:59:07,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2020-10-23 17:59:07,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116191094] [2020-10-23 17:59:07,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-23 17:59:07,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:59:07,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-23 17:59:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2020-10-23 17:59:07,980 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 20 states. [2020-10-23 17:59:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:59:10,402 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2020-10-23 17:59:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-23 17:59:10,403 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 220 [2020-10-23 17:59:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:59:10,405 INFO L225 Difference]: With dead ends: 149 [2020-10-23 17:59:10,406 INFO L226 Difference]: Without dead ends: 90 [2020-10-23 17:59:10,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=440, Invalid=1630, Unknown=0, NotChecked=0, Total=2070 [2020-10-23 17:59:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-23 17:59:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2020-10-23 17:59:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-23 17:59:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2020-10-23 17:59:10,432 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 220 [2020-10-23 17:59:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:59:10,432 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2020-10-23 17:59:10,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-23 17:59:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2020-10-23 17:59:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-10-23 17:59:10,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:10,444 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:10,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 17:59:10,660 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:10,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash 816815899, now seen corresponding path program 6 times [2020-10-23 17:59:10,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:10,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132706482] [2020-10-23 17:59:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:10,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 17:59:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:10,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 17:59:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:10,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 17:59:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 17:59:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-23 17:59:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 17:59:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 17:59:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 17:59:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 17:59:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 17:59:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 17:59:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-10-23 17:59:11,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132706482] [2020-10-23 17:59:11,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796198243] [2020-10-23 17:59:11,487 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-10-23 17:59:11,634 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-10-23 17:59:11,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 17:59:11,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-23 17:59:11,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 17:59:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2020-10-23 17:59:11,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 17:59:11,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2020-10-23 17:59:11,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493948995] [2020-10-23 17:59:11,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 17:59:11,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 17:59:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 17:59:11,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-10-23 17:59:11,774 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand 13 states. [2020-10-23 17:59:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 17:59:12,774 INFO L93 Difference]: Finished difference Result 266 states and 392 transitions. [2020-10-23 17:59:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 17:59:12,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 288 [2020-10-23 17:59:12,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 17:59:12,785 INFO L225 Difference]: With dead ends: 266 [2020-10-23 17:59:12,785 INFO L226 Difference]: Without dead ends: 261 [2020-10-23 17:59:12,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2020-10-23 17:59:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-10-23 17:59:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2020-10-23 17:59:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-10-23 17:59:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2020-10-23 17:59:12,859 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 288 [2020-10-23 17:59:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 17:59:12,860 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2020-10-23 17:59:12,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 17:59:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2020-10-23 17:59:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2020-10-23 17:59:12,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:12,873 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:13,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 17:59:13,088 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 17:59:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 17:59:13,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2114856643, now seen corresponding path program 7 times [2020-10-23 17:59:13,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 17:59:13,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887646811] [2020-10-23 17:59:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 17:59:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 17:59:13,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 17:59:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 17:59:13,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 17:59:13,490 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 17:59:13,490 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 17:59:13,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-23 17:59:13,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 05:59:13 BoogieIcfgContainer [2020-10-23 17:59:13,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 17:59:13,680 INFO L168 Benchmark]: Toolchain (without parser) took 17003.57 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 126.9 MB in the beginning and 120.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 170.9 MB. Max. memory is 8.0 GB. [2020-10-23 17:59:13,681 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 17:59:13,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 238.02 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 117.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-10-23 17:59:13,684 INFO L168 Benchmark]: Boogie Preprocessor took 34.78 ms. Allocated memory is still 151.0 MB. Free memory was 117.2 MB in the beginning and 115.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 17:59:13,687 INFO L168 Benchmark]: RCFGBuilder took 449.97 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 103.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 17:59:13,688 INFO L168 Benchmark]: TraceAbstraction took 16263.73 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 102.6 MB in the beginning and 120.1 MB in the end (delta: -17.5 MB). Peak memory consumption was 146.8 MB. Max. memory is 8.0 GB. [2020-10-23 17:59:13,693 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 151.0 MB. Free memory is still 123.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 238.02 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 117.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.78 ms. Allocated memory is still 151.0 MB. Free memory was 117.2 MB in the beginning and 115.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 449.97 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 103.0 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16263.73 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 102.6 MB in the beginning and 120.1 MB in the end (delta: -17.5 MB). Peak memory consumption was 146.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] CALL reach_error() [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.9s, OverallIterations: 10, TraceHistogramMax: 67, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 193 SDtfs, 645 SDslu, 293 SDs, 0 SdLazy, 1628 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 1055 SyntacticMatches, 3 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 2154 NumberOfCodeBlocks, 1921 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1673 ConstructedInterpolants, 0 QuantifiedInterpolants, 509537 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1673 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 12893/17130 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...