/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 06:58:36,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 06:58:36,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 06:58:36,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 06:58:36,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 06:58:36,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 06:58:36,638 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 06:58:36,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 06:58:36,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 06:58:36,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 06:58:36,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 06:58:36,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 06:58:36,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 06:58:36,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 06:58:36,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 06:58:36,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 06:58:36,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 06:58:36,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 06:58:36,696 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 06:58:36,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 06:58:36,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 06:58:36,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 06:58:36,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 06:58:36,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 06:58:36,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 06:58:36,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 06:58:36,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 06:58:36,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 06:58:36,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 06:58:36,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 06:58:36,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 06:58:36,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 06:58:36,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 06:58:36,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 06:58:36,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 06:58:36,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 06:58:36,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 06:58:36,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 06:58:36,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 06:58:36,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 06:58:36,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 06:58:36,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 06:58:36,789 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 06:58:36,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 06:58:36,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 06:58:36,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 06:58:36,795 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 06:58:36,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 06:58:36,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 06:58:36,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 06:58:36,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 06:58:36,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 06:58:36,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 06:58:36,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 06:58:36,798 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 06:58:36,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 06:58:36,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 06:58:36,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 06:58:36,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 06:58:36,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 06:58:36,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 06:58:36,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 06:58:36,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 06:58:36,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 06:58:36,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 06:58:36,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 06:58:36,800 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 06:58:36,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 06:58:37,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 06:58:37,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 06:58:37,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 06:58:37,297 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 06:58:37,298 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 06:58:37,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2020-12-22 06:58:37,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72be6027/ccee22fad84044ef93a9167db56da94d/FLAGe9fc6226d [2020-12-22 06:58:38,062 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 06:58:38,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2020-12-22 06:58:38,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72be6027/ccee22fad84044ef93a9167db56da94d/FLAGe9fc6226d [2020-12-22 06:58:38,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b72be6027/ccee22fad84044ef93a9167db56da94d [2020-12-22 06:58:38,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 06:58:38,417 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 06:58:38,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 06:58:38,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 06:58:38,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 06:58:38,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78012b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38, skipping insertion in model container [2020-12-22 06:58:38,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 06:58:38,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 06:58:38,655 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2020-12-22 06:58:38,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 06:58:38,670 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 06:58:38,687 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2020-12-22 06:58:38,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 06:58:38,703 INFO L208 MainTranslator]: Completed translation [2020-12-22 06:58:38,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38 WrapperNode [2020-12-22 06:58:38,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 06:58:38,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 06:58:38,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 06:58:38,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 06:58:38,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 06:58:38,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 06:58:38,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 06:58:38,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 06:58:38,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... [2020-12-22 06:58:38,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 06:58:38,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 06:58:38,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 06:58:38,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 06:58:38,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 06:58:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 06:58:38,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 06:58:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 06:58:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 06:58:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-12-22 06:58:38,871 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-12-22 06:58:39,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 06:58:39,167 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-22 06:58:39,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:58:39 BoogieIcfgContainer [2020-12-22 06:58:39,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 06:58:39,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 06:58:39,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 06:58:39,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 06:58:39,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 06:58:38" (1/3) ... [2020-12-22 06:58:39,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9b7344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 06:58:39, skipping insertion in model container [2020-12-22 06:58:39,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:58:38" (2/3) ... [2020-12-22 06:58:39,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9b7344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 06:58:39, skipping insertion in model container [2020-12-22 06:58:39,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:58:39" (3/3) ... [2020-12-22 06:58:39,182 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-12-22 06:58:39,192 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 06:58:39,199 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 06:58:39,256 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 06:58:39,326 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 06:58:39,330 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 06:58:39,330 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 06:58:39,331 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 06:58:39,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 06:58:39,331 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 06:58:39,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 06:58:39,331 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 06:58:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-12-22 06:58:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 06:58:39,366 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:39,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:39,367 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2020-12-22 06:58:39,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:39,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188332563] [2020-12-22 06:58:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:39,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 06:58:39,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188332563] [2020-12-22 06:58:39,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 06:58:39,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 06:58:39,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995372267] [2020-12-22 06:58:39,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 06:58:39,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 06:58:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 06:58:39,824 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-12-22 06:58:39,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:39,895 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-12-22 06:58:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 06:58:39,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-22 06:58:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:39,910 INFO L225 Difference]: With dead ends: 34 [2020-12-22 06:58:39,911 INFO L226 Difference]: Without dead ends: 18 [2020-12-22 06:58:39,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 06:58:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-12-22 06:58:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-12-22 06:58:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-22 06:58:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-22 06:58:39,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-12-22 06:58:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:39,966 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-22 06:58:39,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 06:58:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-22 06:58:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 06:58:39,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:39,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:39,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 06:58:39,969 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:39,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2020-12-22 06:58:39,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:39,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536925134] [2020-12-22 06:58:39,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 06:58:40,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536925134] [2020-12-22 06:58:40,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 06:58:40,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 06:58:40,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946285384] [2020-12-22 06:58:40,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 06:58:40,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 06:58:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 06:58:40,087 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-12-22 06:58:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:40,137 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-12-22 06:58:40,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 06:58:40,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-22 06:58:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:40,140 INFO L225 Difference]: With dead ends: 24 [2020-12-22 06:58:40,141 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 06:58:40,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 06:58:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 06:58:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-12-22 06:58:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-22 06:58:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-22 06:58:40,148 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-12-22 06:58:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:40,149 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-22 06:58:40,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 06:58:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-22 06:58:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 06:58:40,150 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:40,151 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:40,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 06:58:40,151 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2020-12-22 06:58:40,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:40,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658843879] [2020-12-22 06:58:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-22 06:58:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 06:58:40,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658843879] [2020-12-22 06:58:40,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222271968] [2020-12-22 06:58:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 06:58:40,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 06:58:40,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:40,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-22 06:58:40,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412840780] [2020-12-22 06:58:40,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 06:58:40,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 06:58:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-22 06:58:40,502 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-12-22 06:58:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:40,615 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-12-22 06:58:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 06:58:40,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-22 06:58:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:40,618 INFO L225 Difference]: With dead ends: 35 [2020-12-22 06:58:40,618 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 06:58:40,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-22 06:58:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 06:58:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-22 06:58:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-22 06:58:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-12-22 06:58:40,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-12-22 06:58:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:40,628 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-12-22 06:58:40,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 06:58:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-12-22 06:58:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 06:58:40,630 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:40,631 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:40,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-22 06:58:40,846 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2020-12-22 06:58:40,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:40,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112841955] [2020-12-22 06:58:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 06:58:40,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112841955] [2020-12-22 06:58:40,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390897674] [2020-12-22 06:58:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 06:58:41,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:41,123 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 06:58:41,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:41,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-12-22 06:58:41,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289327926] [2020-12-22 06:58:41,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 06:58:41,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:41,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 06:58:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-22 06:58:41,127 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 8 states. [2020-12-22 06:58:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:41,230 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-12-22 06:58:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 06:58:41,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-22 06:58:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:41,239 INFO L225 Difference]: With dead ends: 38 [2020-12-22 06:58:41,240 INFO L226 Difference]: Without dead ends: 34 [2020-12-22 06:58:41,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-22 06:58:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-22 06:58:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-12-22 06:58:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-22 06:58:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-12-22 06:58:41,272 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-12-22 06:58:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:41,273 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-12-22 06:58:41,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 06:58:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-12-22 06:58:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 06:58:41,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:41,277 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:41,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:41,492 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:41,493 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2020-12-22 06:58:41,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:41,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249231595] [2020-12-22 06:58:41,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-22 06:58:41,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249231595] [2020-12-22 06:58:41,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145165661] [2020-12-22 06:58:41,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:41,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 06:58:41,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:41,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 06:58:41,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 06:58:41,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:41,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-12-22 06:58:41,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934422717] [2020-12-22 06:58:41,818 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 06:58:41,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 06:58:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-12-22 06:58:41,819 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 13 states. [2020-12-22 06:58:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:42,019 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-12-22 06:58:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 06:58:42,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-12-22 06:58:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:42,021 INFO L225 Difference]: With dead ends: 69 [2020-12-22 06:58:42,021 INFO L226 Difference]: Without dead ends: 38 [2020-12-22 06:58:42,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-12-22 06:58:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-22 06:58:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-22 06:58:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-22 06:58:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-12-22 06:58:42,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-12-22 06:58:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:42,032 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-12-22 06:58:42,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 06:58:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-12-22 06:58:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-22 06:58:42,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:42,035 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:42,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:42,249 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:42,251 INFO L82 PathProgramCache]: Analyzing trace with hash 366248375, now seen corresponding path program 3 times [2020-12-22 06:58:42,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:42,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316928025] [2020-12-22 06:58:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-22 06:58:42,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316928025] [2020-12-22 06:58:42,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009803998] [2020-12-22 06:58:42,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:42,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-22 06:58:42,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:42,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 06:58:42,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-12-22 06:58:42,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:42,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2020-12-22 06:58:42,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413962791] [2020-12-22 06:58:42,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 06:58:42,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:42,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 06:58:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-22 06:58:42,902 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 13 states. [2020-12-22 06:58:43,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:43,114 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-12-22 06:58:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 06:58:43,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2020-12-22 06:58:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:43,118 INFO L225 Difference]: With dead ends: 94 [2020-12-22 06:58:43,118 INFO L226 Difference]: Without dead ends: 90 [2020-12-22 06:58:43,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-12-22 06:58:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-22 06:58:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-12-22 06:58:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-22 06:58:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-12-22 06:58:43,137 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-12-22 06:58:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:43,138 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-12-22 06:58:43,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 06:58:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-12-22 06:58:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-22 06:58:43,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:43,142 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:43,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:43,357 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 4 times [2020-12-22 06:58:43,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:43,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822796811] [2020-12-22 06:58:43,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:43,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2020-12-22 06:58:44,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822796811] [2020-12-22 06:58:44,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033794600] [2020-12-22 06:58:44,220 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:44,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 06:58:44,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:44,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 06:58:44,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-12-22 06:58:44,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:44,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 22 [2020-12-22 06:58:44,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923173151] [2020-12-22 06:58:44,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-22 06:58:44,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-22 06:58:44,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2020-12-22 06:58:44,674 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 22 states. [2020-12-22 06:58:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:45,290 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2020-12-22 06:58:45,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-22 06:58:45,290 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2020-12-22 06:58:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:45,293 INFO L225 Difference]: With dead ends: 170 [2020-12-22 06:58:45,293 INFO L226 Difference]: Without dead ends: 87 [2020-12-22 06:58:45,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2020-12-22 06:58:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-22 06:58:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-12-22 06:58:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-22 06:58:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2020-12-22 06:58:45,311 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 215 [2020-12-22 06:58:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:45,311 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2020-12-22 06:58:45,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-22 06:58:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2020-12-22 06:58:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-12-22 06:58:45,316 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:45,316 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:45,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-22 06:58:45,530 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:45,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 5 times [2020-12-22 06:58:45,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:45,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804641122] [2020-12-22 06:58:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:45,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:45,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:45,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:45,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-12-22 06:58:46,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804641122] [2020-12-22 06:58:46,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653157644] [2020-12-22 06:58:46,560 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:46,750 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2020-12-22 06:58:46,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:46,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 06:58:46,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2020-12-22 06:58:47,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:47,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2020-12-22 06:58:47,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708791431] [2020-12-22 06:58:47,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-22 06:58:47,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:47,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-22 06:58:47,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2020-12-22 06:58:47,169 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand 19 states. [2020-12-22 06:58:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:47,456 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2020-12-22 06:58:47,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 06:58:47,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 283 [2020-12-22 06:58:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:47,460 INFO L225 Difference]: With dead ends: 170 [2020-12-22 06:58:47,460 INFO L226 Difference]: Without dead ends: 101 [2020-12-22 06:58:47,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2020-12-22 06:58:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-22 06:58:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-12-22 06:58:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-22 06:58:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2020-12-22 06:58:47,476 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 283 [2020-12-22 06:58:47,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:47,476 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2020-12-22 06:58:47,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-22 06:58:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2020-12-22 06:58:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2020-12-22 06:58:47,490 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:47,490 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:47,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:47,704 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 6 times [2020-12-22 06:58:47,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:47,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115156104] [2020-12-22 06:58:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:48,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-22 06:58:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:49,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2020-12-22 06:58:50,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115156104] [2020-12-22 06:58:50,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350046293] [2020-12-22 06:58:50,069 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:50,228 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-12-22 06:58:50,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:58:50,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-22 06:58:50,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 709 proven. 2234 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2020-12-22 06:58:50,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:50,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 11] total 30 [2020-12-22 06:58:50,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813846446] [2020-12-22 06:58:50,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-22 06:58:50,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:50,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-22 06:58:50,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2020-12-22 06:58:50,949 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand 30 states. [2020-12-22 06:58:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:51,961 INFO L93 Difference]: Finished difference Result 210 states and 401 transitions. [2020-12-22 06:58:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-12-22 06:58:51,962 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 569 [2020-12-22 06:58:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:51,966 INFO L225 Difference]: With dead ends: 210 [2020-12-22 06:58:51,966 INFO L226 Difference]: Without dead ends: 131 [2020-12-22 06:58:51,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=558, Invalid=2094, Unknown=0, NotChecked=0, Total=2652 [2020-12-22 06:58:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-22 06:58:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2020-12-22 06:58:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-22 06:58:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2020-12-22 06:58:51,987 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 569 [2020-12-22 06:58:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:51,988 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2020-12-22 06:58:51,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-22 06:58:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2020-12-22 06:58:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2020-12-22 06:58:52,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:52,013 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:52,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:52,228 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash -861966516, now seen corresponding path program 7 times [2020-12-22 06:58:52,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:52,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089608270] [2020-12-22 06:58:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:52,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:53,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-22 06:58:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-12-22 06:58:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:58:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:58:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:58:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:58:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:58:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:54,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:58:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-12-22 06:58:55,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089608270] [2020-12-22 06:58:55,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479470432] [2020-12-22 06:58:55,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:58:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:55,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-22 06:58:55,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:58:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-12-22 06:58:56,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:58:56,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 22 [2020-12-22 06:58:56,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056476683] [2020-12-22 06:58:56,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-22 06:58:56,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:58:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-22 06:58:56,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2020-12-22 06:58:56,755 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand 22 states. [2020-12-22 06:58:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:58:57,068 INFO L93 Difference]: Finished difference Result 478 states and 748 transitions. [2020-12-22 06:58:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-22 06:58:57,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 746 [2020-12-22 06:58:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:58:57,078 INFO L225 Difference]: With dead ends: 478 [2020-12-22 06:58:57,078 INFO L226 Difference]: Without dead ends: 474 [2020-12-22 06:58:57,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2020-12-22 06:58:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-12-22 06:58:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 453. [2020-12-22 06:58:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-12-22 06:58:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 703 transitions. [2020-12-22 06:58:57,138 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 703 transitions. Word has length 746 [2020-12-22 06:58:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:58:57,140 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 703 transitions. [2020-12-22 06:58:57,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-22 06:58:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 703 transitions. [2020-12-22 06:58:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2020-12-22 06:58:57,160 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:58:57,161 INFO L422 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:58:57,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 06:58:57,376 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:58:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:58:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 8 times [2020-12-22 06:58:57,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:58:57,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941232592] [2020-12-22 06:58:57,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:58:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:58,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 06:58:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:58:59,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:58:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:59:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:59:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-22 06:59:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:00,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:59:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-12-22 06:59:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:59:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:59:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:01,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:02,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2020-12-22 06:59:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:02,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:02,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:02,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:59:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:59:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-22 06:59:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:59:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-12-22 06:59:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 06:59:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:03,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-22 06:59:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 06:59:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 06:59:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 06:59:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 06:59:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:04,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 06:59:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 06:59:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6145 proven. 13082 refuted. 0 times theorem prover too weak. 115377 trivial. 0 not checked. [2020-12-22 06:59:06,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941232592] [2020-12-22 06:59:06,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405671746] [2020-12-22 06:59:06,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:59:06,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 06:59:06,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 06:59:06,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 3349 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-22 06:59:06,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 06:59:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6930 proven. 4817 refuted. 0 times theorem prover too weak. 122857 trivial. 0 not checked. [2020-12-22 06:59:08,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 06:59:08,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 40 [2020-12-22 06:59:08,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883042507] [2020-12-22 06:59:08,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-22 06:59:08,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 06:59:08,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-22 06:59:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2020-12-22 06:59:08,886 INFO L87 Difference]: Start difference. First operand 453 states and 703 transitions. Second operand 40 states. [2020-12-22 06:59:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 06:59:10,479 INFO L93 Difference]: Finished difference Result 670 states and 1318 transitions. [2020-12-22 06:59:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-12-22 06:59:10,480 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1495 [2020-12-22 06:59:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 06:59:10,486 INFO L225 Difference]: With dead ends: 670 [2020-12-22 06:59:10,486 INFO L226 Difference]: Without dead ends: 204 [2020-12-22 06:59:10,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1930 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1021, Invalid=4529, Unknown=0, NotChecked=0, Total=5550 [2020-12-22 06:59:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-22 06:59:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2020-12-22 06:59:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-22 06:59:10,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 212 transitions. [2020-12-22 06:59:10,512 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 212 transitions. Word has length 1495 [2020-12-22 06:59:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 06:59:10,514 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 212 transitions. [2020-12-22 06:59:10,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-22 06:59:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 212 transitions. [2020-12-22 06:59:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2020-12-22 06:59:10,530 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 06:59:10,531 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 06:59:10,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 06:59:10,746 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 06:59:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 06:59:10,748 INFO L82 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 9 times [2020-12-22 06:59:10,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 06:59:10,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527179310] [2020-12-22 06:59:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 06:59:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 06:59:11,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 06:59:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 06:59:11,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 06:59:12,165 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 06:59:12,165 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 06:59:12,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 06:59:12,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 06:59:12 BoogieIcfgContainer [2020-12-22 06:59:12,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 06:59:12,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 06:59:12,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 06:59:12,548 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 06:59:12,549 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:58:39" (3/4) ... [2020-12-22 06:59:12,551 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 06:59:12,892 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive-simple/fibo_10-1.c-witness.graphml [2020-12-22 06:59:12,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 06:59:12,895 INFO L168 Benchmark]: Toolchain (without parser) took 34476.80 ms. Allocated memory was 156.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 132.7 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 364.8 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,895 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 156.2 MB. Free memory is still 128.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 06:59:12,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.60 ms. Allocated memory is still 156.2 MB. Free memory was 132.4 MB in the beginning and 123.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 156.2 MB. Free memory was 123.2 MB in the beginning and 121.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,897 INFO L168 Benchmark]: Boogie Preprocessor took 20.96 ms. Allocated memory is still 156.2 MB. Free memory was 121.4 MB in the beginning and 120.5 MB in the end (delta: 887.8 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,897 INFO L168 Benchmark]: RCFGBuilder took 404.30 ms. Allocated memory is still 156.2 MB. Free memory was 120.4 MB in the beginning and 108.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,897 INFO L168 Benchmark]: TraceAbstraction took 33375.42 ms. Allocated memory was 156.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 108.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 292.4 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,898 INFO L168 Benchmark]: Witness Printer took 344.43 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. [2020-12-22 06:59:12,900 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.22 ms. Allocated memory is still 156.2 MB. Free memory is still 128.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 284.60 ms. Allocated memory is still 156.2 MB. Free memory was 132.4 MB in the beginning and 123.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 37.45 ms. Allocated memory is still 156.2 MB. Free memory was 123.2 MB in the beginning and 121.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 20.96 ms. Allocated memory is still 156.2 MB. Free memory was 121.4 MB in the beginning and 120.5 MB in the end (delta: 887.8 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 404.30 ms. Allocated memory is still 156.2 MB. Free memory was 120.4 MB in the beginning and 108.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 33375.42 ms. Allocated memory was 156.2 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 108.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 292.4 MB. Max. memory is 8.0 GB. * Witness Printer took 344.43 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int 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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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 [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 [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); [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 [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); [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); [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 [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 [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); [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 [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); [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 [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 [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); [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); [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); [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); [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); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.8s, OverallIterations: 12, TraceHistogramMax: 219, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 1122 SDslu, 944 SDs, 0 SdLazy, 2712 SolverSat, 1348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4730 GetRequests, 4477 SyntacticMatches, 2 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 112 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 8172 NumberOfCodeBlocks, 7690 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 6943 ConstructedInterpolants, 0 QuantifiedInterpolants, 7888801 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6852 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 353268/388638 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...