/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:39:17,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:39:17,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:39:17,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:39:17,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:39:17,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:39:17,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:39:17,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:39:17,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:39:17,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:39:17,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:39:17,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:39:17,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:39:17,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:39:17,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:39:17,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:39:17,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:39:17,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:39:17,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:39:17,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:39:17,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:39:17,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:39:17,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:39:17,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:39:17,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:39:17,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:39:17,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:39:17,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:39:17,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:39:17,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:39:17,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:39:17,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:39:17,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:39:17,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:39:17,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:39:17,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:39:17,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:39:17,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:39:17,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:39:17,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:39:17,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:39:17,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:39:18,023 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:39:18,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:39:18,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:39:18,033 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:39:18,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:39:18,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:39:18,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:39:18,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:39:18,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:39:18,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:39:18,036 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:39:18,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:39:18,036 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:39:18,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:39:18,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:39:18,039 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:39:18,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:39:18,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:39:18,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:39:18,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:39:18,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:39:18,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:39:18,041 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:39:18,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:39:18,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:39:18,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:39:18,515 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:39:18,516 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:39:18,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-10-24 00:39:18,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8136b96/5393a50d98e24deea0ace450884a9b43/FLAG445a8f068 [2020-10-24 00:39:19,209 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:39:19,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-10-24 00:39:19,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8136b96/5393a50d98e24deea0ace450884a9b43/FLAG445a8f068 [2020-10-24 00:39:19,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8136b96/5393a50d98e24deea0ace450884a9b43 [2020-10-24 00:39:19,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:39:19,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:39:19,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:39:19,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:39:19,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:39:19,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b37de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19, skipping insertion in model container [2020-10-24 00:39:19,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:39:19,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:39:19,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:39:19,868 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:39:19,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:39:19,904 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:39:19,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19 WrapperNode [2020-10-24 00:39:19,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:39:19,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:39:19,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:39:19,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:39:19,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (1/1) ... [2020-10-24 00:39:19,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:39:19,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:39:19,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:39:19,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:39:19,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (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-24 00:39:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:39:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:39:20,050 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:39:20,050 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-24 00:39:20,050 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:39:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:39:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:39:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:39:20,051 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:39:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:39:20,052 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-24 00:39:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:39:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:39:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:39:20,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:39:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:39:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:39:20,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:39:20,324 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:39:20,325 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:39:20,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:39:20 BoogieIcfgContainer [2020-10-24 00:39:20,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:39:20,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:39:20,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:39:20,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:39:20,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:39:19" (1/3) ... [2020-10-24 00:39:20,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65063c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:39:20, skipping insertion in model container [2020-10-24 00:39:20,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:39:19" (2/3) ... [2020-10-24 00:39:20,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65063c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:39:20, skipping insertion in model container [2020-10-24 00:39:20,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:39:20" (3/3) ... [2020-10-24 00:39:20,336 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-10-24 00:39:20,351 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:39:20,357 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:39:20,376 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:39:20,407 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:39:20,408 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:39:20,408 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:39:20,408 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:39:20,408 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:39:20,408 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:39:20,409 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:39:20,409 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:39:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2020-10-24 00:39:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:39:20,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:20,440 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:20,441 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -32329728, now seen corresponding path program 1 times [2020-10-24 00:39:20,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:20,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923275667] [2020-10-24 00:39:20,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:20,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:20,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:20,964 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-24 00:39:20,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923275667] [2020-10-24 00:39:20,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:39:20,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:39:20,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576678177] [2020-10-24 00:39:20,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:39:20,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:39:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:39:20,997 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 6 states. [2020-10-24 00:39:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:21,444 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-10-24 00:39:21,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:39:21,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:39:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:21,456 INFO L225 Difference]: With dead ends: 60 [2020-10-24 00:39:21,457 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:39:21,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:39:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:39:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:39:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:39:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:39:21,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 25 [2020-10-24 00:39:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:21,519 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:39:21,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:39:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:39:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 00:39:21,522 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:21,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:21,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:39:21,523 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash 950139466, now seen corresponding path program 1 times [2020-10-24 00:39:21,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:21,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [824589450] [2020-10-24 00:39:21,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:21,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:21,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:21,703 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-24 00:39:21,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [824589450] [2020-10-24 00:39:21,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:39:21,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:39:21,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975602303] [2020-10-24 00:39:21,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:39:21,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:21,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:39:21,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:39:21,710 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2020-10-24 00:39:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:22,049 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2020-10-24 00:39:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:39:22,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-24 00:39:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:22,052 INFO L225 Difference]: With dead ends: 46 [2020-10-24 00:39:22,053 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:39:22,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:39:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:39:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-10-24 00:39:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:39:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2020-10-24 00:39:22,068 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2020-10-24 00:39:22,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:22,068 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2020-10-24 00:39:22,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:39:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-10-24 00:39:22,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 00:39:22,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:22,071 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:22,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:39:22,071 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:22,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:22,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718643, now seen corresponding path program 1 times [2020-10-24 00:39:22,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:22,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [145116328] [2020-10-24 00:39:22,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-24 00:39:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 00:39:22,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [145116328] [2020-10-24 00:39:22,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:22,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:39:22,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056054417] [2020-10-24 00:39:22,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:39:22,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:39:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:39:22,237 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2020-10-24 00:39:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:22,531 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2020-10-24 00:39:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:39:22,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-10-24 00:39:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:22,534 INFO L225 Difference]: With dead ends: 62 [2020-10-24 00:39:22,534 INFO L226 Difference]: Without dead ends: 39 [2020-10-24 00:39:22,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:39:22,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-24 00:39:22,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-24 00:39:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 00:39:22,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2020-10-24 00:39:22,549 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 42 [2020-10-24 00:39:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:22,550 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2020-10-24 00:39:22,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:39:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2020-10-24 00:39:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 00:39:22,552 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:22,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:22,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:39:22,552 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:22,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:22,553 INFO L82 PathProgramCache]: Analyzing trace with hash 195045207, now seen corresponding path program 1 times [2020-10-24 00:39:22,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:22,554 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243549904] [2020-10-24 00:39:22,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:22,731 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-24 00:39:22,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243549904] [2020-10-24 00:39:22,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:22,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:39:22,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258708358] [2020-10-24 00:39:22,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:39:22,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:22,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:39:22,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:39:22,735 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2020-10-24 00:39:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:23,122 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2020-10-24 00:39:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:39:23,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-10-24 00:39:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:23,125 INFO L225 Difference]: With dead ends: 66 [2020-10-24 00:39:23,125 INFO L226 Difference]: Without dead ends: 59 [2020-10-24 00:39:23,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:39:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-24 00:39:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-24 00:39:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 00:39:23,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2020-10-24 00:39:23,145 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 43 [2020-10-24 00:39:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:23,146 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2020-10-24 00:39:23,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:39:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2020-10-24 00:39:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 00:39:23,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:23,149 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:23,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:39:23,149 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash -396245802, now seen corresponding path program 2 times [2020-10-24 00:39:23,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:23,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1262085692] [2020-10-24 00:39:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-24 00:39:23,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1262085692] [2020-10-24 00:39:23,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:23,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:39:23,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076248485] [2020-10-24 00:39:23,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:39:23,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:39:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:39:23,363 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 8 states. [2020-10-24 00:39:23,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:23,893 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2020-10-24 00:39:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:39:23,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2020-10-24 00:39:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:23,899 INFO L225 Difference]: With dead ends: 118 [2020-10-24 00:39:23,899 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 00:39:23,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:39:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 00:39:23,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-10-24 00:39:23,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:39:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2020-10-24 00:39:23,929 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 60 [2020-10-24 00:39:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:23,930 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2020-10-24 00:39:23,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:39:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2020-10-24 00:39:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 00:39:23,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:23,933 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:23,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:39:23,933 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash -13012784, now seen corresponding path program 3 times [2020-10-24 00:39:23,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:23,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [989162621] [2020-10-24 00:39:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:23,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-24 00:39:24,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [989162621] [2020-10-24 00:39:24,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:24,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:39:24,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305950639] [2020-10-24 00:39:24,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:39:24,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:24,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:39:24,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:39:24,091 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2020-10-24 00:39:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:24,569 INFO L93 Difference]: Finished difference Result 96 states and 124 transitions. [2020-10-24 00:39:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:39:24,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2020-10-24 00:39:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:24,577 INFO L225 Difference]: With dead ends: 96 [2020-10-24 00:39:24,577 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 00:39:24,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:39:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 00:39:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2020-10-24 00:39:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 00:39:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2020-10-24 00:39:24,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 61 [2020-10-24 00:39:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:24,632 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2020-10-24 00:39:24,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:39:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2020-10-24 00:39:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 00:39:24,637 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:24,638 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:24,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:39:24,638 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 159854214, now seen corresponding path program 4 times [2020-10-24 00:39:24,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:24,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1702717801] [2020-10-24 00:39:24,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 36 proven. 197 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2020-10-24 00:39:24,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1702717801] [2020-10-24 00:39:24,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:24,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:39:24,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074810191] [2020-10-24 00:39:24,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:39:24,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:24,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:39:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:39:24,976 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand 9 states. [2020-10-24 00:39:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:25,678 INFO L93 Difference]: Finished difference Result 146 states and 199 transitions. [2020-10-24 00:39:25,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:39:25,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2020-10-24 00:39:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:25,683 INFO L225 Difference]: With dead ends: 146 [2020-10-24 00:39:25,683 INFO L226 Difference]: Without dead ends: 139 [2020-10-24 00:39:25,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:39:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-24 00:39:25,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2020-10-24 00:39:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 00:39:25,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2020-10-24 00:39:25,730 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 132 [2020-10-24 00:39:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:25,731 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2020-10-24 00:39:25,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:39:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2020-10-24 00:39:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2020-10-24 00:39:25,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:25,735 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:25,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:39:25,736 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:25,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:25,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1497778840, now seen corresponding path program 5 times [2020-10-24 00:39:25,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:25,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1414822225] [2020-10-24 00:39:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:25,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:25,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:25,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-10-24 00:39:26,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1414822225] [2020-10-24 00:39:26,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:26,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:39:26,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346729101] [2020-10-24 00:39:26,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:39:26,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:26,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:39:26,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:39:26,266 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand 10 states. [2020-10-24 00:39:27,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:27,163 INFO L93 Difference]: Finished difference Result 240 states and 348 transitions. [2020-10-24 00:39:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:39:27,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 202 [2020-10-24 00:39:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:27,169 INFO L225 Difference]: With dead ends: 240 [2020-10-24 00:39:27,169 INFO L226 Difference]: Without dead ends: 233 [2020-10-24 00:39:27,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:39:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-10-24 00:39:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 215. [2020-10-24 00:39:27,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-24 00:39:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2020-10-24 00:39:27,235 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 202 [2020-10-24 00:39:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:27,236 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2020-10-24 00:39:27,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:39:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2020-10-24 00:39:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-10-24 00:39:27,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:27,242 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:27,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:39:27,242 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash -509020704, now seen corresponding path program 6 times [2020-10-24 00:39:27,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:27,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [543275426] [2020-10-24 00:39:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-10-24 00:39:27,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [543275426] [2020-10-24 00:39:27,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:27,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:39:27,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764122121] [2020-10-24 00:39:27,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:39:27,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:39:27,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:39:27,767 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand 11 states. [2020-10-24 00:39:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:28,814 INFO L93 Difference]: Finished difference Result 422 states and 653 transitions. [2020-10-24 00:39:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:39:28,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 237 [2020-10-24 00:39:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:28,826 INFO L225 Difference]: With dead ends: 422 [2020-10-24 00:39:28,826 INFO L226 Difference]: Without dead ends: 415 [2020-10-24 00:39:28,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:39:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-24 00:39:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 391. [2020-10-24 00:39:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-10-24 00:39:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 617 transitions. [2020-10-24 00:39:28,948 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 617 transitions. Word has length 237 [2020-10-24 00:39:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:28,949 INFO L481 AbstractCegarLoop]: Abstraction has 391 states and 617 transitions. [2020-10-24 00:39:28,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:39:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 617 transitions. [2020-10-24 00:39:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2020-10-24 00:39:28,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:28,965 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 15, 15, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:28,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:39:28,965 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1781154385, now seen corresponding path program 7 times [2020-10-24 00:39:28,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:28,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [979639923] [2020-10-24 00:39:28,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 00:39:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:29,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:30,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:30,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:30,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6939 backedges. 1724 proven. 1617 refuted. 0 times theorem prover too weak. 3598 trivial. 0 not checked. [2020-10-24 00:39:30,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [979639923] [2020-10-24 00:39:30,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:30,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:39:30,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814571369] [2020-10-24 00:39:30,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:39:30,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:39:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:39:30,349 INFO L87 Difference]: Start difference. First operand 391 states and 617 transitions. Second operand 18 states. [2020-10-24 00:39:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:33,390 INFO L93 Difference]: Finished difference Result 537 states and 953 transitions. [2020-10-24 00:39:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-10-24 00:39:33,391 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 431 [2020-10-24 00:39:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:33,399 INFO L225 Difference]: With dead ends: 537 [2020-10-24 00:39:33,399 INFO L226 Difference]: Without dead ends: 159 [2020-10-24 00:39:33,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=513, Invalid=2037, Unknown=0, NotChecked=0, Total=2550 [2020-10-24 00:39:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-24 00:39:33,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2020-10-24 00:39:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-10-24 00:39:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2020-10-24 00:39:33,432 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 431 [2020-10-24 00:39:33,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:33,433 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2020-10-24 00:39:33,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:39:33,433 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2020-10-24 00:39:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2020-10-24 00:39:33,450 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:33,450 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:33,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:39:33,451 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash -240553225, now seen corresponding path program 8 times [2020-10-24 00:39:33,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:33,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980622217] [2020-10-24 00:39:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:33,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:33,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:33,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 00:39:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-10-24 00:39:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:34,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14259 backedges. 514 proven. 2746 refuted. 0 times theorem prover too weak. 10999 trivial. 0 not checked. [2020-10-24 00:39:35,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980622217] [2020-10-24 00:39:35,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:35,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:39:35,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277191482] [2020-10-24 00:39:35,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:39:35,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:35,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:39:35,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:39:35,431 INFO L87 Difference]: Start difference. First operand 134 states and 174 transitions. Second operand 13 states. [2020-10-24 00:39:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:36,693 INFO L93 Difference]: Finished difference Result 486 states and 687 transitions. [2020-10-24 00:39:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:39:36,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 607 [2020-10-24 00:39:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:36,703 INFO L225 Difference]: With dead ends: 486 [2020-10-24 00:39:36,703 INFO L226 Difference]: Without dead ends: 479 [2020-10-24 00:39:36,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:39:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-10-24 00:39:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 443. [2020-10-24 00:39:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2020-10-24 00:39:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 629 transitions. [2020-10-24 00:39:36,781 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 629 transitions. Word has length 607 [2020-10-24 00:39:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:36,782 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 629 transitions. [2020-10-24 00:39:36,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:39:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 629 transitions. [2020-10-24 00:39:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2020-10-24 00:39:36,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:36,793 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 34, 34, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:36,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:39:36,794 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:36,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1189682992, now seen corresponding path program 9 times [2020-10-24 00:39:36,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:36,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2111858201] [2020-10-24 00:39:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:37,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:39:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:37,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:39:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:37,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:37,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 00:39:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2020-10-24 00:39:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:38,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 592 [2020-10-24 00:39:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-10-24 00:39:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-10-24 00:39:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 00:39:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-10-24 00:39:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-24 00:39:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-10-24 00:39:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:39,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-10-24 00:39:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:39:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 38160 backedges. 950 proven. 5310 refuted. 0 times theorem prover too weak. 31900 trivial. 0 not checked. [2020-10-24 00:39:40,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2111858201] [2020-10-24 00:39:40,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:39:40,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:39:40,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31418126] [2020-10-24 00:39:40,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:39:40,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:39:40,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:39:40,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:39:40,551 INFO L87 Difference]: Start difference. First operand 443 states and 629 transitions. Second operand 14 states. [2020-10-24 00:39:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:39:42,175 INFO L93 Difference]: Finished difference Result 1339 states and 2002 transitions. [2020-10-24 00:39:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 00:39:42,176 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 977 [2020-10-24 00:39:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:39:42,201 INFO L225 Difference]: With dead ends: 1339 [2020-10-24 00:39:42,202 INFO L226 Difference]: Without dead ends: 1332 [2020-10-24 00:39:42,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2020-10-24 00:39:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2020-10-24 00:39:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1290. [2020-10-24 00:39:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2020-10-24 00:39:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1935 transitions. [2020-10-24 00:39:42,453 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1935 transitions. Word has length 977 [2020-10-24 00:39:42,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:39:42,455 INFO L481 AbstractCegarLoop]: Abstraction has 1290 states and 1935 transitions. [2020-10-24 00:39:42,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:39:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1935 transitions. [2020-10-24 00:39:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1577 [2020-10-24 00:39:42,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:39:42,482 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 55, 55, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:39:42,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:39:42,482 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:39:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:39:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2120852588, now seen corresponding path program 10 times [2020-10-24 00:39:42,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:39:42,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1632412887] [2020-10-24 00:39:42,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:39:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:39:42,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:39:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:39:43,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:39:44,181 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:39:44,182 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:39:44,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:39:44,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:39:44 BoogieIcfgContainer [2020-10-24 00:39:44,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:39:44,548 INFO L168 Benchmark]: Toolchain (without parser) took 24959.13 ms. Allocated memory was 161.5 MB in the beginning and 878.7 MB in the end (delta: 717.2 MB). Free memory was 138.1 MB in the beginning and 410.5 MB in the end (delta: -272.5 MB). Peak memory consumption was 445.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:39:44,549 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 125.8 MB. Free memory was 102.9 MB in the beginning and 102.8 MB in the end (delta: 62.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:39:44,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.22 ms. Allocated memory is still 161.5 MB. Free memory was 137.4 MB in the beginning and 128.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:39:44,550 INFO L168 Benchmark]: Boogie Preprocessor took 51.88 ms. Allocated memory is still 161.5 MB. Free memory was 128.3 MB in the beginning and 127.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:39:44,551 INFO L168 Benchmark]: RCFGBuilder took 366.52 ms. Allocated memory is still 161.5 MB. Free memory was 126.9 MB in the beginning and 141.3 MB in the end (delta: -14.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 8.0 GB. [2020-10-24 00:39:44,557 INFO L168 Benchmark]: TraceAbstraction took 24212.11 ms. Allocated memory was 161.5 MB in the beginning and 878.7 MB in the end (delta: 717.2 MB). Free memory was 140.9 MB in the beginning and 410.5 MB in the end (delta: -269.7 MB). Peak memory consumption was 447.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:39:44,564 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.20 ms. Allocated memory is still 125.8 MB. Free memory was 102.9 MB in the beginning and 102.8 MB in the end (delta: 62.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 316.22 ms. Allocated memory is still 161.5 MB. Free memory was 137.4 MB in the beginning and 128.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 51.88 ms. Allocated memory is still 161.5 MB. Free memory was 128.3 MB in the beginning and 127.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 366.52 ms. Allocated memory is still 161.5 MB. Free memory was 126.9 MB in the beginning and 141.3 MB in the end (delta: -14.4 MB). Peak memory consumption was 13.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24212.11 ms. Allocated memory was 161.5 MB in the beginning and 878.7 MB in the end (delta: 717.2 MB). Free memory was 140.9 MB in the beginning and 410.5 MB in the end (delta: -269.7 MB). Peak memory consumption was 447.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=8, \result=21, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=9, \result=34, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=7, \result=13, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=6, \result=8, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=8, \result=21, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); VAL [\old(n)=10, \result=55, fibo(n-1)=34, fibo(n-2)=21, n=10] [L27] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); VAL [fibo(x)=55, result=55, x=10] [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.7s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 475 SDtfs, 1236 SDslu, 697 SDs, 0 SdLazy, 2151 SolverSat, 852 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1290occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 177 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 4419 NumberOfCodeBlocks, 4419 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2831 ConstructedInterpolants, 0 QuantifiedInterpolants, 2185003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52171/63180 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...